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

MaRDI QIDQ5422271zbMATH OpenFDO

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

Publication date 17 October 2007

zbMATH Keywords

algebraic approachapproximationeliminating universal quantifiersfixpointlogic programmingnonmonotonic logicsnormal formpredicate introductionsemantics

Mathematics Subject Classification ID

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

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

Cited in

(6)

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

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)