5086 search results - page 416 / 1018 » The Power of Comparative Reasoning |
178
click to vote
CADE
1998
Springer
15 years 11 months ago
1998
Springer
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
213
click to vote
PEPM
2010
ACM
15 years 8 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
198
click to vote
CSL
2010
Springer
15 years 8 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
204
click to vote
CSL
2010
Springer
15 years 8 months 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...
226
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...