283 search results - page 50 / 57 » Solving Over-Constrained Problems with SAT |
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
IJISEC
2008
13 years 9 months ago
2008
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
ICCBR
2009
Springer
13 years 7 months ago
2009
Springer
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
CP
2007
Springer
14 years 3 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
AIPS
2009
13 years 10 months ago
2009
Temporally expressive planning, an important class of temporal planning, has attracted much attention lately. Temporally expressive planning is difficult; few existing planners ca...