The following pages link to (Q4391449):
Displayed 17 items.
- Unfold/fold transformations for disjunctive logic programs (Q287026) (← links)
- On reasoning about structural equality in XML: a description logic approach (Q555777) (← links)
- Computing minimal models by partial instantiation (Q672131) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- Semantic-based construction of arguments: an answer set programming approach (Q899190) (← links)
- Programming in metric temporal logic (Q1128978) (← links)
- Paraconsistent disjunctive deductive databases (Q1185011) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Prioritized logic programming and its application to commonsense reasoning (Q1589476) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- On the Relations between Disjunctive and Linear Logic Programming (Q4923519) (← links)
- On the equivalence of the static and disjunctive well-founded semantics and its computation (Q5941206) (← links)