8699 search results - page 301 / 1740 » Elements of the Theory of Computation |
233
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
171
click to vote
AAAI
1994
15 years 8 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
171
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
We present an algebraic treatment of exception handlers and, more generally, introduce handlers for other computational effects representable by an algebraic theory. These include ...
193
click to vote
ATAL
2003
Springer
15 years 10 months ago
2003
Springer
What distinguishes e-commerce from ordinary commerce? What distinguishes it from distributed computation? In this paper we propose a performative theory of e-commerce, drawing on ...
180
click to vote
INFOCOM
2003
IEEE
16 years 6 hour ago
2003
IEEE
— This paper analyzes a communication network with heterogeneous customers. We investigate priority queueing as a way to differentiate between these users. Customers join the net...