Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison
Nikolay Pelov, Emmanuel De Mot, Marc Denecker
Abstract
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there is constraint logic programming which computes a solution as an answer substitution to a query containing the variables of the constraint satisfaction problem. On the other hand there are systems based on stable model semantics, abductive systems, and first order logic model generators which compute solutions as models of some theory. This paper compares these different approaches from the point of view of knowledge representation (how declarative are the programs) and from the point of view of performance (how good are they at solving typical problems).
Create a lesson
Related papers
RAFT: A Stateful Retrieval-Augmented Framework for Troubleshooting Agents
Mingxuan Zhang, Xiaowen Wang, Anupma Sharan et al.
Q&A on Any Spreadsheet Requires Interpreting Its Grid Structure
Zofia Smoleń
Deep Noir: Autonomous Steering Discovery via Architectural Chronometry in Transformer Models
Frank E. Bobe, Gregory D. Vetaw, Darshan W. Bryner et al.
Ownership in AI-Assisted Everyday Tasks
Megan Wei, Melanie Subbiah, Audrey Lee et al.
PAA: The Probabilistic Allen Algebra: A Generative and Complete Probabilistic Extension of Allen's Interval Relations
Julian Eggert
Limits of Confidence in Diffusion
Russ Webb, Amitis Shidani, Alice Bizeul et al.