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...
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
The Dempster-Shafer (DS) theory of probabilistic reasoning is presented in terms of a semantics whereby every meaningful formal assertion is associated with a triple (p, q, r) whe...
In this paper, we describe a generation system for spoken dialogue that not only produces coherent, informative and responsive dialogue contributions, but also explicitly models h...
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checkin...