An Existential Locality Theorem

15 years 10 months ago

Download www2.informatik.hu-berlin.de

We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential ﬁrst-order sentences in ﬁnite structures.

Martin Grohe, Stefan Wöhrle

Real-time Traffic

Automated Reasoning | CSL 2001 | Existential Version | Existential ﬁrst-order Sentences | Gaifman’s Locality Theorem |

claim paper

Related Content

» Model Theory Makes Formulas Large

» Satisfaction of existential theories in finitely presented groups and some embedding theor...

» Incremental Algorithms for Local Search from Existential SecondOrder Logic

» How to Universally Close the Existential Rule

» Combined Decision Techniques for the Existential Theory of the Reals

» The eskolemization of universal quantifiers

» A GameTheoretic Approach to Constraint Satisfaction

» Syntax vs Semantics on Finite Structures

» On Preservation under Homomorphisms and Unions of Conjunctive Queries

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CSL
Authors	Martin Grohe, Stefan Wöhrle

Comments (0)

Sciweavers

An Existential Locality Theorem

Automated Reasoning | CSL 2001 | Existential Version | Existential ﬁrst-order Sentences | Gaifman’s Locality Theorem |

Explore & Download

Productivity Tools

Sciweavers