1943 search results - page 45 / 389 » Ordering Default Theories |
108
click to vote
CSL
2006
Springer
15 years 3 months ago
2006
Springer
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
ENTCS
2007
14 years 11 months ago
2007
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
— Various methods to recognize assembly tasks using possible local displacement of objects have been proposed. To calculate this displacement, the screw theory is employed. It is...
CIE
2007
Springer
15 years 6 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...