The alternating fixpoint of logic programs with negation

DOI10.1016/0022-0000(93)90024-QzbMath0793.68039OpenAlexW4212881215MaRDI QIDQ686646

Allen van Gelder

Publication date: 10 October 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(93)90024-q

zbMATH Keywords

negation as failurestable modelsfixpoint logicalternating fixpoint logicalternating fixpoint partial modelHorn clause semanticsleast fixpointlogic program with negationnegative conclusionspositive conclusionsstratified semanticswell-founded partial model

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17) Lattices (06B99)

Related Items (28)

Datalog Queries Distributing over Components ⋮ Characterising and Explaining Inconsistency in Logic Programs ⋮ Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs ⋮ Recursive rules with aggregation: a simple unified semantics ⋮ A new approach to hybrid probabilistic logic programs ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ FO(ID) as an extension of DL with rules ⋮ A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ Integrating Inductive Definitions in SAT ⋮ Well-founded operators for normal hybrid MKNF knowledge bases ⋮ SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions ⋮ Logic programming as classical inference ⋮ Detection and exploitation of functional dependencies for model generation ⋮ Iterative belief revision in extended logic programming ⋮ Contributions to the stable model semantics of logic programs with negation ⋮ Monotonic aggregation in deductive databases ⋮ Unnamed Item ⋮ A fixed point theorem for non-monotonic functions ⋮ The limits of fixed-order computation ⋮ Logical-epistemic foundations of general game descriptions ⋮ A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Soundness of abductive proof procedure with respect to constraint for non-ground abducibles ⋮ Inductive situation calculus ⋮ Games and total Datalog\(^{\lnot}\) queries ⋮ Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic ⋮ Well-founded semantics and stratification for ordered logic programs ⋮ Semi-equilibrium models for paracoherent answer set programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Negation by default and unstratifiable logic programs
• Semantical considerations on nonmonotonic logic
• Fixed-point extensions of first-order logic
• Why not negation by fixpoint?
• Elementary induction on abstract structures
• Formalizing a logic for logic programming
• Structure and complexity of relational queries
• A rational reconstruction of nonmonotonic truth maintenance systems
• Inductive definitions over finite structures
• Horn clause queries and generalizations
• Making prolog more expressive
• A kripke-kleene semantics for logic programs*
• Negation as failure. II
• Relational queries computable in polynomial time
• Negation in logic programming
• Negation as failure using tight derivations for general logic programs
• Contributions to the Theory of Logic Programming
• A procedural semantics for well-founded negation in logic programs
• The Semantics of Predicate Logic as a Programming Language
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Reasoning with knowledge and belief

This page was built for publication: The alternating fixpoint of logic programs with negation