Pages that link to "Item:Q579240"
From MaRDI portal
The following pages link to Decidability and definability with circumscription (Q579240):
Displaying 19 items.
- Circumscription: Completeness reviewed (Q685339) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
- On the satisfiability of circumscription (Q1073786) (← links)
- On the computability of circumscription (Q1098651) (← links)
- Autocircumscription (Q1105394) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
- The expressive power of circumscription (Q1274695) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- Note about cardinality-based circumscription (Q1575190) (← links)
- Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics (Q1776197) (← links)
- The complexity of predicate default logic over a countable domain (Q1861328) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- From decidability to undecidability by considering regular sets of instances (Q2062120) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- Decidable structures between Church-style and Curry-style (Q2958384) (← links)
- Indefinite reasoning with definite rules (Q4013779) (← links)
- A remark concerning decidability of complete theories (Q5800816) (← links)
