27 search results - page 3 / 6 » Handling Polymorphism in Automated Deduction |
CSL
2010
Springer
15 years 12 days ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
JELIA
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
102
click to vote
ENTCS
2006
14 years 11 months ago
2006
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
ICSE
2004
IEEE-ACM
2004
IEEE-ACM
Automated Support for Development, Maintenance, and Testing in the Presence of Implicit Control Flow
15 years 11 months ago
Although object-oriented languages can improve programming practices, their characteristics may introduce new problems for software engineers. One important problem is the presenc...
106
click to vote
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...