The alternating fixpoint of logic programs with negation
From MaRDI portal
Publication:686646
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 4147465 (Why is no real title available?)
- scientific article; zbMATH DE number 4155872 (Why is no real title available?)
- scientific article; zbMATH DE number 4158607 (Why is no real title available?)
- scientific article; zbMATH DE number 3664336 (Why is no real title available?)
- scientific article; zbMATH DE number 18533 (Why is no real title available?)
- scientific article; zbMATH DE number 4185010 (Why is no real title available?)
- scientific article; zbMATH DE number 4185011 (Why is no real title available?)
- A kripke-kleene semantics for logic programs*
- A procedural semantics for well-founded negation in logic programs
- A rational reconstruction of nonmonotonic truth maintenance systems
- Autoepistemic logic
- Contributions to the Theory of Logic Programming
- Elementary induction on abstract structures
- Fixed-point extensions of first-order logic
- Formalizing a logic for logic programming
- Horn clause queries and generalizations
- Inductive definitions over finite structures
- Making prolog more expressive
- Negation as failure using tight derivations for general logic programs
- Negation as failure. II
- Negation by default and unstratifiable logic programs
- Negation in logic programming
- Reasoning with knowledge and belief
- Relational queries computable in polynomial time
- Semantical considerations on nonmonotonic logic
- Structure and complexity of relational queries
- The Semantics of Predicate Logic as a Programming Language
- The well-founded semantics for general logic programs
- Why not negation by fixpoint?
Cited in
(37)- A new approach to hybrid probabilistic logic programs
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
- Transformation-based bottom-up computation of the well-founded model
- The limits of fixed-order computation
- Alternation and the computational complexity of logic programs
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Monotonic aggregation in deductive databases
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
- Integrating Inductive Definitions in SAT
- scientific article; zbMATH DE number 4018389 (Why is no real title available?)
- Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic
- Equational properties of stratified least fixed points (extended abstract)
- Partial models and logic programming
- scientific article; zbMATH DE number 1696828 (Why is no real title available?)
- Inductive situation calculus
- Logical-epistemic foundations of general game descriptions
- Datalog queries distributing over components
- Iterative belief revision in extended logic programming
- Contributions to the stable model semantics of logic programs with negation
- Well-founded semantics and stratification for ordered logic programs
- Recursive rules with aggregation: a simple unified semantics
- Detection and exploitation of functional dependencies for model generation
- FO(ID) as an extension of DL with rules
- Logic programming as classical inference
- Semi-equilibrium models for paracoherent answer set programs
- Characterising and explaining inconsistency in logic programs
- A fixed point theorem for non-monotonic functions
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- scientific article; zbMATH DE number 2085280 (Why is no real title available?)
- Why not negation by fixpoint?
- scientific article; zbMATH DE number 1696794 (Why is no real title available?)
- On the equivalence of semantics for normal logic programs
- Games and total Datalog\(^{\lnot}\) queries
- Topological investigations of the operators of the well-founded, and alternating fixed-point semantics of normal logic programs
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
- Well-founded operators for normal hybrid MKNF knowledge bases
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)
