Pages that link to "Item:Q753501"
From MaRDI portal
The following pages link to Negation by default and unstratifiable logic programs (Q753501):
Displayed 18 items.
- Tie-breaking semantics and structural totality (Q676419) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Strong order equivalence (Q854968) (← links)
- Magic Sets and their application to data integration (Q882436) (← links)
- A logic of knowledge and justified assumption (Q1199920) (← links)
- Towards an efficient evaluation of recursive aggregates in deductive databases (Q1326572) (← links)
- A context for belief revision: forward chaining-normal nonmonotonic rule systems (Q1326782) (← links)
- Bottom-up evaluation of datalog with negation (Q1333369) (← links)
- Revision programming (Q1389448) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Uniform semantic treatment of default and autoepistemic logics (Q1853682) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Complexity of computing with extended propositional logic programs (Q1924783) (← links)
- On the impact of stratification on the complexity of nonmonotonic reasoning (Q4317728) (← links)
- The limits of fixed-order computation (Q5940930) (← links)