Algorithms for Solving Satisfiability Problems with Qualitative Preferences

DOI10.1007/978-3-642-30743-0_22zbMath1357.68206OpenAlexW120175844MaRDI QIDQ2900530

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)

Related Items (2)

A reward-based approach for preference modeling: a case study ⋮ A general framework for preferences in answer set programming

Uses Software

• MiniSat
• CP-nets
• PBS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time transformation of linear inequalities into conjunctive normal form
• Solving satisfiability problems with preferences
• Unrestricted vs restricted cut in a tableau method for Boolean circuits
• A structure-preserving clause form translation
• Preferred answer sets for extended logic programs
• Expressing preferences in default logic
• Extending and implementing the stable model semantics
• SAT-based decision procedures for classical modal logics
• Limitations of restricted branching in clause learning
• Multi-Criteria Optimization in Answer Set Programming
• Aggregates in Answer Set Optimization
• Complex optimization in answer set programming
• Preferred answer sets for ordered logic programs
• optsat: A Tool for Solving SAT Related Optimization Problems
• Algorithms for Weighted Boolean Optimization
• 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
• The DLV system for knowledge representation and reasoning
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• Conflict-Driven Answer Set Enumeration
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003

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