Negation by default and unstratifiable logic programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4199654 (Why is no real title available?)
- scientific article; zbMATH DE number 3976991 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (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 Computing Procedure for Quantification Theory
- A logic for default reasoning
- Complete logic programs with domain-closure axiom
- Contributions to the Theory of Logic Programming
- General logical databases and programs: Default logic semantics and stratification
- Horn clause queries and generalizations
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Minimalism, justification and non-monotonicity in deductive databases
- Negation as failure. II
- Negation by default and unstratifiable logic programs
- On the relation between default and autoepistemic logic
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Semantical considerations on nonmonotonic logic
- The Semantics of Predicate Logic as a Programming Language
- Why not negation by fixpoint?
Cited in
(32)- Negation by default and unstratifiable logic programs
- 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
- Magic Sets and their application to data integration
- The limits of fixed-order computation
- The defining power of stratified and hierarchical logic programs
- General default logic
- On the coincidence of semantics for uniquely determined programs
- Strong order equivalence
- Answer Set Programming without Unstratified Negation
- A logic of knowledge and justified assumption
- scientific article; zbMATH DE number 1453065 (Why is no real title available?)
- On the computational cost of disjunctive logic programming: Propositional case
- Fixpoint semantics for active integrity constraints
- Update rules in Datalog programs
- 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
- Negation in rule-based database languages: A survey
- Backdoors to tractable answer set programming
- Logic programming and knowledge representation---The A-Prolog perspective
- scientific article; zbMATH DE number 732053 (Why is no real title available?)
- Backdoors to normality for disjunctive logic programs
- scientific article; zbMATH DE number 1884384 (Why is no real title available?)
- Enhancing disjunctive logic programming systems by SAT checkers
- Tie-breaking semantics and structural totality
- On the impact of stratification on the complexity of nonmonotonic reasoning
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)
