Guarded Negation

  • Vince Bárány
  • Balder ten Cate
  • Luc Segoufin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6756)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Vince Bárány
    • 1
  • Balder ten Cate
    • 2
  • Luc Segoufin
    • 3
  1. 1.University of WarsawPoland
  2. 2.UC Santa CruzUSA
  3. 3.INRIA and ENS Cachan, LSVFrance

Personalised recommendations