Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability

DOI10.1007/978-3-642-39071-5_18zbMath1390.68594OpenAlexW2124071834MaRDI QIDQ5326467

Ronan Le Bras, Marcelo Finger, Bart Selman, Carla P. Gomes

Publication date: 5 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_18

Mathematics Subject Classification ID

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

Related Items (4)

Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation ⋮ Probabilistic satisfiability: algorithms with the presence and absence of a phase transition ⋮ Mass Customization and “Forecasting Options’ Penetration Rates Problem” ⋮ Towards classifying propositional probabilistic logics

This page was built for publication: Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability