44 search results - page 8 / 9 » A Clausal Approach to Proof Analysis in Second-Order Logic |
LOPSTR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
CADE
2007
Springer
14 years 6 months ago
2007
Springer
We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies...
ENTCS
2007
13 years 5 months ago
2007
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
JELIA
1990
Springer
13 years 9 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
CORR
2000
Springer
13 years 5 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...