Pages that link to "Item:Q1825049"
From MaRDI portal
The following pages link to Weak generalized closed world assumption (Q1825049):
Displayed 16 items.
- Query evaluation in probabilistic relational databases (Q673389) (← links)
- Parsing as non-Horn deduction (Q688151) (← links)
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
- Semantics of Horn and disjunctive logic programs (Q1177928) (← links)
- Fuzzy information in extended fuzzy relational databases (Q1296884) (← links)
- Interpreting disjunctive logic programs based on a strong sense of disjunction (Q1311401) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- An alternative approach to the semantics of disjunctive logic programs and deductive databases (Q1344892) (← links)
- On stratified disjunctive programs (Q1356225) (← links)
- Autoepistemic logic of knowledge and beliefs (Q1389599) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- Static semantics for normal and disjunctive logic programs (Q1924728) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- An abductive framework for negation in disjunctive logic programming (Q5236438) (← links)
- Characterizing D-WFS: Confluence and iterated GCWA (Q5236439) (← links)