×

zbMATH — the first resource for mathematics

Relating constraint answer set programming languages and algorithms. (English) Zbl 1334.68041
Summary: Recently a logic programming language AC was proposed by V. S. Mellarkod et al. [Ann. Math. Artif. Intell. 53, No. 1–4, 251–287 (2008; Zbl 1165.68504)] 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.

MSC:
68N17 Logic programming
Software:
Clingcon; IDP; Smodels
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Mellarkod, V. S.; Gelfond, M.; Zhang, Y., Integrating answer set programming and constraint logic programming, Ann. Math. Artif. Intell., 53, 251-287, (2008) · Zbl 1165.68504
[2] Gebser, M.; Ostrowski, M.; Schaub, T., Constraint answer set solving, (Proceedings of 25th International Conference on Logic Programming (ICLP), (2009), Springer), 235-249 · Zbl 1251.68061
[3] Ostrowski, M.; Schaub, T., Asp modulo csp: the clingcon system, theory and practice of logic programming, Theory Pract. Log. Program., 12, 485-503, (2012) · Zbl 1260.68066
[4] Balduccini, M., Representing constraint satisfaction problems in answer set programming, (Proceedings of ICLP Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP), (2009)) · Zbl 1219.68083
[5] Wittocx, J.; Mariën, M.; Denecker, M., The \scidp system: a model expansion system for an extension of classical logic, (Proceedings of Workshop on Logic and Search, Computation of Structures from Declarative Descriptions (LaSh), (2008)), 153-165, (electronic), available at
[6] Elkabani, I.; Pontelli, E.; Son, T. C., Smodels with clp and its applications: A simple and effective approach to aggregates in asp, (Demoen, B.; Lifschitz, V., ICLP, Lect. Notes Comput. Sci., vol. 3132, (2004), Springer), 73-89 · Zbl 1104.68375
[7] Baselice, S.; Bonatti, P. A.; Gelfond, M., Towards an integration of answer set and constraint solving, (Gabbrielli, M.; Gupta, G., ICLP, Lect. Notes Comput. Sci., vol. 3668, (2005), Springer), 52-66 · Zbl 1165.68481
[8] Drescher, C.; Walsh, T., Translation-based constraint answer set solving, (Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), (2011), AAAI Press), 2596-2601
[9] Drescher, C.; Walsh, T., A translational approach to constraint answer set solving, theory and practice of logic programming, Theory Pract. Log. Program., 10, 465-480, (2011)
[10] Liu, G.; Janhunen, T.; Niemelä, I., Answer set programming via mixed integer programming, (Principles of Knowledge Representation and Reasoning: Proceedings of the 13th International Conference, (2012), AAAI Press), 32-42
[11] Niemelä, I.; Simons, P., Extending the smodels system with cardinality and weight constraints, (Minker, J., Logic-Based Artificial Intelligence, (2000), Kluwer), 491-521 · Zbl 0979.68015
[12] Gebser, M.; Kaufmann, B.; Neumann, A.; Schaub, T., Conflict-driven answer set solving, (Proceedings of 20th International Joint Conference on Artificial Intelligence (IJCAIʼ07), (2007), MIT Press), 386-392
[13] Schulte, C.; Stuckey, P. J., Efficient constraint propagation engines, Trans. Program. Lang. Syst., (2008)
[14] Davis, M.; Logemann, G.; Loveland, D., A machine program for theorem proving, Commun. ACM, 5, 7, 394-397, (1962) · Zbl 0217.54002
[15] Nieuwenhuis, R.; Oliveras, A.; Tinelli, C., Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-logemann-loveland procedure to DPLL(T), J. ACM, 53, 6, 937-977, (2006) · Zbl 1326.68164
[16] Eiter, T.; Brewka, G.; Dao-Tran, M.; Fink, M.; Ianni, G.; Krennwallner, T., Combining nonmonotonic knowledge bases with external sources, (Ghilardi, S.; Sebastiani, R., 7th International Symposium on Frontiers of Combining Systems (FroCos 2009), Lecture Notes in Artificial Intelligence, vol. 5749, (2009), Springer), 18-42 · Zbl 1193.68242
[17] Eiter, T.; Ianni, G.; Schindlauer, R.; Tompits, H., A uniform integration of higher-order reasoning and external evaluations in answer set programming, (Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), (2005), Professional Book Center), 90-96
[18] Brewka, G.; Eiter, T., Equilibria in heterogeneous nonmonotonic multi-context systems, (Proceedings of National Conference on Artificial Intelligence (AAAI), (2007), AAAI Press), 385-390
[19] Lierler, Y., Abstract answer set solvers, (Proceedings of International Conference on Logic Programming (ICLP), (2008), Springer), 377-391 · Zbl 1185.68165
[20] Lierler, Y., Abstract answer set solvers with backjumping and learning, Theory Pract. Log. Program., 11, 135-169, (2011) · Zbl 1220.68038
[21] Lierler, Y.; Zhang, Y., A transition system for AC language algorithms, (Proceedings of ICLP Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP), (2011))
[22] Lierler, Y., On the relation of constraint answer set programming languages and algorithms, (Proceedings of the AAAI Conference on Artificial Intelligence, (2012), MIT Press)
[23] Kakas, A.; Kowalski, R.; Toni, F., Abductive logic programming, J. Log. Comput., 2, 719-770, (1992) · Zbl 0778.68081
[24] Lifschitz, V.; Tang, L. R.; Turner, H., Nested expressions in logic programs, Ann. Math. Artif. Intell., 25, 369-389, (1999) · Zbl 0940.68075
[25] Ferraris, P.; Lifschitz, V., Weight constraints as nested expressions, Theory Pract. Log. Program., 5, 45-74, (2005) · Zbl 1093.68017
[26] Ferraris, P.; Lee, J.; Lifschitz, V.; Palla, R., Symmetric splitting in the general theory of stable models, (Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), (2009), IJCAI Press), 797-803
[27] Simons, P., Extending the stable model semantics with more expressive rules, (Logic Programming and Non-monotonic Reasoning: Proceedings Fifth Intʼl Conf., Lecture Notes in Artificial Intelligence, vol. 1730, (1999), Springer), 305-316 · Zbl 0952.68028
[28] Van Gelder, A.; Ross, K.; Schlipf, J., The well-founded semantics for general logic programs, J. ACM, 38, 620-650, (1991) · Zbl 0799.68045
[29] Lee, J., A model-theoretic counterpart of loop formulas, (Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), (2005), Professional Book Center), 503-508
[30] Ferraris, P.; Lee, J.; Lifschitz, V., Stable models and circumscription, Artif. Intell., 175, 236-263, (2011) · Zbl 1227.68103
[31] Clark, K., Negation as failure, (Gallaire, H.; Minker, J., Logic and Data Bases, (1978), Plenum Press New York), 293-322
[32] Lierler, Y.; Truszczynski, M., Transition systems for model generators — a unifying approach, 27th Intʼl. Conference on Logic Programming (ICLPʼ11), Theory Pract. Log. Program. Special Issue, 11, 629-646, (2011) · Zbl 1222.68063
[33] Balduccini, M.; Lierler, Y.; Schueller, P., Prolog and ASP inference under one roof, (Proceedings of 12th International Conference on Logic Programming and Nonmonotonic Reasoning, (2013), Springer), 148-160 · Zbl 1405.68043
[34] Mariën, M.; Wittocx, J.; Denecker, M.; Bruynooghe, M., SAT(ID): satisfiability of propositional logic extended with inductive definitions, (Theory and Applications of Satisfiability Testing, 11th International Conference (SAT), (2008), Springer), 211-224 · Zbl 1138.68547
[35] Erdoğan, S. T.; Lifschitz, V., Definitions in answer set programming, (Lifschitz, V.; Niemelä, I., Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), (2004), Springer), 114-126 · Zbl 1121.68330
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.