49 search results - page 1 / 10 » Associative-Commutative Deducibility Constraints |
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
ASIAN
2009
Springer
13 years 6 months ago
2009
Springer
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
CASC
2007
Springer
13 years 11 months ago
2007
Springer
BIRTHDAY
2007
Springer
13 years 11 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
LCC
1994
13 years 9 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...