284 search results - page 5 / 57 » Modularity of Completeness Revisited |
ICFP
2009
ACM
14 years 10 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
CADE
2004
Springer
14 years 3 months ago
2004
Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
EUROCRYPT
2004
Springer
14 years 3 months ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
SGAI
2010
Springer
13 years 7 months ago
2010
Springer
The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree s...
AIML
2004
13 years 11 months ago
2004
In this paper we give the notion of modularity of a theory and analyze some of its properties, especially for the case of action theories in reasoning about actions. We propose alg...