Sciweavers

479 search results - page 70 / 96
» A quantified logic of evidence
Sort
View
ECSQARU
2009
Springer
14 years 11 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova
POPL
2004
ACM
16 years 2 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
FPCA
1989
15 years 6 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
156
Voted
AMSTERDAM
2009
14 years 11 months ago
There Is Something about Might
In this paper we present an alternative interpretation of statements of epistemic possibility, which does not induce a consistency test on a common ground, as in (Veltman 1996), bu...
Paul Dekker
96
Voted
ICPR
2008
IEEE
16 years 3 months ago
Incremental machine learning techniques for document layout understanding
In real-world Digital Libraries, Artificial Intelligence techniques are essential for tackling the automatic document processing task with sufficient flexibility. The great variab...
Floriana Esposito, Marenglen Biba, Stefano Ferilli...