107 search results - page 2 / 22 » Planning and Patching Proof |
ICDAR
2011
IEEE
12 years 4 months ago
2011
IEEE
Abstract—Segmentation of architectural floorplans is a challenging task, mainly because of the large variability in the notation between different plans. In general, traditional...
AIPS
2004
13 years 6 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
ECAI
2000
Springer
13 years 9 months ago
2000
Springer
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
AIPS
2006
13 years 6 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
JAR
1998
13 years 4 months ago
1998
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...