The well-founded semantics is the principle of inductive definition
From MaRDI portal
(Redirected from The well-founded semantics is the principle of inductive definition)
Recommendations
- On Principles of Inductive Definition
- scientific article; zbMATH DE number 2059537
- The well-founded semantics is a stratified Fitting semantics
- scientific article; zbMATH DE number 3323819
- A tutorial on the well-founded semantics
- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
- Definitional Quantifiers Realise Semantic Reasoning for Proof by Induction
- scientific article; zbMATH DE number 1136651
- Foundation of logic programming based on inductive definition
- Mathematical Foundations of Computer Science 2004
Cited in
(8)- Inductive situation calculus
- Safe inductions and their applications in knowledge representation
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
- Connecting first-order ASP and the logic FO(ID) through reducts
- Postulates for Revocation Schemes
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- A logic of nonmonotone inductive definitions
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
This page was built for publication: The well-founded semantics is the principle of inductive definition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246955)