On the finite satisfiability problem for the guarded fragment with transitivity

Authors:
Wiesław Szwast;Lidia Tendera
Affiliations:
Institute of Mathematics and Informatics, Opole University, Poland;Institute of Mathematics and Informatics, Opole University, Poland
Venue:
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2005

Citing 9
Cited 1

Complexity Results for First-Order Two-Variable Logic with Counting

SIAM Journal on Computing
Tolerance Logic

Journal of Logic, Language and Information
Two-Way Alternating Automata and Finite Models

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Invited Talk: Decision procedures for guarded logics

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Guarded Fixed Point Logic

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The Two-Variable Guarded Fragment with Transitive Relations

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
On the Decision Problem for the Guarded Fragment with Transitivity

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Complexity of the Two-Variable Fragment with Counting Quantifiers

Journal of Logic, Language and Information
The two-variable guarded fragment with transitive guards is 2EXPTIME-hard

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software

On finite satisfiability of the guarded fragment with equivalence or transitive guards

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.