Second-Order Quantifier Elimination in Modal Contexts

Authors:
Andrzej Szalas
Affiliations:
-
Venue:
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Year:
2002

Citing 11
Cited 3

Circumscription

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
General domain circumscription and its effective reductions

Fundamenta Informaticae
Meta-queries on deductive databases

Fundamenta Informaticae
On a static verification of integrity constraints in relational databases

Relational methods for computer science applications
Tractable Reasoning in Artificial Intelligence

Tractable Reasoning in Artificial Intelligence
Rough-Neuro-Computing: Techniques for Computing with Words

Rough-Neuro-Computing: Techniques for Computing with Words
Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
Efficient Reasoning Using the Local Closed-World Assumption

AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Computing strongest necessary and weakest sufficient conditions of first-order formulas

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions

Fundamenta Informaticae
Quantifier elimination in elementary set theory

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning.In the current paper we generalize the result of [19] by allowing modal operators. This allows us to provide a unifying framework for many applications, that require the use of intensional concepts. Examples of applications of the technique in AI are also provided.