178
click to vote
LPAR
15 years 10 months ago
2001 Springer 
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
172
click to vote
LPAR
15 years 10 months ago
2001 Springer 
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
137
click to vote
LPAR
15 years 10 months ago
2001 Springer
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
151
click to vote
LPAR
15 years 10 months ago
2001 Springer
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerab...
|
Automated Reasoning