4573 search results - page 418 / 915 » Automated Reasoning |
204
click to vote
LOPSTR
1998
Springer
15 years 11 months ago
1998
Springer
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...
174
click to vote
LOPSTR
1998
Springer
15 years 11 months ago
1998
Springer
This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedur...
150
click to vote
LOPSTR
1998
Springer
15 years 11 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
175
click to vote
PLILP
1998
Springer
15 years 11 months ago
1998
Springer
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
191
click to vote
PLILP
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...