Sciweavers

87 search results - page 12 / 18
» On Constructing Semantic Decision Tables
Sort
View
CAD
2005
Springer
13 years 7 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
FOSSACS
2005
Springer
14 years 26 days ago
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
Andrzej S. Murawski, Igor Walukiewicz
TABLEAUX
2009
Springer
14 years 1 months ago
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau i...
Renate A. Schmidt, Dmitry Tishkovsky
AAAI
2007
13 years 9 months ago
L2R: A Logical Method for Reference Reconciliation
The reference reconciliation problem consists in deciding whether different identifiers refer to the same data, i.e., correspond to the same world entity. The L2R system exploits...
Fatiha Saïs, Nathalie Pernelle, Marie-Christi...
ICFP
2007
ACM
14 years 7 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson