Sciweavers

TACAS
2000
Springer
87views Algorithms» more  TACAS 2000»
15 years 7 months ago
Symbolic Reachability Analysis Based on SAT-Solvers
Parosh Aziz Abdulla, Per Bjesse, Niklas Eén
TABLEAUX
2000
Springer
15 years 7 months ago
Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison
The aim of the TABLEAUX-2000 Non-Classical (Modal) System Comparisons (TANCS-2000) is to provide a set of benchmarks and a standardized methodology for the assessment and compariso...
Fabio Massacci, Francesco M. Donini
COMPGEOM
1995
ACM
15 years 7 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
TABLEAUX
2000
Springer
15 years 7 months ago
Matrix-Based Inductive Theorem Proving
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...
Christoph Kreitz, Brigitte Pientka
TABLEAUX
2000
Springer
15 years 7 months ago
Consistency Testing: The RACE Experience
Abstract. This paper presents the results of applying RACE, a description logic system for ALCNHR+ , to modal logic SAT problems. Some aspects of the RACE architecture are discusse...
Volker Haarslev, Ralf Möller