233 search results - page 1 / 47 » An Existential Locality Theorem |
CSL
2001
Springer
13 years 9 months ago
2001
Springer
We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures....
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
APAL
2006
13 years 5 months ago
2006
Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...