1224 search results - page 25 / 245 » Theory decision by decomposition |
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
FROCOS
2007
Springer
14 years 4 months ago
2007
Springer
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
AAAI
2006
13 years 11 months ago
2006
Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...
FROCOS
2000
Springer
14 years 1 months ago
2000
Springer
In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension ...
CHI
2011
ACM
13 years 1 months ago
2011
ACM
In this paper we investigate how people use online rating information to inform decision making. We examine whether a theory of searching for information to discriminate between a...