Sciweavers

1378 search results - page 3 / 276
» The Tractability of Global Constraints
Sort
View
AIPS
2006
13 years 8 months ago
On Some Tractable Cases of Logical Filtering
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
T. K. Satish Kumar, Stuart J. Russell
AI
2008
Springer
13 years 7 months ago
Properties of tree convex constraints
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
Yuanlin Zhang, Eugene C. Freuder
AAAI
2000
13 years 8 months ago
A Game-Theoretic Approach to Constraint Satisfaction
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
Phokion G. Kolaitis, Moshe Y. Vardi
CP
2000
Springer
13 years 11 months ago
Automatic Generation of Propagation Rules for Finite Domains
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
Slim Abdennadher, Christophe Rigotti