Sciweavers

1437 search results - page 114 / 288
» Generalized Belief Propagation
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 6 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen
ICTAI
2005
IEEE
16 years 1 days ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
SIGMOD
2005
ACM
123views Database» more  SIGMOD 2005»
16 years 1 hour ago
To Do or Not To Do: The Dilemma of Disclosing Anonymized Data
Decision makers of companies often face the dilemma of whether to release data for knowledge discovery, vis a vis the risk of disclosing proprietary or sensitive information. Whil...
Laks V. S. Lakshmanan, Raymond T. Ng, Ganesh Rames...
ATAL
2005
Springer
15 years 8 months ago
A formal framework for agent interaction semantics
Although informative, the semantic definition proposed for the most standard agent communication language (FIPA ACL 1997) is complicated and contentious, while published interact...
Shamimabi Paurobally, Jim Cunningham, Nicholas R. ...
AMAI
2008
Springer
15 years 6 months ago
Justification logics, logics of knowledge, and conservativity
Several justification logics have been created, starting with the logic LP, [1]. These can be thought of as explicit versions of modal logics, or of logics of knowledge or belief,...
Melvin Fitting