Solutions for hard and soft constraints using optimized probabilistic satisfiability

DOI10.1007/978-3-642-39071-5_18zbMATH Open1390.68594OpenAlexW2124071834MaRDI QIDQ5326467FDOQ5326467

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

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

Recommendations

• Hard and soft constraints for reasoning about qualitative conditional preferences
• scientific article; zbMATH DE number 1114005
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Probabilistic satisfiability
• Interval-valued soft constraint problems

Mathematics Subject Classification ID

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

Cited In (6)

• Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
• Towards classifying propositional probabilistic logics
• Optimal satisfiability for propositional calculi and constraint satisfaction problems.
• Confidence-based reasoning in stochastic constraint programming
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
• Mass customization and ``forecasting options' penetration rates problem

This page was built for publication: Solutions for hard and soft constraints using optimized probabilistic satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326467)