Sciweavers

532 search results - page 27 / 107
» The Logic of Quasi-MV Algebras
Sort
View
IFIP
2009
Springer
14 years 2 months ago
An Algebra for Trust Dilution and Trust Fusion
Trust dilution and trust fusion are two operators that are used to calculate transitive trust in a trust network. Various implementations of these operators already exist but are n...
Baptiste Alcalde, Sjouke Mauw
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
14 years 1 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
UAI
1989
13 years 11 months ago
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
Yang Xiang, Michael P. Beddoes, David Poole
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 1 months ago
Intensionality and Two-steps Interpretations
In this paper we considered the extension of the First-order Logic Bealer’s intensional abstraction operator. Contemporary use of the term ’intension’ derives from the tradit...
Zoran Majkic
CIE
2005
Springer
14 years 3 months ago
Kripke Models, Distributive Lattices, and Medvedev Degrees
We define a variant of the standard Kripke semantics for intuitionistic logic, motivated by the connection between constructive logic and the Medvedev lattice. We show that while...
Sebastiaan Terwijn