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. © 2002 Springer-Verlag.
CITATION STYLE
Szalas, A. (2002). Second-order quantifier elimination in modal contexts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2424 LNAI, pp. 223–232). Springer Verlag. https://doi.org/10.1007/3-540-45757-7_19
Mendeley helps you to discover research relevant for your work.