Sciweavers

2911 search results - page 152 / 583
» A Theory of Expressiveness in Mechanisms
Sort
View
ICLP
1994
Springer
15 years 10 months ago
Entailment of Finite Domain Constraints
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
Björn Carlson, Mats Carlsson, Daniel Diaz
LFP
1990
96views more  LFP 1990»
15 years 7 months ago
Comprehending Monads
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...
Philip Wadler
ENTCS
2006
105views more  ENTCS 2006»
15 years 6 months ago
A Game Semantics for Proof Search: Preliminary Results
We describe an ongoing project in which we attempt to describe a neutral approach to proof and refutation. In particular, we present a language of neutral expressions which contai...
Dale Miller, Alexis Saurin
ATAL
2005
Springer
15 years 12 months ago
On possibilistic case-based reasoning for selecting partners for multi-attribute agent negotiation
We propose an enhanced mechanism for selecting partners for multi-attribute negotiation. The mechanism employs possibilistic case-based reasoning. The possibility of successful ne...
Jakub Brzostowski, Ryszard Kowalczyk
HICSS
2002
IEEE
95views Biometrics» more  HICSS 2002»
15 years 11 months ago
Simulation Spectrum and Stability Models
In this paper, we define a continuum of modeling styles, ranging from collections of very simple agents on one end to collections of very complex agents at the other end, and a s...
Christopher Landauer