Pages that link to "Item:Q4018170"
From MaRDI portal
The following pages link to Complexity Results for Nonmonotonic Logics (Q4018170):
Displaying 20 items.
- Well-Supported Semantics for Logic Programs with Generalized Rules (Q2900549) (← links)
- On the Complexity of Input/Output Logic (Q3457729) (← links)
- Rule Calculus: Semantics, Axioms and Applications (Q3532483) (← links)
- The Complexity of Reasoning for Fragments of Default Logic (Q3637157) (← links)
- A Default Logic Patch for Default Logic (Q3638180) (← links)
- (Q3681934) (← links)
- A survey of non-monotonic reasoning (Q3839542) (← links)
- On the impact of stratification on the complexity of nonmonotonic reasoning (Q4317728) (← links)
- Skeptical query-answering in Constrained Default Logic (Q4632323) (← links)
- Generalized compactness of nonmonotonic inference operations (Q4835518) (← links)
- Analytic tableaux for default logics (Q4868235) (← links)
- (Q4904137) (← links)
- The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
- Skeptical rational extensions (Q5101455) (← links)
- Reasoning with stratified default theories (Q5101456) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- Proof Complexity of Non-classical Logics (Q5900979) (← links)
- Default logic and bounded treewidth (Q5918613) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Strong backdoors for default logic (Q6610193) (← links)