Pages that link to "Item:Q1114440"

The following pages link to Inferring negative information from disjunctive databases (Q1114440):

Displaying 16 items.

• Query evaluation in probabilistic relational databases (Q673389) (← links)
• Parsing as non-Horn deduction (Q688151) (← links)
• Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
• Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
• Paraconsistent disjunctive deductive databases (Q1185011) (← links)
• Interpreting disjunctive logic programs based on a strong sense of disjunction (Q1311401) (← links)
• An alternative approach to the semantics of disjunctive logic programs and deductive databases (Q1344892) (← links)
• Autoepistemic logic of knowledge and beliefs (Q1389599) (← links)
• Weak generalized closed world assumption (Q1825049) (← links)
• Static semantics for normal and disjunctive logic programs (Q1924728) (← links)
• On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
• Logic programming and reasoning with incomplete information (Q1924820) (← links)
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
• Stable classes and operator pairs for disjunctive programs (Q5101462) (← links)
• An abductive framework for negation in disjunctive logic programming (Q5236438) (← links)
• Characterizing D-WFS: Confluence and iterated GCWA (Q5236439) (← links)