The alternating fixpoint of logic programs with negation
DOI10.1016/0022-0000(93)90024-QzbMATH Open0793.68039OpenAlexW4212881215MaRDI QIDQ686646FDOQ686646
Authors: 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
Recommendations
negation as failurestable modelsfixpoint logicalternating fixpoint logicalternating fixpoint partial modelHorn clause semanticsleast fixpointlogic program with negationnegative conclusionspositive conclusionsstratified semanticswell-founded partial model
Logic programming (68N17) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Lattices (06B99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The well-founded semantics for general logic programs
- Fixed-point extensions of first-order logic
- Elementary induction on abstract structures
- Making prolog more expressive
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Semantics of Predicate Logic as a Programming Language
- Autoepistemic logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semantical considerations on nonmonotonic logic
- A kripke-kleene semantics for logic programs*
- Relational queries computable in polynomial time
- Negation in logic programming
- Contributions to the Theory of Logic Programming
- Title not available (Why is that?)
- Horn clause queries and generalizations
- Structure and complexity of relational queries
- Why not negation by fixpoint?
- A rational reconstruction of nonmonotonic truth maintenance systems
- Title not available (Why is that?)
- A procedural semantics for well-founded negation in logic programs
- Negation by default and unstratifiable logic programs
- Formalizing a logic for logic programming
- Inductive definitions over finite structures
- Negation as failure. II
- Negation as failure using tight derivations for general logic programs
- Title not available (Why is that?)
- Reasoning with knowledge and belief
Cited In (37)
- Semi-equilibrium models for paracoherent answer set programs
- Title not available (Why is that?)
- Why not negation by fixpoint?
- Title not available (Why is that?)
- A fixed point theorem for non-monotonic functions
- Transformation-based bottom-up computation of the well-founded model
- The limits of fixed-order computation
- Partial models and logic programming
- On the equivalence of semantics for normal logic programs
- Monotonic aggregation in deductive databases
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Equational Properties of Stratified Least Fixed Points (Extended Abstract)
- Characterising and Explaining Inconsistency in Logic Programs
- Integrating Inductive Definitions in SAT
- Title not available (Why is that?)
- Logical-epistemic foundations of general game descriptions
- FO(ID) as an extension of DL with rules
- Recursive rules with aggregation: a simple unified semantics
- Games and total Datalog\(^{\lnot}\) queries
- A new approach to hybrid probabilistic logic programs
- Well-founded semantics and stratification for ordered logic programs
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
- Inductive situation calculus
- Logic programming as classical inference
- Datalog Queries Distributing over Components
- Alternation and the computational complexity of logic programs
- Title not available (Why is that?)
- Topological investigations of the operators of the well-founded, and alternating fixed-point semantics of normal logic programs
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
- Well-founded operators for normal hybrid MKNF knowledge bases
- Iterative belief revision in extended logic programming
- Contributions to the stable model semantics of logic programs with negation
- Detection and exploitation of functional dependencies for model generation
This page was built for publication: The alternating fixpoint of logic programs with negation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686646)
