A polynomial translation from the two-variable guarded fragment with number restrictions to the guarded fragment

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3229, Issue , 2004, Pages 372-384

  Kazakov, Yevgeny ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; LINEAR EQUATIONS; MATHEMATICAL MODELS; MODAL ANALYSIS; POLYNOMIALS; ARTIFICIAL INTELLIGENCE; BINS; DATA DESCRIPTION; POLYNOMIAL APPROXIMATION;

CONFIGURATION CONSTRAINTS; DESCRIPTION LOGICS; POLYNOMIAL TRANSLATION; TWO-VARIABLE GUARDED FRAGMENT;

FORMAL LOGIC;

BINARY RELATION; DESCRIPTION LOGIC; GUARDED FRAGMENT; NUMBER RESTRICTIONS; POLYNOMIAL TRANSLATION; REASONING PROBLEMS; SATISFIABILITY PROBLEMS; TWO-VARIABLE GUARDED FRAGMENT;

EID: 22944443290     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_32     Document Type: Conference Paper

References (10)

1. Andréka, H., van Benthem, J. & Németi, I. (1998), 'Modal languages and bounded fragments of predicate logic', Journal of Philosophical Logic 27, 217-274.
2. Ganzinger, H. & de Nivelle, H. (1999), A superposition decision procedure for the guarded fragment with equality, in 'Proc. 14th IEEE Symposium on Logic in Computer Science', IEEE Computer Society Press, pp. 295-305.
3. Grädel, E. (1999a), Decision procedures for guarded logics, in 'Automated Deduction - CADE16. Proceedings of 16th International Conference on Automated Deduction, Trento, 1999', Vol. 1632 of LNCS, Springer-Verlag.
4. Grädel, E. (1999b), 'On the restraining power of guards', Journal of Symbolic Logic 64(4), 1719-1742.
5. Haarslev, V. & Möller, R. (2001), Optimizing reasoning in description logics with qualified number restrictions, in 'Proceedings of the International Workshop on Description Logics (DL-2001)', Stanford, USA, pp. 142-151.
6. Haarslev, V., Timmann, M. & Möller, R. (2001), Combining tableau and algebraic methods for reasoning with qualified number restrictions in description logics, in 'Proceedings of the International Workshop on Methods for Modalities 2 (M4M-2)', Amsterdam, Netherlands.
7. Hladik, J. (2002), Implementation and optimisation of a tableau algorithm for the guarded fragment, in U. Egly & C. G. Fermüller, eds, 'Proceedings of the International Conference on Automated Reasoning with Tableaux and Related Methods (Tableaux 2002) ', Vol. 2381 of Lecture Notes in Artificial Intelligence, Springer-Verlag.
8. Hladik, J. & Sattler, U. (2003), A translation of looping alternating automata to description logics, in 'Proc. of the 19th Conference on Automated Deduction (CADE-19) ', Vol. 2741 of Lecture Notes in Artificial Intelligence, Springer Verlag.
9. Tobies, S. (2001), Complexity Results and Practical Algorithms for Logics in Knowledge Representation, PhD thesis, RWTH Aachen, Germany.
10. Vardi, M. (1996), Why is modal logic so robustly decidable?, in N. Immerman & P. G. Kolaitis, eds, 'Descriptive Complexity and Finite Models', Vol. 31 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Princeton University, pp. 149-184.