Sciweavers

5 search results - page 1 / 1
» Tree Languages Defined in First-Order Logic with One Quantif...
Sort
View
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 4 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin
CP
2000
Springer
13 years 8 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
DATESO
2004
100views Database» more  DATESO 2004»
13 years 6 months ago
Storage and Retrieval of First Order Logic Terms in a Database
In this paper we present a storage method for sets of first order logic terms in a relational database using function symbols based indexing method of Discrimination trees. This is...
Peter Gurský
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 5 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
APAL
2002
101views more  APAL 2002»
13 years 4 months ago
The logic of tasks
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
Giorgi Japaridze