4224 search results - page 84 / 845 » Reasoning about Choice |
141
click to vote
FLOPS
2008
Springer
15 years 6 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
175
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
131
click to vote
ICLP
1998
Springer
15 years 9 months ago
1998
Springer
Implementing a compiler for a language with nondeterministic features is known to be a difficult task. This paper presents two new functions setChoicePoint and fail that extend th...
137
click to vote
ARGMAS
2005
Springer
15 years 11 months ago
2005
Springer
One form of argument-based negotiation is when agents argue about why an offer was rejected. If an agent can state a reason for a rejection of an offer, the negotiation process m...
168
Voted
CSL
2007
Springer
15 years 9 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...