896 search results - page 77 / 180 » On completeness of word reversing |
132
Voted
CASC
2009
Springer
15 years 1 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
76
Voted
CONCUR
2010
Springer
15 years 1 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
100
click to vote
APAL
2008
15 years 28 days ago
2008
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...
112
Voted
DM
2010
15 years 26 days ago
2010
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
80
Voted
ENTCS
2008
15 years 26 days ago
2008
Although programs convey an unambiguous meaning, the grammars used in practice to describe their syntax are often ambiguous, and completed with disambiguation rules. Whether these...