Sciweavers

4987 search results - page 8 / 998
» Support Ordered Resolution
Sort
View
DAGSTUHL
2003
14 years 11 months ago
Data structures for 3D multi-tessellations: an overview
Abstract Multiresolution models support the interactive visualization of large volumetric data through selective refinement, an operation which permits to focus resolution only on...
Emanuele Danovaro, Leila De Floriani, Paola Magill...
DGO
2006
96views Education» more  DGO 2006»
14 years 11 months ago
A process-driven tool to support online dispute resolution
This demonstration shows a prototype tool that projects an impression of how execution of a formally defined process will facilitate dispute resolution. Tool flexibility supports ...
Lori A. Clarke, Alan Gaitenby, Daniel Gyllstrom, E...
CADE
2005
Springer
15 years 10 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
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...
Ting Zhang, Henny B. Sipma, Zohar Manna
IFIPTCS
2010
14 years 7 months ago
Polarized Resolution Modulo
We present a restriction of Resolution modulo where the rewrite rules are such that clauses rewrite to clauses, so that the reduct of a clause needs not be further transformed into...
Gilles Dowek
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 9 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen