The following pages link to (Q3939270):
Displaying 50 items.
- Querying incomplete information in RDF with SPARQL (Q286403) (← links)
- A game semantics for disjunctive logic programming (Q388214) (← links)
- Inductive equivalence in clausal logic and nonmonotonic logic programming (Q413854) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- Query evaluation in probabilistic relational databases (Q673389) (← links)
- The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
- Closed world assumptions having precedence in predicates (Q922726) (← links)
- Disjunctive databases for representing repairs (Q987484) (← links)
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
- The theory of interval probabilistic logic programs (Q1039578) (← links)
- Computing only minimal answers in disjunctive deductive databases (Q1040782) (← links)
- Negation as failure: careful closure procedure (Q1097727) (← links)
- Inferring negative information from disjunctive databases (Q1114440) (← links)
- On the relationship between circumscription and negation as failure (Q1115207) (← links)
- An algorithm to compute circumscription (Q1115208) (← links)
- Stratification and knowledge base management (Q1122994) (← links)
- Minimalism, justification and non-monotonicity in deductive databases (Q1123011) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- Semantics of Horn and disjunctive logic programs (Q1177928) (← links)
- Paraconsistent disjunctive deductive databases (Q1185011) (← links)
- An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- Relating minimal models and pre-requisite-free normal defaults (Q1205716) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Interpreting disjunctive logic programs based on a strong sense of disjunction (Q1311401) (← links)
- First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment (Q1311412) (← links)
- View updates in stratified disjunctive databases (Q1319392) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- Formalizing incomplete knowledge in incomplete databases (Q1337644) (← links)
- A semantics for a class of non-deterministic and causal production system programs (Q1340964) (← links)
- Ordered model trees: A normal form for disjunctive deductive databases (Q1344891) (← links)
- An alternative approach to the semantics of disjunctive logic programs and deductive databases (Q1344892) (← links)
- Deontic logic as founded on nonmonotonic logic (Q1353848) (← links)
- Generalized disjunctive well-founded semantics for logic programs. (Q1354026) (← links)
- On stratified disjunctive programs (Q1356225) (← links)
- Incomplete deductive databases (Q1360679) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- On computing minimal models (Q1380414) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Autoepistemic logic of knowledge and beliefs (Q1389599) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- The complexity of belief update (Q1575185) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Weak generalized closed world assumption (Q1825049) (← links)
