On the relationship between probabilistic logic and π-CMS

Authors:
P. Hansen;B. Jaumard;A. D. Parreira
Affiliations:
GERAD and Dept. Methodes Quantitatives de Gestion, Ecole des Hautes Etudes Commercials;GERAD and Dept. Math., and Ind. Eng., Ecole Polytechnique de Montreal;Dept. Math., and Ind. Eng., Ecole Polytechnique de Montreal
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Year:
1999

Citing 8
Cited 0

Probabilistic logic

Artificial Intelligence
An assumption-based TMS

Artificial Intelligence
Diagnosing multiple faults

Artificial Intelligence
Optimal solution of set covering/partitioning problems using dual heuristics

Management Science
Algorithms for the maximum satisfiability problem

Computing
Boole's conditions of possible experience and reasoning under uncertainty

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Tabu Search

Tabu Search
On the Relations between Incidence Calculus and ATMS

ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the relationship between probabilistic logic and π-CMS. Given a set of logical sentences and their probabilities of being true, the outcome of a probabilistic logic system consists of lower and upper bounds on the probability of an additional sentence to be true. These bounds are computed using a linear programming formulation. In π-CMS systems, the outcome is defined by the probabilities of the support and the plausibility (with the assumptions being independent) after a first phase which consists of computing the prime implicants depending only on the variables of the assumptions. We propose to reformulate a π-CMS system without independence conditions on the assumptions, using the linear programming framework of probabilistic logic, and show how to exploit its particular structure to solve it efficiently. When an independence condition is imposed on the assumptions the two systems give different results. Comparisons are made on small problems using the assumption-based evidential language program (ABEL) of [Anrig et al., 1998] and the PSAT program of [Jaumard et al., 1991].