Results 1 to 10 of about 180 (170)
Querying the Guarded Fragment [PDF]
Logical Methods in Computer Science, 2014 Evaluating a Boolean conjunctive query Q against a guarded first-order theory F is equivalent to checking whether "F and not Q" is unsatisfiable. This problem is relevant to the areas of database theory and description logic.
Vince Bárány +2 more
doaj +6 more sources
Lecture Notes in Computer Science, 2022 AbstractIn this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of guarded two-variable logic, has the Craig interpolation property. We will also prove that the satisfiability problem of uniform guarded fragment is NExpTime-complete.
Reijo Jaakkola
exaly +4 more sources
The Semijoin Algebra and the Guarded Fragment [PDF]
Journal of Logic, Language and Information, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jerzy Tyszkiewicz +2 more
exaly +4 more sources
On the complexity of the two-variable guarded fragment with transitive guards
Information and Computation, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emanuel Kieroński
exaly +3 more sources
A Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment [PDF]
Lecture Notes in Computer Science, 2004 We consider a two-variable guarded fragment with number restrictions for binary relations and give a satisfiability preserving transformation of formulas in this fragment to the three-variable guarded fragment. The translation can be computed in polynomial time and produces a formula that is linear in the size of the initial formula even for the binary
Yevgeny Kazakov, Kazakov Yevgeny
exaly +4 more sources
The guarded fragment with transitive guards
Annals of Pure and Applied Logic, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lidia Tendera
exaly +3 more sources
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants [PDF]
ACM Transactions on Computational Logic, 2018 We consider extensions of the two-variable guarded fragment, GF 2 , where distinguished binary predicates that occur only in guards are required to be interpreted in a special way (as transitive relations, equivalence relations, preorders, or partial orders).
Emanuel Kieroński, Lidia Tendera
exaly +4 more sources
A resolution decision procedure for the guarded fragment
Lecture Notes in Computer Science, 1998 We give a resolution based decision procedure for the guarded fragment of [ANB96]. The relevance of the guarded fragment lies in the fact that many modal logics can be translated into it. In this way the guarded fragment acts as a framework explaining the nice properties of these modal logics.
Hans De Nivelle
exaly +3 more sources
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment [PDF]
2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010 We construct finite groups whose Cayley graphs have large girth even with respect to a discounted distance measure that contracts arbitrarily long sequences of edges from the same color class (subgroup), and only counts transitions between color classes (cosets).
exaly +2 more sources
Comonadic semantics for guarded fragments [PDF]
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021 In previous work, Abramsky, Dawar and Wang (LiCS 2017) and Abramsky and Shah (CSL 2018) have shown how a range of model comparison games which play a central role in finite model theory, including Ehrenfeucht-Fraisse, pebbling, and bisimulation games, can be captured in terms of resource-indexed comonads on the category of relational structures ...
Samson Abramsky, Dan Marsden
openaire +2 more sources