634 search results - page 6 / 127 » Completion Procedures as Semidecision Procedures |
LICS
2002
IEEE
14 years 8 days ago
2002
IEEE
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
MKM
2007
Springer
14 years 1 months ago
2007
Springer
We address the problem of automatic synthesis of decision procedures. Our synthesis mechanism consists of several stages and submechanisms and is well-suited to the proof-planning ...
CSCWD
2005
Springer
14 years 26 days ago
2005
Springer
It is a challenging issue to exchange procedural CAD models between heterogeneous CAD systems. In this paper, we extend the synchronized collaborative design environment among hete...
IEICET
2007
13 years 7 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...