Sciweavers

1653 search results - page 208 / 331
» Computer science and game theory
Sort
View
RTA
2005
Springer
15 years 4 months ago
Open. Closed. Open
Abstract. As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewrit...
Nachum Dershowitz
79
Voted
GG
2004
Springer
15 years 4 months ago
Representing First-Order Logic Using Graphs
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
Arend Rensink
RTA
2004
Springer
15 years 4 months ago
TORPA: Termination of Rewriting Proved Automatically
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...
Hans Zantema
83
Voted
WIA
2004
Springer
15 years 4 months ago
Testability of Oracle Automata
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, ...
Gaoyan Xie, Cheng Li, Zhe Dang
96
Voted
STACS
2001
Springer
15 years 3 months ago
Semantical Principles in the Modal Logic of Coalgebras
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...
Dirk Pattinson