Pages that link to "Item:Q1119564"
From MaRDI portal
The following pages link to Eliminating the fixed predicates from a circumscription (Q1119564):
Displaying 10 items.
- Compiling a default reasoning system into Prolog (Q750134) (← links)
- A consistency-based approach for belief change (Q814523) (← links)
- An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
- The expressive power of circumscription (Q1274695) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- Note about cardinality-based circumscription (Q1575190) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models (Q3534658) (← links)
- Embedding circumscriptive theories in general disjunctive programs (Q5101461) (← links)
