Sciweavers

129 search results - page 3 / 26
» Compiling Possibilistic Knowledge Bases
Sort
View
ICDT
2011
ACM
242views Database» more  ICDT 2011»
12 years 9 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
KR
2004
Springer
13 years 11 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
AAAI
2007
13 years 8 months ago
A Model-based Approach for Merging Prioritized Knowledge Bases in Possibilistic Logic
This paper presents a new approach for merging prioritized knowledge bases in possibilistic logic. Our approach is semantically defined by a model-based merging operator in propo...
Guilin Qi
FSS
2010
102views more  FSS 2010»
13 years 2 months ago
Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic
In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of co...
Guilin Qi, Weiru Liu, David A. Bell
ECSQARU
2005
Springer
13 years 11 months 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