Pages that link to "Item:Q579240"
From MaRDI portal
The following pages link to Decidability and definability with circumscription (Q579240):
Displaying 8 items.
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← 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)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
