Unary negation

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 344-355

  Ten Cate, Balder ^a   Segoufin, Luc ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INRIA   (France)

Author keywords

Decidability; Logic; Unary negation

Indexed keywords

CONJUNCTIVE QUERIES; CRAIG INTERPOLATION; FINITE SATISFIABILITY; FIRST ORDER LOGIC; FIXED-POINT LOGIC; LOGIC; SATISFIABILITY; UNARY NEGATION;

COMPUTER SCIENCE; MODEL CHECKING;

COMPUTABILITY AND DECIDABILITY;

EID: 84880299682     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.344     Document Type: Conference Paper

References (25)

1. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27:217-274, 1998.
2. F. Baader, D. Calvanese, D.L. McGuinness, D. Nardi, and P.F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003.
3. J. Bailey, G. Dong, and A.W. To. Logical queries over views: Decidability and expressiveness. Transactions on Computational Logic, 11(2):8, 2010.
4. V. Bárány and M. Bojańczyk. Personal communication.
5. V. Bárány, G. Gottlob, and M. Otto. Querying the guarded fragment. In Proc. of Logic In Computer Science (LICS), 2010.
6. J. van Benthem. Modal Logic and Classical Logic. Bibliopolis, 1983.
7. D. Berwanger and E. Grädel. Games and model checking for guarded logics. In LPAR, pages 70-84, 2001.
8. M. Bojańczyk. Two-way alternating automata and finite models. In Intl. Coll. on Automata, Languages and Programming (ICALP), pages 833-844, 2002.
9. S.R. Buss and H. Louise. On truth-table reducibility to sat. Inf. Comput., 91(1):86-102, 1991.
10. B. ten Cate and M. Marx. Navigational XPath: calculus and algebra. SIGMOD Record, 36(2):19-26, 2007.
11. E.M. Clarke, O. Grumberg, and D.A. Peled. Model checking. MIT Press, 1999.
12. S. Cosmadakis, H. Gaifman, P. Kanellakis, and M. Vardi. Decidable optimization problems for database logic programs. In Proc. of ACM Symposium on Theory of Computing (STOC), 1988.
13. C. David. Analyse de XML avec données non-bornées. PhD thesis, Université Paris Diderot - Paris 7 (LIAFA), 2009.
14. G. Gottlob. NP trees and Carnap's modal logic. Journal of the ACM, 42(2):421-457, 1995.
15. E. Grädel. Why are modal logics so robustly decidable? In Current Trends In Theoretical Computer Science, pages 393-408. 2001.
16. E. Grädel and I. Walukiewicz. Guarded fixed point logic. In LICS, pages 45-54, 1999.
17. W. Hodges. Model Theory. Cambridge University Press, 1993.
18. E. Hoogland and M. Marx. Interpolation and definability in guarded fragments. Studia Logica, 70(3):373-409, 2002.
19. L. Libkin. Elements of Finite Model Theory. Springer, 2004.
20. M. Marx and M. de Rijke. Semantic characterizations of navigational XPath. SIGMOD Record, 34(2):41-46, 2005.
21. M. Otto. Bisimulation invariance and finite models. In Lecture Notes In Logic, Logic Colloquium 2002, pages 276-298. 2006.
22. E. Rosen. Modal logic over finite structures. Journal of Logic, Language, and Computation, 6(4):427-439, 1997.
23. P. Schnoebelen. Oracle circuits for branching-time model checking. In International Conference on Automata, Languages and Programming, pages 187-187, 2003.
24. M.Y. Vardi. Why is modal logic so robustly decidable? In Descriptive Complexity and Finite Models, pages 149-184, 1996.
25. K.W. Wagner. More Complicated Questions about Maxima and Minima, and some Closures of NP. Theoretical Computer Science, 51(1-2):53-80, 1987.