1615 search results - page 149 / 323 » Computer science and decision theory |
118
Voted
RTA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
WIA
2004
Springer
15 years 6 months ago
2004
Springer
d abstract) Gaoyan Xie, Cheng Li, and Zhe Dang  School of Electrical Engineering and Computer Science Washington State University Pullman, WA 99164, USA Abstract. In this paper, ...
119
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
RTA
1993
Springer
15 years 4 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
106
Voted
ACSC
2000
IEEE
15 years 4 months ago
2000
IEEE
A methodology is proposed for the formal development of software systems from a user's requirements specification in natural language into a complete implementation, proceedi...