All Stories

  1. Towards a Logic Programming Tool for Cancer Data Analysis
  2. Extending Logic Programming with Labelled Variables: Model and Semantics
  3. ASP Applications in Bio-informatics: A Short Tour
  4. Preface
  5. A GPU Implementation of the ASP Computation
  6. Exploring the Use of BDDs in Conformant Planning
  7. A Theoretical Perspective of Coinductive Logic Programming
  8. On modeling planning problems in tabled logic programming
  9. Planning as tabled logic programming
  10. Constrained Community-Based Gene Regulatory Network Inference
  11. A declarative concurrent system for protein structure prediction on GPU
  12. CUD@SAT: SAT solving on GPUs
  13. Exploring the Use of GPUs in Constraint Solving
  14. Protein Structure Prediction on GPU: A Declarative Approach in a Multi-agent Framework
  15. A Multi-paradigm Tool for Large Neighborhood Search
  16. Protein Structure Analysis with Constraint Programming
  17. Autonomous agents coordination: Action languages meet CLP() and Linda
  18. Introduction to the 28th international conference on logic programming special issue
  19. A Filtering Technique for Fragment Assembly- Based Proteins Loop Modeling with Constraints
  20. A Tabled Prolog Program for Solving Sokoban
  21. Perspectives on Logic-Based Approaches for Reasoning about Actions and Change
  22. CLP-based protein fragment assembly
  23. Multivalued action languages with constraints in CLP(FD)
  24. Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal lattices
  25. A 25-Year Perspective on Logic Programming
  26. Applying model-checking to solve queries on semistructured data
  27. An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
  28. Representing Multi-agent Planning in CLP
  29. Present and Future Challenges for ASP Systems
  30. Logic Programming Techniques in Protein Structure Determination: Methodologies and Results
  31. Answer Set Programming with Constraints Using Lazy Grounding
  32. A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal  + +
  33. A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
  34. Introduction to the Special Issue on Bioinformatics and Constraints
  35. Compiling and Executing Declarative Modeling Languages to Gecode
  36. Enhancing the computation of approximate solutions of the protein structure determination problem through global constraints for discrete crystal lattices
  37. Agent-based protein structure prediction
  38. Scoring predictive models using a reduced representation of proteins: model and energy definition
  39. A constraint solver for discrete lattices, its parallelization, and application to protein structure prediction
  40. Set unification
  41. Decidability results for sets with atoms
  42. Hybrid Approaches for Rostering: A Case Study in the Integration of Constraint Programming and Local Search
  43. Heuristics, optimizations, and parallelism for protein structure prediction in CLP( FD )
  44. A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
  45. A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem
  46. Designing an urban-scale auditory alert system
  47. Disunification in ACI1 Theories
  48. An efficient algorithm for computing bisimulation equivalence
  49. Protein Folding Simulation in CCP
  50. Protein Folding in CLP( $\mathcal{FD}$ ) with Empirical Contact Energies
  51. The Subgraph Bisimulation Problem
  52. Intensional Sets in CLP
  53. Using Secondary Structure Information for Protein Folding in CLP( FD )1 1The work is partially supported by MIUR project: Automatic Aggregate –and number– Reasoning for Computing.
  54. Rank-Based Symbolic Bisimulation
  55. Operational and abstract semantics of the query language G-Log
  56. Model-Checking Based Data Retrieval
  57. Constructive negation and constraint logic programming with sets
  58. Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta.
  59. Preface
  60. Multiset Constraints and P Systems
  61. A Fast Bisimulation Algorithm
  62. Designing the Minimal Structure of Hidden Markov Model by Bisimulation
  63. Sets and constraint logic programming
  64. A necessary condition for Constructive Negation in Constraint Logic Programming
  65. Comparing Expressiveness of Set Constructor Symbols
  66. Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case
  67. {log}: A language for programming in logic with finite sets
  68. Minimal set unification
  69. A language with finite sets embedded in the CLP-scheme
  70. A WAM-based implementation of a logic language with sets
  71. Embedding finite sets in a logic programming language
  72. Reconstruction with Interval Constraints Propagation
  73. Constraint-Based Methods for Bioinformatics
  74. Multivalued Action Languages with Constraints in CLP(FD)