Pages that link to "Item:Q5705928"
From MaRDI portal
The following pages link to Logic for Programming, Artificial Intelligence, and Reasoning (Q5705928):
Displaying 13 items.
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- A dichotomy in the complexity of propositional circumscription (Q1764422) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- The Complexity of Theorem Proving in Circumscription and Minimal Entailment (Q3192208) (← links)
- The Complexity of Circumscription in DLs (Q3651476) (← links)
- (Q4691408) (← links)
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)