Probabilistic logic with independence

International Journal of Approximate Reasoning

Volumn 49, Issue 1, 2008, Pages 3-17

  Cozman, Fabio Gagliardi ^a   de Campos, Cassio Polpo ^a   Ferreira da Rocha, José Carlos ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b STATE UNIVERSITY OF PONTA GROSSA   (Brazil)

Author keywords

Graph theoretic models; Linear and multilinear programming; Probabilistic logic; Sets of probability distributions

Indexed keywords

BAYESIAN NETWORKS; CHLORINE COMPOUNDS; INFERENCE ENGINES; PROBABILITY;

FIRST ORDERS; GRAPH-THEORETIC MODELS; LINEAR AND MULTILINEAR PROGRAMMING; PROBABILISTIC LOGIC; RELATIONAL BAYESIAN NETWORKS; SETS OF PROBABILITY DISTRIBUTIONS;

PROBABILISTIC LOGICS;

EID: 48849087790     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2007.08.002     Document Type: Article

References (73)

1. Andersen K.A., and Hooker J.N. Bayesian logic. Decision Support Systems 11 (1994) 191-210
2. Bacchus F. Representing and Reasoning with Probabilistic Knowledge: A Logical Approach (1990), MIT Press, Cambridge
3. Beigel R., Reingold N., and Spielman D. PP is closed under intersection. Journal of Computer and System Science 50 2 (1995) 191-2002
4. Boole G. The Laws of Thought (1958), Dover edition
5. Borchers B., Mitchell J., and Joy S. A branch-and-cut algorithm for MAX-SAT and weighted MAX-SAT. In: Du D., Gu J., and Pardalos P. (Eds). Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 35 (1997), AMS 519-536
6. M. Chavira and A. Darwiche. Compiling Bayesian networks with local structure, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence, 2005.
7. Coletti G., and Scozzafava R. Probabilistic Logic in a Coherent Setting. Trends in logic vol. 15 (2002), Kluwer, Dordrecht
8. Couso I., Moral S., and Walley P. A survey of concepts of independence for imprecise probabilities. Risk, Decision and Policy 5 (2000) 165-181
9. Cowell R.G., Dawid A.P., Lauritzen S.L., and Spiegelhalter D.J. Probabilistic Networks and Expert Systems (1999), Springer-Verlag, New York
10. Cozman F.G. Calculation of posterior bounds given convex sets of prior probability measures and likelihood functions. Journal of Computational and Graphical Statistics 8 4 (1999) 824-838
11. F.G. Cozman, Constructing sets of probability measures through Kuznetsov's independence condition, in: Proceedings of the Second International Symposium on Imprecise Probabilities and Their Applications, Ithaca, New York, 2001, pp. 104-111.
12. F.G. Cozman. Algorithms for conditioning on events of zero lower probability, in: International Florida Artificial Intelligence Research Society Conference, Pensacola, FL, 2002, pp. 248-252.
13. Cozman F.G. Graphical models for imprecise probabilities. International Journal of Approximate Reasoning 39 2-3 (2005) 167-184
14. F.G. Cozman, C.P. de Campos, J.C. Ferreira da Rocha, Probabilistic logic with strong independence, in: Brazilian Symposium on Artificial Intelligence, 2006
15. F.G. Cozman, T. Seidenfeld. Independence for full conditional measures, graphoids and Bayesian networks. Technical Report PMR, Escola Politécnica, Universidade de São Paulo, São Paulo, Brazil, 2007.
16. Cozman F.G., and Walley P. Graphoid properties of epistemic irrelevance and independence. Annals of Mathematics and Artificial Intelligence 45 (2005) 173-195
17. Crisma L. The notion of stochastic independence in the theory of coherent probability. Quaderni del Dipartimento di Matematica Applicata Bruno de Finetti 8/91 (1999)
18. Darwiche A. A logical notion of conditional independence: properties and application. Artificial Intelligence 97 1-2 (1997) 45-82
19. de Campos C.P., and Cozman F.G. Inference in credal networks using multilinear programming. In: Onaindia E., and Staab S. (Eds). Proceedings of the Second Starting AI Researchers' Symp. (STAIRS) (2004), IOS Press, Amsterdam, The Netherlands 50-61
20. C.P. de Campos, F.G. Cozman, Belief updating and learning in semi-qualitative probabilistic networks, in: F. Bacchus, T. Jaakkola, Conference on Uncertainty in Artificial Intelligence (UAI), Edinburgh, Scotland, 2005.
21. de Campos C.P., and Cozman F.G. Computing lower and upper expectations under epistemic independence. International Journal of Approximate Reasoning 44 3 (2007) 244-260
22. C.P. de Campos, F.G. Cozman, The inferential complexity of Bayesian and credal networks, in: International Joint Conference on Artificial Intelligence (IJCAI), Edinburgh, United Kingdom, 2005, pp. 1313-1318.
23. de Finetti B. Theory of Probability vols. 1-2 (1974), Wiley, New York
24. R. de S. Braz, E. Amir, D. Roth. MPE and partial inversion in lifted probabilistic variable elimination, in: National Conference on Artificial Intelligence (AAAI), 2006.
25. Dechter R. Bucket elimination: a unifying framework for reasoning. Artificial Intelligence 113 1-2 (1999) 41-85
26. R. Dechter, D. Larkin, Hybrid processing of beliefs and constraints, in: Conference on Uncertainty in Artificial Intelligence, 2001.
27. Dechter R., and Mateescu R. Mixtures of deterministic-probabilistic networks and their AND/OR search space. In: Chickering M., and Halpern J. (Eds). Conference on Uncertainty in Artificial Intelligence (2004), AUAI Press 120-129
28. Fortnow L., and Reingold N. PP is closed under truth-table reductions. Structure in Complexity Theory Conference (1991) 13-15
29. Georgakopoulos G., Kavvadias D., and Papadimitriou C.H. Probabilistic satisfiability. Journal of Complexity 4 (1988) 1-11
30. L. Getoor, N. Friedman, D. Koller, B. Taskar, Learning probabilistic models of relational structure, in: International Conference on Machine Learning, 2001. pp. 170-177.
31. Gilio A., and Scozzafava R. Conditional events in probability assessment and revision. IEEE Transactions on Systems, Man and Cybernetics 24 12 (1994) 1741-1746
32. Giugno R., and Lukasiewicz T. P-SHOQ(D): A probabilistic extension of SHOQ(D) for probabilistic ontologies in the semantic web. In: Flesca S., Greco S., Leone N., and Ianni G. (Eds). Proceedings of the 8th European Conf. on Logics in Artificial Intelligence (JELIA). Lecture Notes in Artificial Intelligence vol. 2424 (2002), Springer, Cosenza, Italy 86-97
33. Hailperin T. Best possible inequalities for the probability of a logical function of events. American Mathematical Monthly 72 (1965) 343-359
34. Halpern J.Y. Reasoning about Uncertainty (2003), MIT Press, Cambridge, MA
35. Hammond P.J. Elementary non-Archimedean representation of probability for decision theory and games. In: Humphreys P. (Ed). Patrick Suppes: Scientific Philosopher vol. 1 (1994), Kluwer, Dordrecht, The Netherlands 25-59
36. P. Hansen, B. Jaumard, Probabilistic satisfiability, Report G-96-31, Les Cahiers du GERAD, École Polytechique de Montréal, 1996.
37. P. Hansen, S. Perron, Merging the local and global approaches to probabilistic satisfiability, Report, Cahier du GERAD G-2004-48, 2004.
38. Holzer S. On coherence and conditional prevision. Bolletino Unione Matematica Italiana Serie VI 1 (1985) 441-460
39. Howson C., and Urbach P. Scientific Reasoning: the Bayesian Approach (1993), Open Court Publishing Company, Chicago, IL
40. Ide J.S., and Cozman F.G. IPE and L2U: Approximate algorithms for credal networks. Second Starting AI Researcher Symposium (STAIRS) (2004), IOS Press 118-127
41. M. Jaeger, Probabilistic reasoning in terminological logics, in: Principles of Knowledge Representation (KR), 1994, pp. 461-472.
42. Jaeger M. Relational Bayesian networks. In: Geiger D., and Shenoy P.P. (Eds). Conference on Uncertainty in Artificial Intelligence (1997), Morgan Kaufmann, San Francisco, CA 266-273
43. Jaeger M. Complex probabilistic modeling with recursive relational Bayesian networks. Annals of Mathematics and Artificial Intelligence 32 (2001) 179-220
44. Jovanović D., Mladenović N., and Ognjanović Z. Variable neighborhood search for the probabilistic satisfiability problem. Proceedings of the 6th Metaheuristics International Conference (MIC 2005) (2005), Vienna, Austria
45. L.V.S. Lakshmanan, F. Sadri, Probabilistic deductive databases, in: Symposium on Logic Programming, 1994, pp. 254-268.
46. D. Larkin, R. Dechter, Bayesian inference in the presence of determinism, in: AI and Statistics (AI-STAT), 2003.
47. T. Lukasiewicz, Probabilistic logic programming, in: European Conference on Artificial Intelligence, 1998, pp. 388-392.
48. Lukasiewicz T. Probabilistic logic programming with conditional constraints. ACM Transactions on Computational Logic 2 3 (2001) 289-339
49. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI), San Jose, CA, 1992, pp. 459-465
50. Moral S. Epistemic irrelevance on sets of desirable gambles. Annals of Mathematics and Artificial Intelligence 45 1-2 (2005) 197-214
51. Neapolitan R.E. Learning Bayesian Networks (2003), Prentice-Hall
52. Nerode A., and Shore R.A. Logic for Applications. 2nd ed. (1997), Springer-Verlag, New York
53. Ng R., and Subrahmanian V.S. Probabilistic logic programming. Information and Computation 101 2 (1992) 150-201
54. Ngo L., and Haddawy P. Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science 171 1-2 (1977) 147-177
55. Nilsson N.J. Probabilistic logic. Artificial Intelligence 28 (1986) 71-87
56. Ognjanović Z. Discrete linear-time probabilistic logics: completeness, decidability and complexity. Journal of Logic Computation 16 2 (2006) 257-285
57. Pearl J. Probabilistic Reasoningin Intelligent Systems: Networks of Plausible Inference (1988), Morgan Kaufmann, San Mateo, CA
58. Poole D. Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence 64 (1993) 81-129
59. D. Poole, First-order probabilistic inference, in: International Joint Conference on Artificial Intelligence (IJCAI), 2003, pp. 985-991.
60. Popper K.R. The logic of Scientific Discovery (1975), Hutchinson, London
61. Regazzini E. Finitely additive conditional probability. Rendiconti del Seminario Matematico e Fisico di Milano 55 (1985) 69-89
62. Renyi A. On a new axiomatic theory of probability. Acta Mathematics Acadamic Science Hungarian 6 (1955) 85-335
63. Richardson M., and Domingos P. Markov logic networks. Machine Learning 62 1-2 (2006) 107-136
64. Robertson N., and Seymour P.D. Graph minors - II. Algorithmic aspects of tree-width. Journal of Algorithms 7 (1986) 309-322
65. Robertson N., and Seymour P.D. Graph minors - I. Excluding a forest. Journal of Combinatorial Theory Series B 35 (1983) 39-61
66. Sherali H.D., and Adams W.P. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems (1999), Kluwer Academic Publishers
67. B. Vantaggi, Graphical models for conditional independence structures, in: Second International Symposium on Imprecise Probabilities and Their Applications, Shaker, 2001, pp. 332-341.
68. Vantaggi B. Graphical representation of asymmetric graphoid structures. Third International Symposium on Imprecise Probabilities and Their Applications (2003), Carleton Scientific 560-574
69. Vicig P. Epistemic independence for imprecise probabilities. International Journal of Approximate Reasoning 24 (2000) 235-250
70. Walley P. Statistical Reasoning with Imprecise Probabilities (1991), Chapman and Hall, London
71. Walley P., Pelessoni R., and Vicig P. Direct algorithms for checking consistency and making inferences from conditional probability assessments. Journal of Statistical Planning and Inference 126 1 (2004) 119-151
72. Zhang W. Transitions and backbones of 3-SAT and maximum 3-SAT. International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science vol. 2239 (2001), Springer 153-167
73. Zhang N.L., and Poole D. Exploiting causal independence in Bayesian network inference. Journal of Artificial Intelligence Research (1996) 301-328