4617 search results - page 318 / 924 » Automation of Diagrammatic Reasoning |
145
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
158
click to vote
LOPSTR
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present an approach to a coherent program synthesis system which integrates a variety of interactively controlled and automated techniques from theorem proving and alg...
148
click to vote
CADE
1990
Springer
15 years 10 months ago
1990
Springer
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today's automated theorem pro...
177
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this PhD project, we deal with the issue of code duplication in logic programs. In particular semantical duplication or redundancy is generally viewed as a possible se...
200
click to vote
ESSLLI
2009
Springer
15 years 4 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...