CONCUR
2012
Springer
12 years 2 months ago
2012
Springer
We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a relevant feature: the dynamic creation of names...
AMW
2011
13 years 4 months ago
2011
Subqueries are a poweful feature which allows to enforce reuse, composition, rewriting and optimization in a query language. In this paper we perform a comprehensive study of the i...
NDJFL
2010
13 years 7 months ago
2010
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
MST
2011
13 years 7 months ago
2011
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
LICS
2010
IEEE
13 years 11 months ago
2010
IEEE
A synchronization is a mechanism allowing two or more processes to perform actions at the same time. We study the expressive power of synchronizations gathering more and more proc...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
CI
2000
14 years 10 days ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
APAL
2004
14 years 11 days ago
2004
We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have t...
IANDC
2007
14 years 13 days ago
2007
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
JOLLI
2006
14 years 14 days ago
2006
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...