Negation by default and unstratifiable logic programs

DOI10.1016/0304-3975(51)90004-7zbMATH Open0716.68075OpenAlexW2010160994MaRDI QIDQ753501FDOQ753501

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

Recommendations

• scientific article
• The well-founded semantics for general logic programs
• scientific article; zbMATH DE number 1292289
• scientific article; zbMATH DE number 1123619
• On stratified disjunctive programs

zbMATH Keywords

stratificationnegation by default

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• A Computing Procedure for Quantification Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A logic for default reasoning
• Saturation, nonmonotonic reasoning and the closed-world assumption
• Semantical considerations on nonmonotonic logic
• Minimalism, justification and non-monotonicity in deductive databases
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Contributions to the Theory of Logic Programming
• On the relation between default and autoepistemic logic
• Horn clause queries and generalizations
• General logical databases and programs: Default logic semantics and stratification
• Why not negation by fixpoint?
• Title not available (Why is that?)
• Negation by default and unstratifiable logic programs
• Negation as failure. II
• Complete logic programs with domain-closure axiom

Cited In (32)

• Uniform semantic treatment of default and autoepistemic logics
• A sphere world semantics for default reasoning
• The alternating fixpoint of logic programs with negation
• A context for belief revision: forward chaining-normal nonmonotonic rule systems
• The limits of fixed-order computation
• The defining power of stratified and hierarchical logic programs
• Magic Sets and their application to data integration
• General default logic
• Strong order equivalence
• Answer Set Programming without Unstratified Negation
• A logic of knowledge and justified assumption
• Title not available (Why is that?)
• On the computational cost of disjunctive logic programming: Propositional case
• Backdoors to Normality for Disjunctive Logic Programs
• Fixpoint semantics for active integrity constraints
• Complexity of computing with extended propositional logic programs
• Towards an efficient evaluation of recursive aggregates in deductive databases
• Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
• Bottom-up evaluation of datalog with negation
• Defeasible logic versus Logic Programming without Negation as Failure
• Revision programming
• Backdoors to tractable answer set programming
• Negation in rule-based database languages: A survey
• Logic programming and knowledge representation---The A-Prolog perspective
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Coincidence of Semantics for Uniquely Determined Programs
• Enhancing disjunctive logic programming systems by SAT checkers
• Update rules in datalog programs
• On the impact of stratification on the complexity of nonmonotonic reasoning
• Tie-breaking semantics and structural totality
• Negation by default and unstratifiable logic programs

This page was built for publication: Negation by default and unstratifiable logic programs

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