Probability logic and optimization SAT: The PSAT and CPA models

DOI10.1007/s10472-005-0430-8zbMath1075.68086OpenAlexW4240109450MaRDI 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 graphsprobability logicpropositional satisfiabilityCNF formulasideal matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability and inductive logic (03B48) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

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 ⋮ Optimization and probabilistic satisfiability on nested and co-nested formulas ⋮ A Propositional CONEstrip Algorithm ⋮ Logic optimality for multi-objective optimization

Uses Software

• PBS
• Leibniz

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probability logic and optimization SAT: The PSAT and CPA models