Algorithms for Solving Satisfiability Problems with Qualitative Preferences

DOI10.1007/978-3-642-30743-0_22zbMATH Open1357.68206OpenAlexW120175844MaRDI QIDQ2900530FDOQ2900530

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

Uses Software

• MiniSat
• CP-nets
• PBS

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)