Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications
From MaRDI portal
Publication:3455775
DOI10.1007/978-3-319-24312-2_18zbMath1471.03021OpenAlexW2247158440MaRDI QIDQ3455775
Publication date: 11 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24312-2_18
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Ackermann approach for modal logic, correspondence theory and second-order reduction
- Forgetting for knowledge bases in DL-lite
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Elimination problems in logic: a brief history
- Complexity results for classes of quantificational formulas
- Computing circumscription revisited: A reduction algorithm
- Untersuchungen über das Eliminationsproblem der mathematischen Logik
- Zum Eliminationsproblem der mathematischen Logik
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- HEINRICH BEHMANN’S 1921 LECTURE ON THE DECISION PROBLEM AND THE ALGEBRA OF LOGIC
- Uniform Interpolation of $\mathcal{ALC}$ -Ontologies Using Fixpoints
- Abduction in Logic Programming as Second-Order Quantifier Elimination
- Count and Forget: Uniform Interpolation of $\mathcal{SHQ}$ -Ontologies
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications
- On the strength and scope of DLS
- Tableaux for Projection Computation and Knowledge Compilation
- The DL-Lite Family and Relations
- Automated Reasoning with Analytic Tableaux and Related Methods
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Relational and Kleene-Algebraic Methods in Computer Science
- On the logic of quantification
This page was built for publication: Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications
