Probability logic and optimization SAT: The PSAT and CPA models

DOI10.1007/s10472-005-0430-8zbMath1075.68086MaRDI QIDQ1777404

Daniele Pretolani

Publication date: 13 May 2005

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-005-0430-8

zbMATH Keywords

directed graphs; probability logic; propositional satisfiability; CNF formulas; ideal matrices

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03B48: Probability and inductive logic

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

A Propositional CONEstrip Algorithm, Optimization and probabilistic satisfiability on nested and co-nested formulas, NP-containment for the coherence test of assessments of conditional probability: a fuzzy logical approach, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, Logic optimality for multi-objective optimization

Uses Software

• PBS
• Leibniz

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity versus stability for classes of propositional formulas
• Probabilistic logic
• Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
• On the complexity of the maximum satisfiability problem for Horn formulas
• Probabilistic satisfiability
• Simplification rules for the coherent probability assessment problem
• Probabilistic satisfiability with imprecise probabilities
• Easy cases of probabilistic satisfiability
• A MINSAT Approach for Learning in Logic Domains
• Column Generation Methods for Probabilistic Logic
• A class of logic problems solvable by linear programming