Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
23
click to vote
CSL
2001
Springer
favorite
Email
discuss
report
109
views
Automated Reasoning
»
more
CSL 2001
»
An Existential Locality Theorem
14 years 4 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 first-order sentences in finite structures.
Martin Grohe, Stefan Wöhrle
Real-time Traffic
Automated Reasoning
|
CSL 2001
|
Existential Version
|
Existential first-order Sentences
|
Gaifman’s Locality Theorem
|
claim paper
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)
Researcher Info
Automated Reasoning Study Group
Computer Vision