AI
2010
Springer
13 years 7 months ago
2010
Springer
The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoreti...
AI
2010
Springer
13 years 7 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
AI
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided...
AI
2008
Springer
13 years 7 months ago
2008
Springer
AI
2008
Springer
13 years 7 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Classical work on eliciting and representing preferences over multi-attribute alternatives has attempted to recognize conditions under which value functions take on particularly s...
AI
2010
Springer
13 years 7 months ago
2010
Springer
There are relatively few proposals for inconsistency measures for propositional belief bases. However inconsistency measures are potentially as important as information measures f...
AI
2008
Springer
13 years 7 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
AI
2010
Springer
13 years 7 months ago
2010
Springer
Today's computer-human interfaces are typically designed with the assumption that they are going to be used by an able-bodied person, who is using a typical set of input and ...
AI
2010
Springer
13 years 7 months ago
2010
Springer
