Sciweavers

15 search results - page 1 / 3
» Complexity and Cautiousness Results for Reasoning from Parti...
Sort
View
ECSQARU
2009
Springer
14 years 1 months ago
Complexity and Cautiousness Results for Reasoning from Partially Preordered Belief Bases
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
Salem Benferhat, Safa Yahi
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 6 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
DALT
2005
Springer
14 years 3 days ago
Agent-Oriented Programming with Underlying Ontological Reasoning
Developing applications that make effective use of machine-readable knowledge sources as promised by the Semantic Web vision is attracting much of current research interest; this v...
Álvaro F. Moreira, Renata Vieira, Rafael H....
UAI
2004
13 years 8 months ago
Region-Based Incremental Pruning for POMDPs
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...
Zhengzhu Feng, Shlomo Zilberstein
ECSQARU
2005
Springer
14 years 3 days ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell