Sciweavers

884 search results - page 73 / 177
» A Proof Theory for DL-Lite
Sort
View
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
16 years 3 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
CACM
2002
69views more  CACM 2002»
15 years 6 months ago
Software engineering considered harmful
ion, reviews, rigorous procedures, regression testing, metrics, and so forth) have been helpful, but we are still dealing with an intrinsically unsatisfactory situation. Especially...
Dennis de Champeaux
CADE
2001
Springer
16 years 6 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
16 years 1 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar
LICS
2008
IEEE
16 years 17 days ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann