634 search results - page 3 / 127 » Completion Procedures as Semidecision Procedures |
AIPS
1994
13 years 7 months ago
1994
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presente...
TPHOL
2003
IEEE
13 years 11 months ago
2003
IEEE
FASE
2011
Springer
12 years 9 months ago
2011
Springer
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
RTA
2001
Springer
13 years 10 months ago
2001
Springer
The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially. In this paper, we introduce beta reduction constraints to describe beta r...
CADE
2006
Springer
14 years 6 months ago
2006
Springer
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...