Sciweavers

75 search results - page 1 / 15
» A Correctness Result for Reasoning about One-Dimensional Pla...
Sort
View
KR
2010
Springer
13 years 11 months ago
A Correctness Result for Reasoning about One-Dimensional Planning Problems
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
Yuxiao Hu, Hector J. Levesque
AAAI
2011
12 years 6 months ago
Termination and Correctness Analysis of Cyclic Control
The utility of including cyclic flow of control in plans has been long recognized by the planning community. Loops in a plan increase both its applicability and the compactness o...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
14 years 7 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
KR
1992
Springer
13 years 10 months ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden
ECAI
2000
Springer
13 years 10 months ago
A Framework for Dynamic Constraint Reasoning using Procedural Constraints
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
Ari K. Jónsson, Jeremy Frank