127 search results - page 8 / 26 » Algebraic Characterization of Logically Defined Tree Languag... |
SEMWEB
2009
Springer
14 years 2 days ago
2009
Springer
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
JOLLI
2002
13 years 7 months ago
2002
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
LOGCOM
2010
13 years 2 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
ENTCS
2010
13 years 7 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...