4617 search results - page 243 / 924 » Automation of Diagrammatic Reasoning |
164
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
158
click to vote
IJCAI
1997
15 years 7 months ago
1997
A method is presented for analogical reasoning in Automated Deduction. We focus on the abductive aspects of analogy and give a unified treatment for theorems and non-theorems. Abd...
158
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
169
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given)...
156
click to vote
KBSE
2008
IEEE
16 years 27 days ago
2008
IEEE
Developers undertaking a pragmatic reuse task must collect and reason about information that is spread throughout the source code of a system before they can understand the scope ...