Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
From MaRDI portal
Publication:4593015
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.
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
Cites work
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 1301742 (Why is no real title available?)
- scientific article; zbMATH DE number 1890628 (Why is no real title available?)
- A Tarskian informal semantics for answer set programming
- A logic of nonmonotone inductive definitions
- A theory of type polymorphism in programming
- Algorithmic learning theory. 23rd international conference, ALT 2012, Lyon, France, October 29--31, 2012. Proceedings
- Automated reasoning. Third international joint conference, IJCAR 2006, Seattle, WA, USA, August 17--20, 2006. Proceedings
- Compiling \(\mathrm{input}^\ast\) FO\((\cdot)\) inductive definitions into tabled prolog rules for IDP3
- Complexity of automaton identification from given data
- Constraint propagation for first-order logic and inductive definitions
- Detection and exploitation of functional dependencies for model generation
- Essence: A constraint language for specifying combinatorial problems
- Exact DFA Identification Using SAT Solvers
- Grounding FO and FO(ID) with bounds
- Itemset mining: a constraint programming perspective
- Lazy model expansion by incremental grounding
- Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- Modeling machine learning and data mining problems with \(\mathrm{FO}(\cdot )\)
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- 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.
- The DLV system for knowledge representation and reasoning
- The design of the zinc modelling language
- The well-founded semantics for general logic programs
- Theory and Applications of Satisfiability Testing
- Well-founded and stable semantics of logic programs with aggregates
- XSB: extending Prolog with tabled logic programming
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
- IDP3
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- 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
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)
