An Existential Locality Theorem

An Existential Locality Theorem

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.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Grohe, Martin, Wöhrle, Stefan
Format: Buchkapitel
Sprache:eng
Schlagworte:
Algorithmic Application
Applied sciences
Computer science
control theory
systems
Conjunctive Query
Exact sciences and technology
Logical, boolean and switching functions
Pairwise Distance
Planar Graph
Relation Symbol
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/3-540-44802-0_8