On the decision problem for the guarded fragment with transitivity

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 147-156

  Szwast, W ^a   Tendera, L ^a  

^a UNIVERSITY OF OPOLE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; NUMBER THEORY; OPTIMIZATION; THEOREM PROVING;

DECISION PROBLEM; MODAL LOGIC;

FORMAL LOGIC;

EID: 0034858401     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Modal languages and bounded fragments of predicate logic
2. Terminologische logiken
3. On the relative expressiveness of description logics and predicate logics
4. Knowledge as a toll in motion planning under uncertainty
5. Authentication: A practical study in belief and action
6. A temporal framework for database specification
7. Design and synthesis of synchronization skeletons using branching time temporal logic
8. Expressive functional completeness in tense logic
9. The two-variable guarded fragment with transitive relations
10. On the restraining power of guards
11. On the decision problem for two-variable first-order logic
12. Undecidability results on two-variable logic
13. Guarded fixed point logic
14. Knowledge and common knowledge in a distributed environment
15. Model checking and transitive-closure logic
16. Complexity results for classes of quantificational formulas
17. On the logic of incomplete information
18. Some philosophical problems from the standpoint of artificial intelligence
19. On languages with two variables
20. The temporal logic of programs
21. Semantical considerations on floydhoare logic
22. A decision method for validity of sentences in two variables
23. On the complexity of the monadic guarded fragment with transitivity
24. Dynamics bits and pieces
25. Why is modal logic so robustly decidable?