Skip to main content Accessibility help

Detection and exploitation of functional dependencies for model generation



Recent work in Answer Set Programming has integrated ideas from Constraint Programming. This has led to a new field called ASP Modulo CSP (CASP), in which the ASP language is enriched with constraint atoms representing constraint satisfaction problems. These constraints have a more compact grounding and are handled by a new generation of search algorithms. However, the burden is on the modeler to exploit these new constructs in his declarative problem specifications. Here, we explore how to remove this burden by automatically generating constraint atoms. We do so in the context of FO(·)IDP, a knowledge representation language that extends first-order logic with, among others, inductive definitions, arithmetic and aggregates. We uncover functional dependencies in declarative problem specifications with a theorem prover and exploit them with a transformation that introduces functions. Experimental evaluation shows that we obtain more compact groundings and better search performance.



Hide All
Apt, K. R. 2003. Principles of Constraint Programming. Cambridge University Press.
Armstrong, W. W. 1974. Dependency structures of data base relationships. IFIP Congress, 580–580.
Balduccini, M. 2011. Industrial-size scheduling with asp+cp. In LPNMR, Delgrande, J. P. and Faber, W., Eds. Lecture Notes in Computer Science, vol. 6645. Springer, 284296.
Balduccini, M. 2012. A “conservative” approach to extending answer set programming with non-herbrand functions. In Correct Reasoning, Erdem, E., Lee, J., Lierler, Y. and Pearce, D., Eds. Lecture Notes in Computer Science, vol. 7265. Springer Berlin Heidelberg, 2439.
Baral, C. 2003. Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press, New York, NY, USA.
Bartholomew, M. and Lee, J. 2012. Stable models of formulas with intensional functions. See Brewka et al. (2012).
Baumgartner, P., Pelzer, B. and Tinelli, C. 2012. Model evolution with equality - revised and implemented. Journal of Symbolic Computation 47, 9, 10111045.
Bogaerts, B., De Cat, B., De Pooter, S. and Denecker, M. 2012. IDP website.
Brewka, G., Eiter, T. and McIlraith, S. A., Eds. 2012. Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10-14, 2012. AAAI Press.
Cabalar, P. 2011. Functional answer set programming. TPLP 11, 2–3, 203233.
Cabalar, P. 2013. Setting the stage for asp functions. The Association for Logic Programming Newsletter 26, 2 (june).
Calimeri, F., Ianni, G. and Ricca, F. 2012. The third open answer set programming competition. CoRR abs/1206.3111.
De Cat, B., Bogaerts, B., Devriendt, J. and Denecker, M. 2013. Model expansion in the presence of function symbols using constraint programming. Tech. Rep. CW 644, Departement of Computer Science, Katholieke Universiteit Leuven.
de Moura, L. M. and Bjørner, N. 2008. Z3: An efficient SMT solver. In TACAS, Ramakrishnan, C. R. and Rehof, J., Eds. LNCS, vol. 4963. Springer, 337340.
Denecker, M. and Ternovska, E. 2008. A logic of nonmonotone inductive definitions. ACM Transactions on Computational Logic (TOCL) 9, 2 (Apr.), 14:152.
Denecker, M., Vennekens, J., Bond, S., Gebser, M. and Truszczyński, M. 2009. The second answer set programming competition. In LPNMR. 637–654.
Erdem, E., Lin, F. and Schaub, T., Eds. 2009. Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings, LNCS, vol. 5753. Springer.
Gebser, M., Ostrowski, M. and Schaub, T. 2009. Constraint answer set solving. In ICLP, Hill, P. M. and Warren, D. S., Eds. LNCS, vol. 5649. Springer, 235249.
Janhunen, T., Niemelä, I. and Sevalnev, M. 2009. Computing stable models via reductions to difference logic. See Erdem et al. (2009), 142–154.
Lierler, Y. 2012. On the relation of constraint answer set programming languages and algorithms. In AAAI, Hoffmann, J. and Selman, B., Eds. AAAI Press.
Lifschitz, V. 2012. Logic programs with intensional functions. See Brewka et al. (2012).
Lin, F. and Wang, Y. 2008. Answer set programming with functions. In KR, Brewka, G. and Lang, J., Eds. AAAI Press, 454465.
Marriott, K., Nethercote, N., Rafeh, R., Stuckey, P. J., de la Banda, M. G. and Wallace, M. 2008. The design of the Zinc modelling language. Constraints 13, 3, 229267.
Mears, C., de la Banda, M. J. G., Wallace, M. and Demoen, B. 2008. A novel approach for detecting symmetries in csp models. In CPAIOR, Perron, L. and Trick, M. A., Eds. Lecture Notes in Computer Science, vol. 5015. Springer, 158172.
Niemelä, I. 2006. Answer set programming: A declarative approach to solving search problems. In JELIA. 15–18. Invited talk.
Ostrowski, M. and Schaub, T. 2012. Asp modulo csp: The clingcon system. TPLP 12, 4–5, 485503.
Pelov, N. 2004. Semantics of logic programs with aggregates. Ph.D. thesis, K.U.Leuven, Leuven, Belgium.
Pelov, N. and Ternovska, E. 2005. Reducing inductive definitions to propositional satisfiability. In ICLP, Gabbrielli, M. and Gupta, G., Eds. LNCS, vol. 3668. Springer, 221234.
Rümmer, P. 2008. A constraint sequent calculus for first-order logic with linear integer arithmetic. In LPAR, Cervesato, I., Veith, H. and Voronkov, A., Eds. Lecture Notes in Computer Science, vol. 5330. Springer, 274289.
Van Gelder, A. 1993. The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences 47, 1, 185221.
Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M. and Wischnewski, P. 2009. Spass version 3.5. In CADE, Schmidt, R. A., Ed. Lecture Notes in Computer Science, vol. 5663. Springer, 140145.
Wittocx, J., Denecker, M. and Bruynooghe, M. 2013. Constraint propagation for first-order logic and inductive definitions. ACM Transactions on Computational Logic. Accepted.
Type Description Title
Supplementary materials

De Cat and Bruynooghe supplementary material

 PDF (433 KB)
433 KB

Detection and exploitation of functional dependencies for model generation



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed