The following pages link to (Q3820058):
Displaying 10 items.
- On reasoning about structural equality in XML: a description logic approach (Q555777) (← links)
- Parsing as non-Horn deduction (Q688151) (← links)
- An efficient strategy for non-Horn deductive databases (Q753478) (← links)
- The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
- Non-Horn clause logic programming without contrapositives (Q1116717) (← links)
- Semantics of Horn and disjunctive logic programs (Q1177928) (← links)
- Paraconsistent disjunctive deductive databases (Q1185011) (← links)
- Generalized disjunctive well-founded semantics for logic programs. (Q1354026) (← links)
- Weak generalized closed world assumption (Q1825049) (← links)
