19 search results - page 1 / 4 » A Non-Deterministic Semantics for Tractable Inference |
AAAI
1998
13 years 6 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
AAAI
1997
13 years 6 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
SP
2000
IEEE
13 years 9 months ago
2000
IEEE
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In pa...