An extension of pointwise circumscription
From MaRDI portal
Recommendations
Cites work
- A circumscriptive theorem prover
- A generalization of collapsible cases of circumscription
- An algorithm to compute circumscription
- An efficient method for eliminating varying predicates from a circumscription
- Circumscription - a form of non-monotonic reasoning
- Circumscription: Completeness reviewed
- Completeness results for circumscription
- Conservative query normalization on parallel circumscription
- scientific article; zbMATH DE number 4106291 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 67498 (Why is no real title available?)
- scientific article; zbMATH DE number 592370 (Why is no real title available?)
- scientific article; zbMATH DE number 194618 (Why is no real title available?)
- scientific article; zbMATH DE number 194964 (Why is no real title available?)
- On the satisfiability of circumscription
- Some computational aspects of circumscription
Cited in
(5)
This page was built for publication: An extension of pointwise circumscription
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676573)