Model expansion in the presence of function symbols using constraint programming

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2013, Pages 1068-1075

  De Cat, Broes ^a   Bogaerts, Bart ^a   Devriendt, Jo ^a   Denecker, Marc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Constraint Programming; Grounding; Knowledge Representation; Model Expansion

Indexed keywords

CONSTRAINT PROGRAMMING; EXPERIMENTAL EVALUATION; INDUCTIVE DEFINITIONS; KNOWLEDGE REPRESENTATION LANGUAGE; MODEL EXPANSION; PROPOSITIONAL LANGUAGE; SEARCH PERFORMANCE; TRADITIONAL APPROACHES;

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; ELECTRIC GROUNDING; KNOWLEDGE REPRESENTATION; LEARNING ALGORITHMS; TOOLS;

COMPUTER PROGRAMMING;

EID: 84897677415     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2013.159     Document Type: Conference Paper

References (28)

1. K. R. Apt, Principles of Constraint Programming. Cambridge University Press, 2003.
2. M. Balduccini, "Industrial-size scheduling with asp+cp," in LPNMR, 2011, pp. 284-296.
3. C. Baral, Knowledge Representation, Reasoning, and Declarative Problem Solving. New York, NY, USA: Cambridge University Press, 2003.
4. B. Bogaerts, B. De Cat, S. De Pooter, and M. Denecker, " IDP website," http://dtai.cs.kuleuven.be/krr/software/idp, 2012.
5. F. Calimeri, G. Ianni, and F. Ricca, " The third open answer set programming competition," CoRR, vol. abs/1206.3111, 2012.
6. B. De Cat and M. Bruynooghe, " Detection and exploitation of functional dependencies for model generation," accepted for the 29th International Conference On Logic Programming.
7. M. Denecker, Y. Lierler, M. Truszczynski, and J. Vennekens, " A tarskian informal semantics for asp," in International Conference on Logic Programming (Technical Communications), 2012.
8. M. Denecker and E. Ternovska, " A logic of nonmonotone inductive definitions," ACM Transactions on Computational Logic (TOCL), vol. 9, no. 2, pp. 14:1-14:52, Apr. 2008.
9. C. Drescher and T. Walsh, " Conflict-driven constraint answer set solving with lazy nogood generation," in AAAI, 2011.
10. C. Drescher and T. Walsh, "Translation-based constraint answer set solving," in IJCAI, 2011, pp. 2596-2601.
11. M. Gebser, B. Kaufmann, and T. Schaub, " Conflict-driven answer set solving: From theory to practice," Artif. Intell., vol. 187, pp. 52-89, 2012.
12. M. Gebser, M. Ostrowski, and T. Schaub, " Constraint answer set solving," in ICLP, ser. LNCS, P. M. Hill and D. S. Warren, Eds., vol. 5649. Springer, 2009, pp. 235-249.
13. Gecode Team, "Gecode: Generic constraint development environment," 2013, available from http://www.gecode.org.
14. M. Gelfond, V. S. Mellarkod, and Y. Zhang, " Systems integrating answer set programming and constraint programming," in LaSh, M. Denecker, Ed., 2008, pp. 145-152.
15. Y. Lierler, "On the relation of constraint answer set programming languages and algorithms, " in AAAI, J. Hoffmann and B. Selman, Eds. AAAI Press, 2012.
16. G. Liu, T. Janhunen, and I. Niemela, " Answer set programming via mixed integer programming," in KR, G. Brewka, T. Eiter, and S. A. McIlraith, Eds. AAAI Press, 2012.
17. M. Marien, J. Wittocx, M. Denecker, and M. Bruynooghe, " SAT(ID): Satisfiability of propositional logic extended with inductive definitions," in SAT, 2008, pp. 211-224.
18. K. Marriott, N. Nethercote, R. Rafeh, P. J. Stuckey, M. G. De La Banda, and M. Wallace, "The design of the Zinc modelling language," Constraints, vol. 13, no. 3, pp. 229-267 , 2008.
19. V. S. Mellarkod, M. Gelfond, and Y. Zhang, " Integrating answer set programming and constraint logic programming," Annals of Mathematics and Artificial Intelligence, vol. 53, no. 1-4, pp. 251-287, 2008.
20. N. Nethercote, P. Stuckey, R. Becket, S. Brand, G. Duck, and G. Tack, " Minizinc: Towards a standard CP modelling language," in CP07, ser. LNCS, C. Bessi ere, Ed., vol. 4741. Springer, 2007, pp. 529-543.
21. I. Niemela, "Answer set programming: A declarative approach to solving search problems, " in JELIA, 2006, pp. 15-18, invited talk.
22. M. Ostrowski and T. Schaub, " Asp modulo csp: The clingcon system," TPLP, vol. 12, no. 4-5, pp. 485-503, 2012.
23. N. Pelov, "Semantics of logic programs with aggregates," Ph.D. dissertation, K.U.Leuven, Leuven, Belgium, April 2004.
24. P. J. Stuckey, "Lazy clause generation: Combining the power of SAT and CP (and MIP) solving, " in CPAIOR, 2010, pp. 5-9.
25. N. Tamura, A. Taga, S. Kitagawa, and M. Banbara, " Compiling finite linear csp into sat," Constraints, vol. 14, no. 2, pp. 254-272, 2009.
26. A. Van Gelder, K. A. Ross, and J. S. Schlipf, " The well-founded semantics for general logic programs," Journal of the ACM, vol. 38, no. 3, pp. 620-650, 1991.
27. J. Wittocx, M. Denecker, and M. Bruynooghe, " Constraint propagation for first-order logic and inductive definitions," ACM Trans. Comput. Logic, vol. 14, no. 3, pp. 17:1-17:45, Aug. 2013.
28. J. Wittocx, M. Marien, and M. Denecker, " Grounding FO and FO(ID) with bounds," Journal of Artificial Intelligence Research, vol. 38, pp. 223-269, 2010.