Predicate introduction for logics with a fixpoint semantics. I: Logic programming

zbMATH Open1123.03015MaRDI QIDQ5422271FDOQ5422271

Authors: Joost Vennekens, Johan Wittocx, Maarten Mariën, Marc Denecker 

Publication date: 17 October 2007

Recommendations

• Predicate introduction for logics with a fixpoint semantics. II: Autoepistemic logic
• Predicate Introduction Under Stable and Well-Founded Semantics
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
• Logic Programming

zbMATH Keywords

approximationnormal formsemanticsalgebraic approachlogic programmingfixpointnonmonotonic logicseliminating universal quantifierspredicate introduction

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic programming (68N17) Logic in artificial intelligence (68T27)

Cited In (6)

• Embedding justification theory in approximation fixpoint theory
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• Fixpoint semantics for active integrity constraints
• On well-founded set-inductions and locally monotone operators
• Predicate Introduction Under Stable and Well-Founded Semantics
• Predicate introduction for logics with a fixpoint semantics. II: Autoepistemic logic

This page was built for publication: Predicate introduction for logics with a fixpoint semantics. I: Logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422271)