Journal of Complexity
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)
Conditional Events with Vague Information in Expert Systems
IPMU '90 Proceedings of the 3rd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems: Uncertainty in Knowledge Bases
Probabilistic Consistency of Knowledge Bases in Inference Systems
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Probabilistic Satisfiability and Decomposition
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
An Investigation of the Laws of Thought
An Investigation of the Laws of Thought
Probability Logic and Optimization SAT: The PSAT and CPA Models
Annals of Mathematics and Artificial Intelligence
Benefits of embedding structural constraints in coherent diagnostic processes
International Journal of Approximate Reasoning
Inferential models and relevant algorithms in a possibilistic framework
International Journal of Approximate Reasoning
Generalized Bayesian inference in a fuzzy context: From theory to a virtual reality application
Computational Statistics & Data Analysis
International Journal of Approximate Reasoning
Inferential processes leading to possibility and necessity
Information Sciences: an International Journal
Probabilistic satisfiability and coherence checking through integer programming
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
In this paper we develop a procedure for checking the consistency (coherence) of a partial probability assessment. The general problem (called CPA) is NP-complete, hence, to have a reasonable application some heuristic is needed. Our proposal differs from others because it is based on a skilful use of the logical relations present among the events. In other approaches the consistency problem is reduced directly to the satisfiability of a system of linear constraints. Here, thanks to the characterization of particular configurations and to the elimination of variables, an instance of the problem is reduced to smaller instances. To obtain such results, we introduce a procedure based on rules resembling those given by Davis–Putnam for the satisfiability of Boolean formulas. At the end a particularized description of an actual implementation is given.