O. Kupferman, U. Sattler, and M.Y. Vardi. The complexity of the Graded -calculus. In Proc. of the 18th CADE LNAI 2392, pages 423-437, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Numerical Document Queries - Seidl, Schwentick (2003) (5 citations) (Correct)
....operators. Neither unbounded numerical values nor automata theoretic characterizations or complexity issues are taken into account. Kupferman, Sattler and Vardi study a calculus with graded modalities where one can express, e.g. that a node has at least n successors satifying a certain property [14]. The numbers n there, however, are hard coded into the formula. Klaedtke and Ruess consider automata on the unlabeled in nite binary tree, that have an accepting condition depending on one global Presburger formula [13] Extending the construction in [15] Lugiez and Dal Zilio have ....
O. Kupferman, U. Sattler, and M.Y. Vardi. The Complexity of the Graded -Calculus. In 18th Int. Conf. on Automated Deduction (CADE), pages 423-437. LNCS 2392, Springer Verlag, 2002.
The Complexity of Enriched -Calculi - Piero Bonatti Carsten Self-citation (Vardi) (Correct)
No context found.
O. Kupferman, U. Sattler, and M.Y. Vardi. The complexity of the Graded -calculus. In Proc. of the 18th CADE LNAI 2392, pages 423-437, 2002.
Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) Self-citation (Vardi) (Correct)
No context found.
O. Kupferman, U. Sattler, and M. Y. Vardi. The complexity of the graded -calculus. In Proceedings of the Conference on Automated Deduction, volume 2392 of Lecture Notes in Artificial Intelligence, pages 423--437. Springer Verlag, 2002.
The Complexity of Enriched μ-Calculi - Bonatti, Lutz, Murano, Vardi Self-citation (Vardi) (Correct)
No context found.
O. Kupferman, U. Sattler, and M.Y. Vardi. The complexity of the Graded -calculus. In Proc. of the 18th CADE LNAI 2392, pages 423-437, 2002.
Automata-Theoretic Decision Procedures for Information Logics - Demri, Sattler (2002) Self-citation (Sattler) (Correct)
....such techniques have also been applied successfully in [LS01] to fragments of the Boolean modal logic BML introduced in We acknowledge nancial support from the RWTH Aachen, Germany for a visit of S. Demri at the RWTH in february 2002. GP90] and to hybrid full calculus in [SV01] see also [KSV02] opening an avenue to design similar decision procedures for other hybrid logics [Bla00b] In this paper, we will use automata theoretic decision procedures to prove complexity results for information logics. Information logics. Such logics were introduced in [Paw81] and we refer the reader to ....
O. Kupferman, U. Sattler, and M. Vardi. The complexity of the graded -calculus. In A. Voronkov, editor, Proc. 18th Conference on Automated Deduction, Copenhagen, Denmark, volume 2392 of Lecture Notes in Computer Science, pages 423-437. Springer, Berlin, 2002.
Counting in Trees for Free - Seidl, Schwentick, Muscholl.. (2004) (1 citation) (Correct)
No context found.
O. Kupferman, U. Sattler, and M.Y. Vardi. The Complexity of the Graded -Calculus. In 18th Int. Conf. on Automated Deduction (CADE), pages 423--437. LNCS 2392, Springer Verlag, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC