Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
DOI10.1017/S147106841400009XzbMATH Open1379.68279arXiv1309.6883OpenAlexW2036981717MaRDI QIDQ4593015FDOQ4593015
Authors: Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes de Cat, Stef de Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, Sicco Verwer
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.6883
Recommendations
- Modeling machine learning and data mining problems with \(\mathrm{FO}(\cdot )\)
- Taming the complexity of inductive logic programming
- Compiling \(\mathrm{input}^\ast\) FO\((\cdot)\) inductive definitions into tabled prolog rules for IDP3
- Predicate-calculus-based logics for modeling and solving search problems
- Logic-based machine learning
phylogenetic treestemmatologyknowledge representationlogic programmingdeterministic finite-state automatondeclarative modelingknowledge-base systemsIDP system
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)
Cites Work
- Theory and Applications of Satisfiability Testing
- A theory of type polymorphism in programming
- Title not available (Why is that?)
- XSB: extending Prolog with tabled logic programming
- Essence: A constraint language for specifying combinatorial problems
- The well-founded semantics for general logic programs
- The DLV system for knowledge representation and reasoning
- Title not available (Why is that?)
- Itemset mining: a constraint programming perspective
- Well-founded and stable semantics of logic programs with aggregates
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- A Tarskian informal semantics for answer set programming
- Automated reasoning. Third international joint conference, IJCAR 2006, Seattle, WA, USA, August 17--20, 2006. Proceedings
- The design of the zinc modelling language
- Complexity of automaton identification from given data
- Exact DFA Identification Using SAT Solvers
- Algorithmic learning theory. 23rd international conference, ALT 2012, Lyon, France, October 29--31, 2012. Proceedings
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- Title not available (Why is that?)
- Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings
- A logic of nonmonotone inductive definitions
- Constraint propagation for first-order logic and inductive definitions
- Detection and exploitation of functional dependencies for model generation
- Grounding FO and FO(ID) with bounds
- Modeling machine learning and data mining problems with \(\mathrm{FO}(\cdot )\)
- Compiling \(\mathrm{input}^\ast\) FO\((\cdot)\) inductive definitions into tabled prolog rules for IDP3
- Technical communications of the 28th international conference on logic programming (ICLP 2012), September 4--8, 2012, Budapest, Hungary. Papers based on the presentations at the conference.
- Lazy model expansion by incremental grounding
Cited In (12)
- Knowledge representation analysis of graph mining
- Stable-unstable semantics: Beyond NP with normal logic programs
- Learning decision trees with flexible constraints and objectives using integer optimization
- The Seventh Answer Set Programming Competition: Design and Results
- Modeling machine learning and data mining problems with \(\mathrm{FO}(\cdot )\)
- Compiling \(\mathrm{input}^\ast\) FO\((\cdot)\) inductive definitions into tabled prolog rules for IDP3
- Title not available (Why is that?)
- IDP3
- Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
- Unsatisfiable core analysis and aggregates for optimum stable model search
- The KB paradigm and its application to interactive configuration
- Shared aggregate sets in answer set programming
Uses Software
This page was built for publication: Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593015)