{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:11:56Z","timestamp":1773655916769,"version":"3.50.1"},"reference-count":56,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2014,5,14]],"date-time":"2014-05-14T00:00:00Z","timestamp":1400025600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2015,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper provides a gentle introduction to problem-solving with the IDP3 system. The core of IDP3 is a finite model generator that supports first-order logic enriched with types, inductive definitions, aggregates and partial functions. It offers its users a modeling language that is a slight extension of predicate logic and allows them to solve a wide range of search problems. Apart from a small introductory example, applications are selected from problems that arose within machine learning and data mining research. These research areas have recently shown a strong interest in declarative modeling and constraint-solving as opposed to algorithmic approaches. The paper illustrates that the IDP3 system can be a valuable tool for researchers with such an interest. The first problem is in the domain of stemmatology, a domain of philology concerned with the relationship between surviving variant versions of text. The second problem is about a somewhat related problem within biology where phylogenetic trees are used to represent the evolution of species. The third and final problem concerns the classical problem of learning a minimal automaton consistent with a given set of strings. For this last problem, we show that the performance of our solution comes very close to that of the state-of-the art solution. For each of these applications, we analyze the problem, illustrate the development of a logic-based model and explore how alternatives can affect the performance.<\/jats:p>","DOI":"10.1017\/s147106841400009x","type":"journal-article","created":{"date-parts":[[2014,5,14]],"date-time":"2014-05-14T09:32:19Z","timestamp":1400059939000},"page":"783-817","source":"Crossref","is-referenced-by-count":23,"title":["Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3<\/i>"],"prefix":"10.1017","volume":"15","author":[{"given":"MAURICE","family":"BRUYNOOGHE","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HENDRIK","family":"BLOCKEEL","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BART","family":"BOGAERTS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BROES","family":"DE CAT","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"STEF","family":"DE POOTER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JOACHIM","family":"JANSEN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANTHONY","family":"LABARRE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JAN","family":"RAMON","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARC","family":"DENECKER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SICCO","family":"VERWER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,5,14]]},"reference":[{"key":"S147106841400009X_ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5009015"},{"key":"S147106841400009X_ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S147106841400009X_ref38","first-page":"569","volume-title":"IFIP Congress","author":"Kowalski","year":"1974"},{"key":"S147106841400009X_ref39","unstructured":"Labarre A. and Verwer S. To appear. Merging partially labelled trees: Hardness and an efficient practical solution. IEEE\/ACM Transactions on Computational Biology and Bioinformatics."},{"key":"S147106841400009X_ref52","volume-title":"The Genesis of Lachmann's Method","author":"Timpanaro","year":"2005"},{"key":"S147106841400009X_ref36","first-page":"635","article-title":"Lua \u2013 an extensible extension language","volume":"26","author":"Ierusalimschy","year":"1996","journal-title":"Software: Practice and Experience"},{"key":"S147106841400009X_ref9","volume-title":"ICML Workshop on Grammatical Inference, Automata Induction, and Language Acquisition","author":"Coste","year":"1997"},{"key":"S147106841400009X_ref22","volume-title":"Technical Communications of the 28th International Conference on Logic Programming (ICLP 2012)","author":"Dovier","year":"2012"},{"key":"S147106841400009X_ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90562-4"},{"key":"S147106841400009X_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04238-6_75"},{"key":"S147106841400009X_ref25","volume-title":"Inferring Phylogenies","author":"Felsenstein","year":"2004"},{"key":"S147106841400009X_ref27","unstructured":"Gambette P. 2010. Who is who in phylogenetic networks: Articles, authors and programs. Published electronically. Accessed 2011. URL: http:\/\/www.atgc-montpellier.fr\/phylnet."},{"key":"S147106841400009X_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9047-y"},{"key":"S147106841400009X_ref23","first-page":"502","volume-title":"International Conference, SAT","author":"E\u00e9n","year":"2003"},{"key":"S147106841400009X_ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.05.002"},{"key":"S147106841400009X_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_40"},{"key":"S147106841400009X_ref2","doi-asserted-by":"publisher","DOI":"10.1093\/llc\/fqt032"},{"key":"S147106841400009X_ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9041-4"},{"key":"S147106841400009X_ref44","first-page":"430","volume-title":"Twentieth AAAI National Conference on Artificial Intelligence (AAAI-05)","author":"Mitchell","year":"2005"},{"key":"S147106841400009X_ref13","first-page":"201","volume-title":"Technical Communications of the 28th International Conference on Logic Programming (ICLP 2012)","author":"De Cat","year":"2012"},{"key":"S147106841400009X_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20895-9_46"},{"key":"S147106841400009X_ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S147106841400009X_ref18","volume-title":"14th International Conference on Principles of Knowledge Representation and Reasoning","author":"Denecker"},{"key":"S147106841400009X_ref5","first-page":"14","volume-title":"Technical Communications of the 28th International Conference on Logic Programming (ICLP 2012)","author":"Blockeel","year":"2012"},{"key":"S147106841400009X_ref41","first-page":"211","volume-title":"SAT","author":"Mari\u00ebn","year":"2008"},{"key":"S147106841400009X_ref28","first-page":"260","volume-title":"LPNMR","author":"Gebser","year":"2007"},{"key":"S147106841400009X_ref1","unstructured":"Andrews T. , Blockeel H. , Bogaerts B. , Bruynooghe M. , Denecker M. , De Pooter S. , Mac\u00e9 C. and Ramon J. 2012. Analyzing manuscript traditions using constraint-based data mining. In COmbining COnstraint solving with MIning and LEarning (CoCoMile). Montpellier, France, 27 August 2012, Proceedings First Workshop on Combining Constraint Solving with Mining and Learning (CoCoMile). (ECAI 2012 Workshop), 15\u201320."},{"key":"S147106841400009X_ref35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511974076"},{"key":"S147106841400009X_ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217859"},{"key":"S147106841400009X_ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2013.159"},{"key":"S147106841400009X_ref46","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068406002973"},{"key":"S147106841400009X_ref37","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068413000434"},{"key":"S147106841400009X_ref34","article-title":"Software model synthesis using satisfiability solvers","author":"Heule","year":"2012","journal-title":"Empirical Software Engineering"},{"key":"S147106841400009X_ref16","first-page":"277","volume-title":"Technical Communications of the 28th International Conference on Logic Programming (ICLP 2012)","author":"Denecker","year":"2012"},{"key":"S147106841400009X_ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841300029X"},{"key":"S147106841400009X_ref10","unstructured":"De Cat B. , Bogaerts B. , Bruynooghe M. and Denecker M. 2014. Predicate logic as a modelling language: The IDP system. CoRR abs\/1401.6312."},{"key":"S147106841400009X_ref47","doi-asserted-by":"publisher","DOI":"10.1093\/llc\/fqp002"},{"key":"S147106841400009X_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.01.003"},{"key":"S147106841400009X_ref21","first-page":"49","volume-title":"Proceedings of the 24th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'12)","author":"Devriendt","year":"2012"},{"key":"S147106841400009X_ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1342991.1342998"},{"key":"S147106841400009X_ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"S147106841400009X_ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1452044.1452046"},{"key":"S147106841400009X_ref33","doi-asserted-by":"crossref","unstructured":"Heule M. and Verwer S. 2010. Exact DFA identification using SAT solvers. In Grammatical Inference: Theoretical Results and Applications (ICGI 2010), 66\u201379.","DOI":"10.1007\/978-3-642-15488-1_7"},{"key":"S147106841400009X_ref50","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000500"},{"key":"S147106841400009X_ref3","first-page":"255","volume-title":"The Evolution of Texts: Confronting Stemmatological and Genetical Methods, Proceedings of the International Workshop, Louvain-la-Neuve","author":"Baret","year":"2006"},{"key":"S147106841400009X_ref51","first-page":"434","volume-title":"LPNMR","author":"Syrj\u00e4nen","year":"2001"},{"key":"S147106841400009X_ref53","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"S147106841400009X_ref29","first-page":"1070","volume-title":"ICLP\/SLP","author":"Gelfond","year":"1988"},{"key":"S147106841400009X_ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2499937.2499938"},{"key":"S147106841400009X_ref20","first-page":"279","volume-title":"International Conference on Applications of Declarative Programming and Knowledge Management","author":"Wittocx","year":"2011"},{"key":"S147106841400009X_ref55","first-page":"153","volume-title":"The 2nd International Workshop on Logic and Search (LaSh 2008)","author":"Wittocx","year":"2008"},{"key":"S147106841400009X_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20832-4_26"},{"key":"S147106841400009X_ref14","doi-asserted-by":"crossref","unstructured":"De Cat B. , Denecker M. , Stuckey P. J. and Bruynooghe M. 2014. Lazy model expansion: Interleaving grounding with search. CoRR abs\/1402.6889.","DOI":"10.1613\/jair.4591"},{"key":"S147106841400009X_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34106-9_10"},{"key":"S147106841400009X_ref49","unstructured":"Stamina 2010. The StaMinA competition, learning regular languages with large alphabets. Accessed 2012. URL: http:\/\/stamina.chefbe.net\/."},{"key":"S147106841400009X_ref56","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1613\/jair.2980","article-title":"Grounding FO and FO(ID) with bounds","volume":"38","author":"Wittocx","year":"2010","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S147106841400009X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T12:43:37Z","timestamp":1565441017000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106841400009X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,14]]},"references-count":56,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["S147106841400009X"],"URL":"https:\/\/doi.org\/10.1017\/s147106841400009x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,14]]}}}