On the strength and scope of DLS
From MaRDI portal
Recommendations
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- The Ackermann approach for modal logic, correspondence theory and second-order reduction
- Second-order quantifier elimination on relational monadic formulas -- a basic method and some less expected applications
- IV. Semantic extensions of SQEMA
- Relational and Kleene-Algebraic Methods in Computer Science
Cites work
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Computing circumscription revisited: A reduction algorithm
- Elementary canonical formulae: extending Sahlqvist's theorem
- On the Correspondence Between Modal and Classical Logic: an Automated Approach
- Un-Skolemizing clause sets
- Untersuchungen über das Eliminationsproblem der mathematischen Logik
Cited in
(12)- Progress in DLA research
- Algebraic modal correspondence: Sahlqvist and beyond
- Second-order quantifier elimination on relational monadic formulas -- a basic method and some less expected applications
- IV. Semantic extensions of SQEMA
- Towards incorporating background theories into quantifier elimination
- The DL-Lite Family and Relations
- scientific article; zbMATH DE number 169405 (Why is no real title available?)
- scientific article; zbMATH DE number 10089 (Why is no real title available?)
- Completeness and correspondence in hybrid logic via an extension of SQEMA
- 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
- Polynomial-time checking of generalized Sahlqvist syntactic shape
This page was built for publication: On the strength and scope of DLS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3647241)
