Results 141 to 150 of about 180 (170)

The guarded fragment: Ins and outs

, 1999
Areces, C.E., Monz, C., de Nivelle, J.M.G.G., de Rijke, M.   +3 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Guarded Fragment for Abstract State Machines

Journal of Logic, Language and Information, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +2 more sources

Guarded Fragments with Constants

Journal of Logic, Language and Information, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FRANCESCHET, Massimo, B. TEN CATE
openaire   +4 more sources

Interpolation and Definability in Guarded Fragments

Studia Logica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eva Hoogland, Maarten Marx
openaire   +1 more source

On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards

2007
The guarded fragment of first-order logic, GF, enjoys the finite model property, so the satisfiability and the finite satisfiability problems coincide. We are concerned with two extensions of the two-variable guarded fragment that do not possess the finite model property, namely, GF2 with equivalence and GF2 with transitive guards.
Emanuel Kieronski, Lidia Tendera
openaire   +1 more source

On the decision problem for the guarded fragment with transitivity

Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 2002
The guarded fragment with transitive guards, [GF+TG], is an extension of GF in which certain relations are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable.
Wieslaw Szwast, Lidia Tendera
openaire   +1 more source

Combining Theories: The Ackerman and Guarded Fragments

2011
Combination of decision procedures is at the heart of Satisfiability Modulo Theories (SMT) solvers. It provides ways to compose decision procedures for expressive languages which mix symbols from various decidable theories. Typical combinations include (linear) arithmetic, uninterpreted symbols, arrays operators, etc. In a previous paper we showed that
Carlos Areces, Pascal Fontaine
openaire   +2 more sources

The two-variable guarded fragment with transitive relations

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 2003
We consider the restriction of the guarded fragment to the two-variable case where, in addition, binary relations may be specified as transitive. We show that (i) this very restricted form of the guarded fragment without equality is undecidable and that (ii) when allowing non-unary relations to occur only in guards, the logic becomes decidable.
Ganzinger, H., Meyer, C., Veanes, M.
openaire   +2 more sources

A superposition decision procedure for the guarded fragment with equality

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 2003
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in practice than methods based on the enumeration of certain finite structures.
Ganzinger, H., de Nivelle, H.
openaire   +2 more sources

A Tableau Algorithm for the Clique Guarded Fragment

2000
Aus der Einleitung: „The Guarded Fragment of first-order logic, introduced by Andréka, van Benthem, and Németi, has been a succesful attempt to transfer many good properties of modal, temporal, and description logics to a larger fragment of predicate logic. Among these are decidability, the finite modal property, invariance under an appropriate variant
Colin Hirsch, Stephan Tobies
openaire   +1 more source