4573 search results - page 720 / 915 » Automated Reasoning |
108
Voted
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a setting in which the search for a proof of B or a refutation of B (a proof of ¬B) can be carried out simultaneously: this is in contrast to the usual approach in aut...
131
Voted
TPHOL
2008
IEEE
15 years 10 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
147
Voted
CSL
2005
Springer
15 years 9 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
143
Voted
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
131
Voted
EWCBR
2004
Springer
15 years 9 months ago
2004
Springer
Textual CBR systems solve problems by reusing experiences that are in textual form. Knowledge-rich comparison of textual cases remains an important challenge for these systems. How...