68 search results - page 13 / 14 » Decision procedures for term algebras with integer constrain... |
166
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
202
click to vote
CADE
2005
Springer
16 years 6 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...
172
click to vote
LATA
2009
Springer
16 years 24 days ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
191
click to vote
TCBB
2008
15 years 5 months ago
2008
Abstract-- Many statistical measures and algorithmic techniques have been proposed for studying residue coupling in protein families. Generally speaking, two residue positions are ...
171
click to vote
AIPS
2008
15 years 8 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...