Pages that link to "Item:Q1329160"
From MaRDI portal
The following pages link to The complexity of propositional closed world reasoning and circumscription (Q1329160):
Displayed 13 items.
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- A theoretical framework on proactive information exchange in agent teamwork (Q2457648) (← links)
- Complexity of Counting the Optimal Solutions (Q3511323) (← links)