Sciweavers

137 search results - page 11 / 28
» Conditional independence in propositional logic
Sort
View
FROCOS
2007
Springer
14 years 1 months ago
Noetherianity and Combination Problems
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
ISIPTA
2003
IEEE
14 years 29 days ago
Combining Belief Functions Issued from Dependent Sources
Dempster’s rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speci...
Marco E. G. V. Cattaneo
AAAI
2007
13 years 10 months ago
Asymptotically Optimal Encodings of Conformant Planning in QBF
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
Jussi Rintanen
AAAI
2006
13 years 9 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir
AI
1999
Springer
13 years 7 months ago
Modal Logics, Description Logics and Arithmetic Reasoning
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
Hans Jürgen Ohlbach, Jana Koehler