Skip to Main content Skip to Navigation
New interface
Journal articles

Guarded negation

Vince Barany 1 Balder Ten Cate 2 Luc Segoufin 1 
1 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
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 the 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. Our complexity upper bounds for GNFO and GNFP hold true even for their " clique-guarded " extensions CGNFO and CGNFP, in which clique guards are allowed in the place of guards.
Document type :
Journal articles
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Luc Segoufin Connect in order to contact the contributor
Submitted on : Wednesday, August 26, 2015 - 12:12:27 PM
Last modification on : Tuesday, November 29, 2022 - 12:00:08 PM
Long-term archiving on: : Friday, November 27, 2015 - 10:54:59 AM


Files produced by the author(s)


  • HAL Id : hal-01184763, version 1


Vince Barany, Balder Ten Cate, Luc Segoufin. Guarded negation. Journal of the ACM (JACM), 2015, 62 (3), pp.24. ⟨hal-01184763⟩



Record views


Files downloads