127 search results - page 6 / 26 » Algebraic Characterization of Logically Defined Tree Languag... |
AI
2008
Springer
13 years 7 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
JSYML
2000
13 years 7 months ago
2000
We investigate topological properties of subsets S of the real plane, expressed by first-order logic sentences in the language of the reals augmented with a binary relation symbol...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study neste...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
We give semantic characterizations of the expressive power of navigational XPath (also called Core XPath) in terms of first order logic. XPath can be used to specify sets of nodes...