Abstract
We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of negation are required to be guarded by an atomic predicate. In terms of expressive power, the logics in question, called GNFO and GNFP, extend the guarded fragment of first-order logic and guarded least fixpoint logic, respectively. They also extend the recently introduced unary negation fragments of first-order logic and of least fixpoint logic.
We show that the satisfiability problem for GNFO and for GNFP is 2ExpTime-complete, both on arbitrary structures and on finite structures. We also study the complexity of the associated model checking problems. Finally, we show that GNFO and GNFP are not only computationally well behaved, but also model theoretically: we show that GNFO and GNFP have the tree-like model property and that GNFO has the finite model property, and we characterize the expressive power of GNFO in terms of invariance for an appropriate notion of bisimulation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andréka, H., van Benthem, J., Németi, I.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27, 217–274 (1998)
Bárány, V., Bojańczyk, M.: Finite satisfiability for guarded fixpoint logic. Draft available at arXiv:1104.2262v1 [cs.LO] (2011)
Bárány, V., Gottlob, G., Otto, M.: Querying the guarded fragment. In: Symposium on Logic In Computer Science, LICS (2010)
Berwanger, D., Grädel, E.: Games and model checking for guarded logics. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, p. 70. Springer, Heidelberg (2001)
Bojańczyk, M.: Two-way alternating automata and finite models. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, p. 833. Springer, Heidelberg (2002)
Grädel, E.: Decision procedures for guarded logics. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 31–51. Springer, Heidelberg (1999)
Grädel, E.: On the restraining power of guards. J. Symb. Logic 64(4), 1719–1742 (1999)
Grädel, E.: Why are modal logics so robustly decidable? Current Trends in Theoretical Computer Science, 393–408 (2001)
Grädel, E., Otto, M., Rosen, E.: Undecidability results on two-variable logics. Arch. Math. Log. 38(4-5), 313–354 (1999)
Grädel, E., Walukiewicz, I.: Guarded fixed point logic. In: Proc. LICS 1999. IEEE, Los Alamitos (1999)
Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)
Mortimer, M.: On languages with two variables. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 21(8), 135–140 (1975)
ten Cate, B., Segoufin, L.: Unary negation. In: Proc. STACS 2011 (2011)
Vardi, M.Y.: Why is modal logic so robustly decidable?. In: Descriptive Complexity and Finite Models, pp. 149–184 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bárány, V., ten Cate, B., Segoufin, L. (2011). Guarded Negation. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-22012-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22011-1
Online ISBN: 978-3-642-22012-8
eBook Packages: Computer ScienceComputer Science (R0)