General domain circumscription and its first-order reduction
From MaRDI portal
Publication:4632291
Recommendations
Cites work
- scientific article; zbMATH DE number 994057 (Why is no real title available?)
- scientific article; zbMATH DE number 1303431 (Why is no real title available?)
- A tableau prover for domain minimization
- Computing circumscription revisited: A reduction algorithm
- First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment
- General domain circumscription and its first-order reduction
- On the Correspondence Between Modal and Classical Logic: an Automated Approach
- The mathematics of non-monotonic reasoning
- Untersuchungen über das Eliminationsproblem der mathematischen Logik
Cited in
(2)
This page was built for publication: General domain circumscription and its first-order reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632291)