Sciweavers

2649 search results - page 266 / 530
» Temporal Theories of Reasoning
Sort
View
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
CSL
2010
Springer
13 years 10 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
IJAR
2008
90views more  IJAR 2008»
13 years 9 months ago
The Dempster-Shafer calculus for statisticians
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...
Arthur P. Dempster
CSL
2002
Springer
13 years 9 months ago
A conversation acts model for generating spoken dialogue contributions
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...
Amanda Stent
JOLLI
2002
92views more  JOLLI 2002»
13 years 9 months ago
A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages
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...
Ani Nenkova