Sciweavers

CADE
2008
Springer
15 years 9 months ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Martin Avanzini, Georg Moser, Andreas Schnabl
ICWE
2010
Springer
15 years 9 months ago
Designing Service Marts for Engineering Search Computing Applications
: The use of patterns in data management is not new: in data warehousing, data marts are simple conceptual schemas with exactly one core entity, describing facts, surrounded by mul...
Alessandro Campi, Stefano Ceri, Andrea Maesani, St...
203
Voted
CADE
2008
Springer
15 years 9 months ago
Canonical Inference for Implicational Systems
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries....
Maria Paola Bonacina, Nachum Dershowitz
CADE
2008
Springer
15 years 9 months ago
Canonicity!
Nachum Dershowitz
CADE
2008
Springer
15 years 9 months ago
Aligator: A Mathematica Package for Invariant Generation (System Description)
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
Laura Kovács