Inductive equivalence in clausal logic and nonmonotonic logic programming
From MaRDI portal
(Redirected from Publication:413854)
Recommendations
Cites work
- Abductive Equivalence in First-order Logic
- Brave induction: a logical framework for learning from incomplete information
- Circumscription - a form of non-monotonic reasoning
- Clausal discovery
- Equivalence issues in abduction and induction
- Foundations of inductive logic programming
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 54155 (Why is no real title available?)
- scientific article; zbMATH DE number 1746688 (Why is no real title available?)
- scientific article; zbMATH DE number 1746694 (Why is no real title available?)
- scientific article; zbMATH DE number 1926614 (Why is no real title available?)
- scientific article; zbMATH DE number 1877044 (Why is no real title available?)
- scientific article; zbMATH DE number 2090116 (Why is no real title available?)
- scientific article; zbMATH DE number 3412190 (Why is no real title available?)
- Induction as consequence finding
- Inductive Logic Programming
- Logic Programming
- Logic programming and knowledge representation
- Logic Programming and Nonmonotonic Reasoning
- Logical settings for concept-learning
- Logics in Artificial Intelligence
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- The Semantics of Predicate Logic as a Programming Language
- Transformation of logic programs: Foundations and techniques
Cited in
(4)
This page was built for publication: Inductive equivalence in clausal logic and nonmonotonic logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413854)