2911 search results - page 159 / 583 » A Theory of Expressiveness in Mechanisms |
144
click to vote
ENTCS
2006
15 years 6 months ago
2006
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...
141
click to vote
AROBOTS
2000
15 years 6 months ago
2000
In this paper, I describe a simple functional programming language, GRL, in which most of the characteristic features of the popular behavior-based robot architectures can be conc...
174
click to vote
GRAMMARS
2000
15 years 6 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
148
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
DinnerWare is an exploration of eating as a medium for computation and aesthetic expression. It consists of a dining service electronically equipped to react to the properties of ...
168
click to vote
TACAS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. A Craig interpolant for a mutually inconsistent pair of formulas (A, B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common ...