193 search results - page 19 / 39 » Automated Reasoning in Kleene Algebra |
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when soluti...
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
113
click to vote
LICS
1994
IEEE
15 years 3 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
CSL
2010
Springer
15 years 27 days ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
108
click to vote
CSL
2005
Springer
15 years 5 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...