2303 search results - page 342 / 461 » On the logic of argumentation theory |
148
click to vote
LPNMR
1990
Springer
15 years 10 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
199
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
154
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
149
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
236
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...