84
Voted
AI
2010
Springer
15 years 17 days ago
2010
Springer
101
click to vote
AI
2010
Springer
15 years 17 days ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
115
Voted
AI
2008
Springer
15 years 17 days ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
121
Voted
AI
2010
Springer
15 years 17 days ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
67
Voted
AI
2008
Springer
15 years 17 days ago
2008
Springer
108
Voted
AI
2008
Springer
15 years 17 days ago
2008
Springer
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
AI
2008
Springer
15 years 17 days ago
2008
Springer
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
98
Voted
AI
2010
Springer
15 years 17 days ago
2010
Springer
Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a ne...
AI
2010
Springer
15 years 17 days ago
2010
Springer
99
Voted
AI
2010
Springer
15 years 17 days ago
2010
Springer
We develop a new automated reasoning technique for the situation calculus that can handle a class of queries containing universal quantication over situation terms. Although such ...