5086 search results - page 335 / 1018 » The Power of Comparative Reasoning |
216
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
158
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
166
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
184
click to vote
TPHOL
2009
IEEE
16 years 1 months ago
2009
IEEE
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, givi...
269
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...