Sciweavers

160 search results - page 13 / 32
» Rough Sets for Uncertainty Reasoning
Sort
View
TIME
1994
IEEE
15 years 1 months ago
Localized Temporal Reasoning: A State-Based Approach
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...
Shieu-Hong Lin, Thomas Dean
ECSQARU
2005
Springer
15 years 3 months ago
A Possibilistic Inconsistency Handling in Answer Set Programming
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
14 years 9 months ago
Computations of probabilistic output admissible set for uncertain constrained systems
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...
Takeshi Hatanaka, Kiyotsugu Takaba
122
Voted
TPLP
2010
135views more  TPLP 2010»
14 years 8 months ago
Formalization of psychological knowledge in answer set programming and its application
In this paper we explore the use of Answer Set Programming (ASP) to formalize, and reason about, psychological knowledge. In the field of psychology, a considerable amount of kno...
Marcello Balduccini, Sara Girotto
ECSQARU
2005
Springer
15 years 3 months ago
Conditional Deduction Under Uncertainty
Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical e...
Audun Jøsang, Simon Pope, Milan Daniel