Sciweavers

3353 search results - page 51 / 671
» Laver and set theory
Sort
View
FSTTCS
2004
Springer
15 years 3 months ago
Join Algorithms for the Theory of Uninterpreted Functions
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
Sumit Gulwani, Ashish Tiwari, George C. Necula
ISIPTA
1999
IEEE
117views Mathematics» more  ISIPTA 1999»
15 years 2 months ago
Towards a Unified Theory of Imprecise Probability
Belief functions, possibility measures and Choquet capacities of order 2, which are special kinds of coherent upper or lower probability, are amongst the most popular mathematical...
Peter Walley
EUSFLAT
2007
133views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
Interior-Based Topology in Fuzzy Class Theory
Fuzzy topology based on interior operators is studied in the fully graded framework of Fuzzy Class Theory. Its relation to graded notions of fuzzy topology given by open sets and ...
Libor Behounek, Tomás Kroupa
IJCAI
1993
14 years 11 months ago
Generalization of the Dempster-Shafer Theory
The Dempster-Shafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets...
J. W. Guan, David A. Bell
ADC
2003
Springer
128views Database» more  ADC 2003»
15 years 3 months ago
An algorithm for the induction of defeasible logic theories from databases
Defeasible logic is a non-monotonic logic with applications in rule-based domains such as law. To ease the development and improve the accuracy of expert systems based on defeasib...
Benjamin Johnston, Guido Governatori