Sciweavers

1051 search results - page 180 / 211
» Foundations of Constraint Satisfaction
Sort
View
AAMAS
1999
Springer
13 years 9 months ago
Verifying Compliance with Commitment Protocols
Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open sys...
Mahadevan Venkatraman, Munindar P. Singh
SCP
1998
107views more  SCP 1998»
13 years 9 months ago
A Distributed Arc-Consistency Algorithm
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
T. Nguyen, Yves Deville
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 9 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
IGPL
2010
109views more  IGPL 2010»
13 years 8 months ago
Deductive coherence and norm adoption
This paper is a contribution to the formalisation of Thagard’s coherence theory. The term coherence is defined as the quality or the state of cohering, especially a logical, ord...
Sindhu Joseph, Carles Sierra, W. Marco Schorlemmer...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 months ago
The Dichotomy of List Homomorphisms for Digraphs
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
Pavol Hell, Arash Rafiey