Pages that link to "Item:Q4275256"
From MaRDI portal
The following pages link to A survey of complexity results for non-monotonic logics (Q4275256):
Displaying 27 items.
- Weight constraint programs with evaluable functions (Q645084) (← links)
- Proof complexity of propositional default logic (Q647339) (← links)
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- Cumulative default logic: Finite characterization, algorithms, and complexity (Q1337685) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- Sound and efficient closed-world reasoning for planning (Q1399125) (← links)
- Fixed-parameter tractability of disjunction-free default reasoning (Q1400063) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- Propositional default logics made easier: computational complexity of model checking. (Q1853549) (← links)
- Default reasoning by deductive planning (Q1896366) (← links)
- A new methodology for query answering in default logics via structure-oriented theorem proving (Q1896370) (← links)
- Propositional truth maintenance systems: Classification and complexity analysis (Q1924776) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Complexity of computing with extended propositional logic programs (Q1924783) (← links)
- A recipe for the complexity analysis of non-classical logics (Q2782480) (← links)
- Complexity Results for Nonmonotonic Logics (Q4018170) (← links)
- A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming (Q4559799) (← links)
- (Q4904137) (← links)
- Disjoint Logics (Q5013619) (← links)
- Logic and Complexity in Cognitive Science (Q5249690) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)