Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs

DOI10.1007/978-3-642-30743-0_13zbMATH Open1357.68031OpenAlexW2100577610MaRDI QIDQ2900518FDOQ2900518

Authors: Marc Denecker, Maurice Bruynooghe, Joost Vennekens 

Publication date: 23 July 2012

Published in: Correct Reasoning (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/350619

Recommendations

• Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
• Approximation logic of programs
• Fixpoint semantics for logic programming a survey
• Answer set programming in intuitionistic logic
• scientific article; zbMATH DE number 19156
• scientific article; zbMATH DE number 2242586
• A characterization of answer sets for logic programs
• Fixed-parameter complexity of semantics for logic programs
• scientific article; zbMATH DE number 2085278

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cites Work

• Modularity aspects of disjunctive stable models
• The well-founded semantics for general logic programs
• Strongly equivalent logic programs
• Title not available (Why is that?)
• The alternating fixpoint of logic programs with negation
• Equilibrium logic
• Toward useful type-free theories. I
• Well-founded and stable semantics of logic programs with aggregates
• A kripke-kleene semantics for logic programs*
• Fixpoint semantics for logic programming a survey
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Discovering classes of strongly equivalent logic programs
• Uniform semantic treatment of default and autoepistemic logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Predicate introduction for logics with a fixpoint semantics. I: Logic programming

Cited In (17)

• Title not available (Why is that?)
• Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• The intricacies of three-valued extensional semantics for higher-order logic programs
• On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
• Title not available (Why is that?)
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
• Fixpoint semantics for active integrity constraints
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
• Equivalence between answer-set programs under (partially) fixed input
• Fixed point semantics for stream reasoning
• Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
• An analysis of the equational properties of the well-founded fixed point
• On Dual Programs in Co-Logic Programming
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
• Categorical approximation fixpoint theory

This page was built for publication: Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs

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