scientific article; zbMATH DE number 1337728
From MaRDI portal
Publication:4264098
Recommendations
- General domain circumscription and its first-order reduction
- Generalized effective reducibility
- scientific article; zbMATH DE number 1189290
- An abstract theory for the domain reduction method
- Computing circumscription revisited: A reduction algorithm
- scientific article; zbMATH DE number 3858462
- Theoretical and computational results about optimality-based domain reductions
- Some reasons for generalising domain theory
- Reducibility of domain representations and Cantor–Weihrauch domain representations
Cited in
(8)- Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals
- scientific article; zbMATH DE number 994057 (Why is no real title available?)
- General domain circumscription and its first-order reduction
- scientific article; zbMATH DE number 7453108 (Why is no real title available?)
- Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions
- A fixed-point theorem for Horn formula equations
- Computing witnesses using the SCAN algorithm
- An abstract fixed-point theorem for Horn formula equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4264098)
