137 search results - page 6 / 28 » Conditional independence in propositional logic |
IJCAI
2001
13 years 9 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
IJCAI
1989
13 years 8 months ago
1989
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
AAAI
1996
13 years 9 months ago
1996
First-order probabilistic logic is a powerful knowledge representation language. Unfortunately, deductive reasoning based on the standard semantics for this logic does not support...
AUSAI
2007
Springer
13 years 11 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
DAGSTUHL
2007
13 years 9 months ago
2007
The concept of relevance between classical propositional formulae, defined in terms of letter-sharing, has been around for a very long time. But it began to take on a fresh life i...