The well-founded semantics for general logic programs
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Extending the Stable Model Semantics with More Expressive Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Efficient constraint propagation engines
ACM Transactions on Programming Languages and Systems (TOPLAS)
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Integrating answer set programming and constraint logic programming
Annals of Mathematics and Artificial Intelligence
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Equilibria in heterogeneous nonmonotonic multi-context systems
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A uniform integration of higher-order reasoning and external evaluations in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A model-theoretic counterpart of loop formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Symmetric splitting in the general theory of stable models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
SAT(ID): satisfiability of propositional logic extended with inductive definitions
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Combining nonmonotonic knowledge bases with external sources
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
A translational approach to constraint answer set solving
Theory and Practice of Logic Programming
Stable models and circumscription
Artificial Intelligence
Abstract answer set solvers with backjumping and learning
Theory and Practice of Logic Programming
Towards an integration of answer set and constraint solving
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Translation-based constraint answer set solving
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Asp modulo csp: The clingcon system
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
Recently a logic programming language AC was proposed by Mellarkod et al. [1] to integrate answer set programming and constraint logic programming. Soon after that, a clingcon language integrating answer set programming and finite domain constraints, as well as an ezcsp language integrating answer set programming and constraint logic programming were introduced. The development of these languages and systems constitutes the appearance of a new AI subarea called constraint answer set programming. All these languages have something in common. In particular, they aim at developing new efficient inference algorithms that combine traditional answer set programming procedures and other methods in constraint programming. Yet, the exact relation between the constraint answer set programming languages and the underlying systems is not well understood. In this paper we address this issue by formally stating the precise relation between several constraint answer set programming languages - AC, clingcon, ezcsp - as well as the underlying systems.