3775 search results - page 77 / 755 » The Expression Problem Revisited |
FUIN
2006
15 years 3 months ago
2006
Logics for expressing properties of Petri hypernets, a visual formalism for modelling mobile agents, are proposed. Two classes of properties are of interest--the temporal evolution...
131
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
123
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
151
click to vote
ACL
1990
15 years 4 months ago
1990
In contrast to the "designer logic" approach, this paper shows how the attribute-value feature structures of unification grammar and constraints on them can be axiomatiz...
108
click to vote
JACM
2007
15 years 3 months ago
2007
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of reg...