An efficient method for eliminating varying predicates from a circumscription
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3113497 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 1028827 (Why is no real title available?)
- scientific article; zbMATH DE number 194618 (Why is no real title available?)
- A circumscriptive theorem prover
- An algorithm to compute circumscription
- Circumscription - a form of non-monotonic reasoning
- Closed-world databases and circumscription
- Decidability and definability with circumscription
- Deduction in non-Horn databases
- Eliminating the fixed predicates from a circumscription
- Negation as failure: careful closure procedure
- On the relationship between circumscription and negation as failure
- Saturation, nonmonotonic reasoning and the closed-world assumption
Cited in
(8)- Reducing belief revision to circumscription (and vice versa)
- Note about cardinality-based circumscription
- Embedding circumscriptive theories in general disjunctive programs
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
- An extension of pointwise circumscription
- Eliminating the fixed predicates from a circumscription
- The complexity of propositional closed world reasoning and circumscription
- The Monotonous Elimination of Predicate Variables
This page was built for publication: An efficient method for eliminating varying predicates from a circumscription
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193478)