Sciweavers

967 search results - page 21 / 194
» Probabilistic Predicative Programming
Sort
View
92
Voted
AAAI
2000
15 years 1 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto
FLOPS
1999
Springer
15 years 4 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
83
Voted
DCG
1998
59views more  DCG 1998»
14 years 11 months ago
A Probabilistic Analysis of the Power of Arithmetic Filters
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...
Olivier Devillers, Franco P. Preparata
80
Voted
ACTA
2004
86views more  ACTA 2004»
14 years 11 months ago
Specification transformers: a predicate transformer approach to composition
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
Michel Charpentier, K. Mani Chandy
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
15 years 11 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...