Inductive equivalence in clausal logic and nonmonotonic logic programming
From MaRDI portal
Publication:413854
DOI10.1007/s10994-010-5189-4zbMath1237.68208OpenAlexW1997314029MaRDI QIDQ413854
Publication date: 8 May 2012
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-010-5189-4
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clausal discovery
- Equivalence issues in abduction and induction
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Circumscription - a form of non-monotonic reasoning
- Foundations of inductive logic programming
- Logical settings for concept-learning
- Brave induction: a logical framework for learning from incomplete information
- Abductive Equivalence in First-order Logic
- The Semantics of Predicate Logic as a Programming Language
- Logic programming and knowledge representation
- Transformation of logic programs: Foundations and techniques
- Strong equivalence made easy: nested expressions and weight constraints
- Logic Programming
- Logics in Artificial Intelligence
- Inductive Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs
- Induction as consequence finding
This page was built for publication: Inductive equivalence in clausal logic and nonmonotonic logic programming