1814 search results - page 27 / 363 » Extended First-Order Logic |
LICS
2000
IEEE
13 years 11 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
LATA
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
ICDT
2005
ACM
14 years 28 days ago
2005
ACM
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...