Algorithms for Solving Satisfiability Problems with Qualitative Preferences

DOI10.1007/978-3-642-30743-0_22MaRDI QIDQ2900530zbMATH OpenOpenAlexFDO

Authors Enrico Giunchiglia, Marco Maratea

Publication date 23 July 2012

Published in Correct Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30743-0_22

Mathematics Subject Classification ID

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

Recommendations

• Combining approaches for solving satisfiability problems with qualitative preferences
• Solving satisfiability problems with preferences
• Principles and Practice of Constraint Programming – CP 2004
• scientific article; zbMATH DE number 4039349
• scientific article; zbMATH DE number 1113992
• Algorithms for the maximum satisfiability problem
• scientific article; zbMATH DE number 1206044
• scientific article; zbMATH DE number 776082
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Cites work

• scientific article; zbMATH DE number 5605058 (Why is no real title available?)
• scientific article; zbMATH DE number 3904558 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 2084756 (Why is no real title available?)
• scientific article; zbMATH DE number 1903357 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A linear-time transformation of linear inequalities into conjunctive normal form
• A machine program for theorem-proving
• A structure-preserving clause form translation
• Aggregates in answer set optimization
• Algorithms for Weighted Boolean Optimization
• Complex optimization in answer set programming
• Computing Weighted Solutions in Answer Set Programming
• Computing preferred answer sets by meta-interpretation in Answer Set Programming
• Conflict-Driven Answer Set Enumeration
• Expressing preferences in default logic
• Extending and implementing the stable model semantics
• Limitations of restricted branching in clause learning
• Max-ASP: Maximum Satisfiability of Answer Set Programs
• Multi-criteria optimization in answer set programming
• Preferred answer sets for extended logic programs
• Preferred answer sets for ordered logic programs
• SAT-based decision procedures for classical modal logics
• SAT2000. Highlights of satisfiability research in the year 2000. 3rd international workshop, September 1998
• Solving Max-SAT as weighted CSP
• Solving satisfiability problems with preferences
• The DLV system for knowledge representation and reasoning
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Unrestricted vs restricted cut in a tableau method for Boolean circuits
• optsat: A Tool for Solving SAT Related Optimization Problems

Cited in

(4)

• Solving satisfiability problems with preferences
• A general framework for preferences in answer set programming
• Combining approaches for solving satisfiability problems with qualitative preferences
• A reward-based approach for preference modeling: a case study

Describes a project that uses

Uses Software

• PBS
• CP-nets
• MiniSat

This page was built for publication: Algorithms for Solving Satisfiability Problems with Qualitative Preferences

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