@article{labarre-idp3,
  author        = {Blockeel, Hendrik and Bogaerts, Bart and Bruynooghe,
                  Maurice and De Cat, Broes and De Pooter, Stef and Denecker, Marc and Jansen, Joachim and Labarre,
                  Anthony and Ramon, Jan and Verwer, Sicco},
  title     = {Predicate Logic as a Modeling Language: Modeling and Solving some
               Machine Learning and Data Mining Problems with {IDP3}},
  journal   = {Theory and Practice of Logic Programming},
  volume    = {15},
  number = {6},
  month = nov,
  year      = {2015},
  pages = {783--817},
  doi = {10.1017/S147106841400009X},
  pdf = {publications/tplp2014.pdf},
  url_Paper = "publications/tplp2014.pdf",
  url_arXiv       = {http://arxiv.org/abs/1309.6883},
  timestamp = {Tue, 26 Aug 2014 10:41:12 +0200},
abstract = {
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 a 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.},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/BruynoogheBBCPJLRDV13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}



% 2013 ========================================================================

{"_id":"3k2FXmsjSCsCjGaaL","bibbaseid":"blockeel-bogaerts-bruynooghe-decat-depooter-denecker-jansen-labarre-etal-predicatelogicasamodelinglanguagemodelingandsolvingsomemachinelearninganddataminingproblemswithidp3-2015","downloads":0,"creationDate":"2016-03-04T08:38:10.564Z","title":"Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3","author_short":["Blockeel, H.","Bogaerts, B.","Bruynooghe, M.","De Cat, B.","De Pooter, S.","Denecker, M.","Jansen, J.","Labarre, A.","Ramon, J.","Verwer, S."],"year":2015,"bibtype":"article","biburl":"http://igm.univ-mlv.fr/~alabarre/papers.bib","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Blockeel"],"firstnames":["Hendrik"],"suffixes":[]},{"propositions":[],"lastnames":["Bogaerts"],"firstnames":["Bart"],"suffixes":[]},{"propositions":[],"lastnames":["Bruynooghe"],"firstnames":["Maurice"],"suffixes":[]},{"propositions":[],"lastnames":["De","Cat"],"firstnames":["Broes"],"suffixes":[]},{"propositions":[],"lastnames":["De","Pooter"],"firstnames":["Stef"],"suffixes":[]},{"propositions":[],"lastnames":["Denecker"],"firstnames":["Marc"],"suffixes":[]},{"propositions":[],"lastnames":["Jansen"],"firstnames":["Joachim"],"suffixes":[]},{"propositions":[],"lastnames":["Labarre"],"firstnames":["Anthony"],"suffixes":[]},{"propositions":[],"lastnames":["Ramon"],"firstnames":["Jan"],"suffixes":[]},{"propositions":[],"lastnames":["Verwer"],"firstnames":["Sicco"],"suffixes":[]}],"title":"Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3","journal":"Theory and Practice of Logic Programming","volume":"15","number":"6","month":"November","year":"2015","pages":"783--817","doi":"10.1017/S147106841400009X","pdf":"publications/tplp2014.pdf","url_paper":"publications/tplp2014.pdf","url_arxiv":"http://arxiv.org/abs/1309.6883","timestamp":"Tue, 26 Aug 2014 10:41:12 +0200","abstract":"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 a 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.","biburl":"http://dblp.uni-trier.de/rec/bib/journals/corr/BruynoogheBBCPJLRDV13","bibsource":"dblp computer science bibliography, http://dblp.org","bibtex":"@article{labarre-idp3,\n author = {Blockeel, Hendrik and Bogaerts, Bart and Bruynooghe,\n Maurice and De Cat, Broes and De Pooter, Stef and Denecker, Marc and Jansen, Joachim and Labarre,\n Anthony and Ramon, Jan and Verwer, Sicco},\n title = {Predicate Logic as a Modeling Language: Modeling and Solving some\n Machine Learning and Data Mining Problems with {IDP3}},\n journal = {Theory and Practice of Logic Programming},\n volume = {15},\n number = {6},\n month = nov,\n year = {2015},\n pages = {783--817},\n doi = {10.1017/S147106841400009X},\n pdf = {publications/tplp2014.pdf},\n url_Paper = \"publications/tplp2014.pdf\",\n url_arXiv = {http://arxiv.org/abs/1309.6883},\n timestamp = {Tue, 26 Aug 2014 10:41:12 +0200},\nabstract = {\nThis paper provides a gentle introduction to problem solving with the IDP3 system.\nThe core of IDP3 is a finite model generator that supports first order logic enriched\nwith types, inductive definitions, aggregates and partial functions. It offers its users a\nmodeling language that is a slight extension of predicate logic and allows them to solve\na wide range of search problems. Apart from a small introductory example, applications\nare selected from problems that arose within machine learning and data mining research.\nThese research areas have recently shown a strong interest in declarative modeling and\nconstraint solving as opposed to algorithmic approaches. The paper illustrates that the\nIDP3 system can be a valuable tool for researchers with such an interest.\nThe first problem is in the domain of stemmatology, a domain of philology concerned\nwith the relationship between surviving variant versions of text. The second problem is\nabout a somewhat related problem within biology where phylogenetic trees are used to\nrepresent the evolution of species. The third and final problem concerns the classical\nproblem of learning a minimal automaton consistent with a given set of strings. For this\nlast problem, we show that the performance of our solution comes very close to that\nof a state-of-the art solution. For each of these applications, we analyze the problem,\nillustrate the development of a logic-based model and explore how alternatives can affect\nthe performance.},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/BruynoogheBBCPJLRDV13},\n bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n\n\n% 2013 ========================================================================\n\n","author_short":["Blockeel, H.","Bogaerts, B.","Bruynooghe, M.","De Cat, B.","De Pooter, S.","Denecker, M.","Jansen, J.","Labarre, A.","Ramon, J.","Verwer, S."],"key":"labarre-idp3","id":"labarre-idp3","bibbaseid":"blockeel-bogaerts-bruynooghe-decat-depooter-denecker-jansen-labarre-etal-predicatelogicasamodelinglanguagemodelingandsolvingsomemachinelearninganddataminingproblemswithidp3-2015","role":"author","urls":{" paper":"http://igm.univ-mlv.fr/~alabarre/publications/tplp2014.pdf"," arxiv":"http://arxiv.org/abs/1309.6883"},"downloads":0},"search_terms":["predicate","logic","modeling","language","modeling","solving","machine","learning","data","mining","problems","idp3","blockeel","bogaerts","bruynooghe","de cat","de pooter","denecker","jansen","labarre","ramon","verwer"],"keywords":[],"authorIDs":[],"dataSources":["wzwrNqtJ6mLzr48X2"]}