Negation by default and unstratifiable logic programs
From MaRDI portal
Publication:753501
DOI10.1016/0304-3975(51)90004-7zbMath0716.68075OpenAlexW2010160994MaRDI QIDQ753501
Christine Froidevaux, Nicole Bidoit
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(51)90004-7
Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Related Items
Towards an efficient evaluation of recursive aggregates in deductive databases, A context for belief revision: forward chaining-normal nonmonotonic rule systems, Backdoors to Normality for Disjunctive Logic Programs, Bottom-up evaluation of datalog with negation, Strong order equivalence, Update rules in datalog programs, On the computational cost of disjunctive logic programming: Propositional case, Complexity of computing with extended propositional logic programs, Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?, Magic Sets and their application to data integration, Revision programming, A sphere world semantics for default reasoning, On the impact of stratification on the complexity of nonmonotonic reasoning, Fixpoint semantics for active integrity constraints, Tie-breaking semantics and structural totality, The alternating fixpoint of logic programs with negation, A logic of knowledge and justified assumption, On the Coincidence of Semantics for Uniquely Determined Programs, The limits of fixed-order computation, General default logic, Negation in rule-based database languages: A survey, Negation by default and unstratifiable logic programs, Uniform semantic treatment of default and autoepistemic logics, Backdoors to tractable answer set programming, Logic programming and knowledge representation---The A-Prolog perspective, Enhancing disjunctive logic programming systems by SAT checkers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Negation by default and unstratifiable logic programs
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Semantical considerations on nonmonotonic logic
- On the relation between default and autoepistemic logic
- Minimalism, justification and non-monotonicity in deductive databases
- A logic for default reasoning
- General logical databases and programs: Default logic semantics and stratification
- Why not negation by fixpoint?
- Horn clause queries and generalizations
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Negation as failure. II
- Complete logic programs with domain-closure axiom
- Contributions to the Theory of Logic Programming
- The Semantics of Predicate Logic as a Programming Language
- A Computing Procedure for Quantification Theory
