Sciweavers

1127 search results - page 84 / 226
» Theory Extension in ACL2(r)
Sort
View
109
Voted
LICS
2010
IEEE
14 years 11 months ago
Equality Is Typable in Semi-full Pure Type Systems
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
Vincent Siles, Hugo Herbelin
106
Voted
LPAR
2010
Springer
14 years 11 months ago
On Strong Normalization of the Calculus of Constructions with Type-Based Termination
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
Benjamin Grégoire, Jorge Luis Sacchini
109
Voted
DLOG
2010
14 years 10 months ago
Optimization Techniques for Fuzzy Description Logics
Sophisticated uncertainty representation and reasoning are necessary for the alignment and integration of Web data from different sources. For this purpose the extension of the Des...
Nikos Simou, Theofilos P. Mailis, Giorgos Stoilos,...
107
Voted
LPAR
2010
Springer
14 years 10 months ago
On the Equality of Probabilistic Terms
We consider a mild extension of universal algebra in which terms are built both from deterministic and probabilistic variables, and are interpreted as distributions. We formulate a...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
LPAR
2010
Springer
14 years 10 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...