{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:32:07Z","timestamp":1768163527776,"version":"3.49.0"},"reference-count":78,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G.0357.06, G.0489.10"],"award-info":[{"award-number":["G.0357.06, G.0489.10"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"name":"GOA\/08\/008"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2013,8]]},"abstract":"<jats:p>\n            In Constraint Programming, constraint propagation is a basic component of constraint satisfaction solvers. Here we study constraint propagation as a basic form of inference in the context of first-order logic (FO) and extensions with inductive definitions (FO(ID)) and aggregates (FO(AGG)). In a first, semantic approach, a theory of propagators and constraint propagation is developed for theories in the context of three-valued interpretations. We present an algorithm with polynomial-time data complexity. We show that constraint propagation in this manner can be represented by a datalog program. In a second, symbolic approach, the semantic algorithm is lifted to a constraint propagation algorithm in\n            <jats:italic>symbolic structures<\/jats:italic>\n            , symbolic representations of classes of structures. The third part of the article is an overview of existing and potential applications of constraint propagation for model generation, grounding, interactive search problems, approximate methods for \u2203\u2200SO problems, and approximate query answering in incomplete databases.\n          <\/jats:p>","DOI":"10.1145\/2499937.2499938","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T11:57:11Z","timestamp":1378209431000},"page":"1-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Constraint Propagation for First-Order Logic and Inductive Definitions"],"prefix":"10.1145","volume":"14","author":[{"given":"Johan","family":"Wittocx","sequence":"first","affiliation":[{"name":"KU Leuven"}]},{"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[{"name":"KU Leuven"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[{"name":"KU Leuven"}]}],"member":"320","published-online":{"date-parts":[[2013,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28717-6_4"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90032-Z"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00032-8"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646785.706235"},{"key":"e_1_2_1_5_1","volume-title":"Principles of Constraint Programming","author":"Apt K. R.","unstructured":"Apt , K. R. 2003. Principles of Constraint Programming . Cambridge University Press . Apt, K. R. 2003. Principles of Constraint Programming. Cambridge University Press."},{"key":"e_1_2_1_6_1","volume-title":"Modern Uses of Multiple-Valued Logic","author":"Belnap N. D.","unstructured":"Belnap , N. D. 1977. A useful four-valued logic . In Modern Uses of Multiple-Valued Logic , J. M. Dunn and G. Epstein Eds., Reidel , Dordrecht , 8--37. Belnap, N. D. 1977. A useful four-valued logic. In Modern Uses of Multiple-Valued Logic, J. M. Dunn and G. Epstein Eds., Reidel, Dordrecht, 8--37."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(91)80001-T"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2010192.2010246"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 23rd Benelux Conference on Artificial + Intelligence. 453--454","author":"Calus N.","unstructured":"Calus , N. and Vennekens , J . 2011. A Java API for a knowledge base system . In Proceedings of the 23rd Benelux Conference on Artificial + Intelligence. 453--454 . Calus, N. and Vennekens, J. 2011. A Java API for a knowledge base system. In Proceedings of the 23rd Benelux Conference on Artificial + Intelligence. 453--454."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11916277_28"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the National Conference on Artificial Intelligence. R. C. Holte and A. Howe Eds., AAAI Press, 397--402","author":"Cort\u00e9s Calabuig","unstructured":"Cort\u00e9s Calabuig , \u00c1., Denecker , M. , Arieli , O. , and Bruynooghe , M . 2007. Approximate query answering in locally closed databases . In Proceedings of the National Conference on Artificial Intelligence. R. C. Holte and A. Howe Eds., AAAI Press, 397--402 . Cort\u00e9s Calabuig, \u00c1., Denecker, M., Arieli, O., and Bruynooghe, M. 2007. Approximate query answering in locally closed databases. In Proceedings of the National Conference on Artificial Intelligence. R. C. Holte and A. Howe Eds., AAAI Press, 397--402."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201908)","author":"Cort\u00e9s Calabuig","unstructured":"Cort\u00e9s Calabuig , \u00c1., Denecker , M. , Arieli , O. , and Bruynooghe , M . 2008. Accuracy and efficiency of fixpoint methods for approximate query answering in locally complete databases . In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201908) . 81--91. Cort\u00e9s Calabuig, \u00c1., Denecker, M., Arieli, O., and Bruynooghe, M. 2008. Accuracy and efficiency of fixpoint methods for approximate query answering in locally complete databases. In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201908). 81--91."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646331.687473"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 1st International Conference on Computational Logic. J. W. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K","author":"Denecker M.","unstructured":"Denecker , M. 2000. Extending classical logic with inductive definitions . In Proceedings of the 1st International Conference on Computational Logic. J. W. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K . Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, and P. J. Stuckey Eds., Lecture Notes in Computer Science, vol. 1861 , Springer , 703--717. Denecker, M. 2000. Extending classical logic with inductive definitions. In Proceedings of the 1st International Conference on Computational Logic. J. W. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, and P. J. Stuckey Eds., Lecture Notes in Computer Science, vol. 1861, Springer, 703--717."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.02.002"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1342991.1342998"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1758481.1758492"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_12"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383789"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806914"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"East D.\n     and \n      Truszczynski M\n  . \n  2001\n  . Propositional satisfiability in answer-set programming. In Proceedings of the Joint German\/Austrian Conference on AI. F. Baader G. Brewka and T. Eiter Eds. Lecture Notes in Computer Science vol. \n  2174 Springer 138--153.   East D. and Truszczynski M. 2001. Propositional satisfiability in answer-set programming. In Proceedings of the Joint German\/Austrian Conference on AI . F. Baader G. Brewka and T. Eiter Eds. Lecture Notes in Computer Science vol. 2174 Springer 138--153.","DOI":"10.1007\/3-540-45422-5_11"},{"key":"e_1_2_1_22_1","unstructured":"Ebbinghaus H.-D. Flum J. and Thomas W. 1984. Mathematical Logic. Undergraduate texts in mathematics. Springer.  Ebbinghaus H.-D. Flum J. and Thomas W. 1984. Mathematical Logic . Undergraduate texts in mathematics. Springer."},{"key":"e_1_2_1_23_1","volume-title":"A Mathematical Introduction To Logic","author":"Enderton H. B.","unstructured":"Enderton , H. B. 2001. A Mathematical Introduction To Logic 2 nd Ed. Academic Press . Enderton, H. B. 2001. A Mathematical Introduction To Logic 2nd Ed. Academic Press.","edition":"2"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003323"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.002"},{"key":"e_1_2_1_26_1","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"7","author":"Fagin R.","year":"1974","unstructured":"Fagin , R. 1974 . Generalized first-order spectra and polynomial-time recognizable sets . Complexity Comput. 7 , 43 -- 74 . Fagin, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. Complexity Comput. 7, 43--74.","journal-title":"Complexity Comput."},{"key":"e_1_2_1_27_1","first-page":"764","article-title":"The design of the YAP compiler: An optimizing compiler for logic programming languages","volume":"12","author":"Faustino da Silva A.","year":"2006","unstructured":"Faustino da Silva , A. and Santos Costa , V. 2006 . The design of the YAP compiler: An optimizing compiler for logic programming languages . J. Univ. Comput. Sci. 12 , 7, 764 -- 787 . Faustino da Silva, A. and Santos Costa, V. 2006. The design of the YAP compiler: An optimizing compiler for logic programming languages. J. Univ. Comput. Sci. 12, 7, 764--787.","journal-title":"J. Univ. Comput. Sci."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/2274093"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(82)90020-0"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9047-y"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1758481.1758507"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Gelfond M. and Lifschitz V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9 3\/4 365--386.  Gelfond M. and Lifschitz V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9 3\/4 365--386.","DOI":"10.1007\/BF03037169"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/3.6.827"},{"key":"e_1_2_1_35_1","unstructured":"Gr\u00e4del E. Kolaitis P. G. Libkin L. Marx M. Spencer J. Vardi M. Y. Venema Y. and Weistein S. 2007. Finite Model Theory and Its Applications. Texts in Theoretical Computer Science Springer.  Gr\u00e4del E. Kolaitis P. G. Libkin L. Marx M. Spencer J. Vardi M. Y. Venema Y. and Weistein S. 2007. Finite Model Theory and Its Applications . Texts in Theoretical Computer Science Springer."},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Grahne G.\n     and \n      Mendelzon A. O\n  . \n  1999\n  . Tableau techniques for querying information sources through global schemas. In Proceedings of the International Conference on Database Theory. C. Beeri and P. Buneman Eds. Lecture Notes in Computer Science vol. \n  1540 Springer 332--347.   Grahne G. and Mendelzon A. O. 1999. Tableau techniques for querying information sources through global schemas. In Proceedings of the International Conference on Database Theory . C. Beeri and P. Buneman Eds. Lecture Notes in Computer Science vol. 1540 Springer 332--347.","DOI":"10.1007\/3-540-49257-7_21"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000293"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/505145.505149"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the European Conference on Artificial Intelligence. R. L. deM\u00e1ntaras and L. Saitta Eds., IOS Press, 358--362","author":"Janhunen T.","year":"2004","unstructured":"Janhunen , T. 2004 . Representing normal programs with clauses . In Proceedings of the European Conference on Artificial Intelligence. R. L. deM\u00e1ntaras and L. Saitta Eds., IOS Press, 358--362 . Janhunen, T. 2004. Representing normal programs with clauses. In Proceedings of the European Conference on Artificial Intelligence. R. L. deM\u00e1ntaras and L. Saitta Eds., IOS Press, 358--362."},{"key":"e_1_2_1_40_1","volume-title":"Introduction to Metamathematics","author":"Kleene S. C.","unstructured":"Kleene , S. C. 1952. Introduction to Metamathematics . Van Nostrand . Kleene, S. C. 1952. Introduction to Metamathematics. Van Nostrand."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1216064.1216070"},{"key":"e_1_2_1_43_1","volume-title":"Elements of Finite Model Theory","author":"Libkin L.","unstructured":"Libkin , L. 2004. Elements of Finite Model Theory . Springer . Libkin, L. 2004. Elements of Finite Model Theory. Springer."},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Marek V. W. and Truszczy\u0144ski M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective. K. R. Apt V. W. Marek M. Truszczy\u0144ski and D. S. Warren Eds. Springer 375--398.  Marek V. W. and Truszczy\u0144ski M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective . K. R. Apt V. W. Marek M. Truszczy\u0144ski and D. S. Warren Eds. Springer 375--398.","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/11591191_39"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9041-4"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the 8th National Conference on Artificial Intelligence. 1109--1116","author":"McAllester D. A.","year":"1990","unstructured":"McAllester , D. A. 1990 . Truth maintenance . In Proceedings of the 8th National Conference on Artificial Intelligence. 1109--1116 . McAllester, D. A. 1990. Truth maintenance. In Proceedings of the 8th National Conference on Artificial Intelligence. 1109--1116."},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the 8th National Conference on Artificial Intelligence. 685--692","author":"Miranker D. P.","unstructured":"Miranker , D. P. , Brant , D. A. , Lofaso , B. J. , and Gadbois , D . 1990. On the performance of lazy matchingin production systems . In Proceedings of the 8th National Conference on Artificial Intelligence. 685--692 . Miranker, D. P., Brant, D. A., Lofaso, B. J., and Gadbois, D. 1990. On the performance of lazy matchingin production systems. In Proceedings of the 8th National Conference on Artificial Intelligence. 685--692."},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the National Conference on Artificial Intelligence. M. M. Veloso and S. Kambhampati Eds., AAAI Press\/The MIT Press, 430--435","author":"Mitchell D. G.","unstructured":"Mitchell , D. G. and Ternovska , E . 2005. A framework for representing and solving NP search problems . In Proceedings of the National Conference on Artificial Intelligence. M. M. Veloso and S. Kambhampati Eds., AAAI Press\/The MIT Press, 430--435 . Mitchell, D. G. and Ternovska, E. 2005. A framework for representing and solving NP search problems. In Proceedings of the National Conference on Artificial Intelligence. M. M. Veloso and S. Kambhampati Eds., AAAI Press\/The MIT Press, 430--435."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9050-3"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. M. M. Veloso Ed.","author":"Morales A. R.","unstructured":"Morales , A. R. , Tu , P. H. , and Son , T. C . 2007. An extension to conformant planning using logic programming . In Proceedings of the International Joint Conference on Artificial Intelligence. M. M. Veloso Ed. , 1991--1996. Morales, A. R., Tu, P. H., and Son, T. C. 2007. An extension to conformant planning using logic programming. In Proceedings of the International Joint Conference on Artificial Intelligence. M. M. Veloso Ed., 1991--1996."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the 8th International Workshop on Non-Monotonic Reasoning. CoRR, cs.AI\/0003033","author":"Niemel\u00e4 I.","unstructured":"Niemel\u00e4 , I. , Simons , P. , and Syrj\u00e4nen , T . 2000. Smodels: A system for answer set programming . In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning. CoRR, cs.AI\/0003033 . Niemel\u00e4, I., Simons, P., and Syrj\u00e4nen, T. 2000. Smodels: A system for answer set programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning. CoRR, cs.AI\/0003033."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/11562931_18"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068406002973"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-008-9090-9"},{"key":"e_1_2_1_59_1","volume-title":"Robinson Eds.","volume":"5","author":"Pettorossi A.","unstructured":"Pettorossi , A. and Proietti , M . 1998. Transformation of logic programs. In Handbook of Logic in Artificial Intelligence and Logic Programming. D. M. Gabbay, C. J. Hogger, and J. A . Robinson Eds. , vol. 5 , Oxford University Press, 697--787. Pettorossi, A. and Proietti, M. 1998. Transformation of logic programs. In Handbook of Logic in Artificial Intelligence and Logic Programming. D. M. Gabbay, C. J. Hogger, and J. A. Robinson Eds., vol. 5, Oxford University Press, 697--787."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"e_1_2_1_61_1","volume-title":"Introduction to the Theory of Computation","author":"Sipser M.","unstructured":"Sipser , M. 2005. Introduction to the Theory of Computation 2 nd Ed. Course Technology . Sipser, M. 2005. Introduction to the Theory of Computation 2nd Ed. Course Technology.","edition":"2"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/22289.22333"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02846-5_45"},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. C. Boutilier Ed., 942--947","author":"Ternovska E.","unstructured":"Ternovska , E. and Mitchell , D. G . 2009. Declarative programming of search problems with built-in arithmetic . In Proceedings of the International Joint Conference on Artificial Intelligence. C. Boutilier Ed., 942--947 . Ternovska, E. and Mitchell, D. G. 2009. Declarative programming of search problems with built-in arithmetic. In Proceedings of the International Joint Conference on Artificial Intelligence. C. Boutilier Ed., 942--947."},{"key":"e_1_2_1_65_1","volume-title":"Kodkod: A relational model finder. In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems","author":"Torlak E.","year":"2007","unstructured":"Torlak , E. and Jackson , D . 2007 . Kodkod: A relational model finder. In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems . O. Grumberg and M. Huth Eds., Lecture Notes in Computer Science, vol. 4424 , Springer , 632--647. Torlak, E. and Jackson, D. 2007. Kodkod: A relational model finder. In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems. O. Grumberg and M. Huth Eds., Lecture Notes in Computer Science, vol. 4424, Springer, 632--647."},{"key":"e_1_2_1_66_1","volume-title":"Studies in Constructive Mathematics and Mathematical Logic II","author":"Tseitin G. S.","unstructured":"Tseitin , G. S. 1968. On the complexity of derivation in propositional calculus . In Studies in Constructive Mathematics and Mathematical Logic II , A. O. Slisenko Ed., Consultants Bureau , N.Y. , 115--125. Tseitin, G. S. 1968. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic II, A. O. Slisenko Ed., Consultants Bureau, N.Y., 115--125."},{"key":"e_1_2_1_67_1","volume-title":"Principles of Database and Knowledge-Base Systems","author":"Ullman J. D.","unstructured":"Ullman , J. D. 1988. Principles of Database and Knowledge-Base Systems . Vol. I . Computer Science Press, Inc. , New York . Ullman, J. D. 1988. Principles of Database and Knowledge-Base Systems. Vol. I. Computer Science Press, Inc., New York."},{"key":"e_1_2_1_68_1","unstructured":"Vaezipoor P. Mitchell D. and Mari\u00ebn M. 2011. Lifted unit propagation for effective grounding. CoRR abs\/1109.1317.  Vaezipoor P. Mitchell D. and Mari\u00ebn M. 2011. Lifted unit propagation for effective grounding. CoRR abs\/1109.1317."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"e_1_2_1_70_1","volume-title":"The OPL Optimization Programming Language","author":"Van Hentenryck P.","unstructured":"Van Hentenryck , P. 1999. The OPL Optimization Programming Language . MIT Press . Van Hentenryck, P. 1999. The OPL Optimization Programming Language. MIT Press."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.208"},{"key":"e_1_2_1_72_1","first-page":"1","article-title":"Predicate introduction for logics with a fixpoint semantics. Part I: Logic programming","volume":"79","author":"Vennekens J.","year":"2007","unstructured":"Vennekens , J. , Mari\u00ebn , M. , Wittocx , J. , and Denecker , M. 2007 . Predicate introduction for logics with a fixpoint semantics. Part I: Logic programming . Fundamenta Informaticae 79 , 1 -- 2 , 187--208. Vennekens, J., Mari\u00ebn, M., Wittocx, J., and Denecker, M. 2007. Predicate introduction for logics with a fixpoint semantics. Part I: Logic programming. Fundamenta Informaticae 79, 1--2, 187--208.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/1599410.1599428"},{"key":"e_1_2_1_74_1","volume-title":"Proceedings of the European Conference on Logics in Artificial Intelligence. M. Fisher, W. van der Hoek, B. Konev, and A. Lisitsa Eds., Springer, 326--338","author":"Vlaeminck H.","unstructured":"Vlaeminck , H. , Wittocx , J. , Vennekens , J. , Denecker , M. , and Bruynooghe , M . 2010. An approximate method for solving 98SO problems . In Proceedings of the European Conference on Logics in Artificial Intelligence. M. Fisher, W. van der Hoek, B. Konev, and A. Lisitsa Eds., Springer, 326--338 . Vlaeminck, H., Wittocx, J., Vennekens, J., Denecker, M., and Bruynooghe, M. 2010. An approximate method for solving 98SO problems. In Proceedings of the European Conference on Logics in Artificial Intelligence. M. Fisher, W. van der Hoek, B. Konev, and A. Lisitsa Eds., Springer, 326--338."},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.5555\/2444851.2444854"},{"key":"e_1_2_1_77_1","volume-title":"Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201908)","author":"Wittocx J.","unstructured":"Wittocx , J. , Mari\u00ebn , M. , and Denecker , M . 2008a. Approximate reasoning in first-order logic theories . In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201908) . 103--112. Wittocx, J., Mari\u00ebn, M., and Denecker, M. 2008a. Approximate reasoning in first-order logic theories. In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201908). 103--112."},{"key":"e_1_2_1_78_1","volume-title":"Proceedings of the National Conference on Artificial Intelligence. D. Fox and C. P. Gomes Eds., AAAI Press, 572--577","author":"Wittocx J.","unstructured":"Wittocx , J. , Mari\u00ebn , M. , and Denecker , M . 2008b. Grounding with bounds . In Proceedings of the National Conference on Artificial Intelligence. D. Fox and C. P. Gomes Eds., AAAI Press, 572--577 . Wittocx, J., Mari\u00ebn, M., and Denecker, M. 2008b. Grounding with bounds. In Proceedings of the National Conference on Artificial Intelligence. D. Fox and C. P. Gomes Eds., AAAI Press, 572--577."},{"key":"e_1_2_1_79_1","volume-title":"Proceedings of the 2nd Workshop on Logic and Search. M. Denecker Ed., 153--165","author":"Wittocx J.","unstructured":"Wittocx , J. , Mari\u00ebn , M. , and Denecker , M . 2008c. The IDP system: A model expansion system for an extension of classical logic . In Proceedings of the 2nd Workshop on Logic and Search. M. Denecker Ed., 153--165 . Wittocx, J., Mari\u00ebn, M., and Denecker, M. 2008c. The IDP system: A model expansion system for an extension of classical logic. In Proceedings of the 2nd Workshop on Logic and Search. M. Denecker Ed., 153--165."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02846-5_26"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.5555\/1892211.1892217"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2499937.2499938","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2499937.2499938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:00Z","timestamp":1750232040000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2499937.2499938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":78,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["10.1145\/2499937.2499938"],"URL":"https:\/\/doi.org\/10.1145\/2499937.2499938","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"value":"1529-3785","type":"print"},{"value":"1557-945X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]},"assertion":[{"value":"2010-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}