181 search results - page 18 / 37 » On Quantification with A Finite Universe |
POPL
2004
ACM
14 years 8 months ago
2004
ACM
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
IDEAS
2000
IEEE
14 years 5 days ago
2000
IEEE
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...
AGP
1999
IEEE
14 years 3 days ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
AGI
2008
13 years 9 months ago
2008
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...