Solving satisfiability problems with preferences
From MaRDI portal
Publication:606909
DOI10.1007/S10601-010-9095-YzbMATH Open1208.68199OpenAlexW2051475155MaRDI QIDQ606909
Enrico Giunchiglia, Emanuele Di Rosa, Marco Maratea
Publication date: 19 November 2010
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-010-9095-y
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- optsat: A Tool for Solving SAT Related Optimization Problems
- A structure-preserving clause form translation
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2003
- Algorithms for Weighted Boolean Optimization
- A machine program for theorem-proving
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- A linear-time transformation of linear inequalities into conjunctive normal form
- Theory and Applications of Satisfiability Testing
- Prioritized logic programming and its application to commonsense reasoning
- Tools and Algorithms for the Construction and Analysis of Systems
- Logic programming with satisfiability
- Principles and Practice of Constraint Programming – CP 2003
- Preferred answer sets for ordered logic programs
- Logic Programming
- The complexity of resolution refinements
- Theory and Applications of Satisfiability Testing
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
Cited In (25)
- Solving QBF with counterexample guided refinement
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Preference-Based Problem Solving for Constraint Programming
- Boolean lexicographic optimization: algorithms \& applications
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Paracoherent answer set computation
- Implementing Preferences with asprin
- Minimal sets on propositional formulae. Problems and reductions
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Manipulation of Articulated Objects Using Dual-arm Robots via Answer Set Programming
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Progress in clasp Series 3
- A general framework for preferences in answer set programming
- A max-term counting based knowledge inconsistency checking strategy and inconsistency measure calculation of fuzzy knowledge based systems
- Iterative and core-guided maxsat solving: a survey and assessment
- Abstraction-Based Algorithm for 2QBF
- A complexity perspective on entailment of parameterized linear constraints
- Minimal intervention strategies in logical signaling networks with ASP
- Enumeration of minimal models and MUSes in WASP
- Analysis of cyclic fault propagation via ASP
- SAT-Based Horn Least Upper Bounds
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Mining top-\(k\) motifs with a SAT-based framework
- MCS Extraction with Sublinear Oracle Queries
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Combining approaches for solving satisfiability problems with qualitative preferences 👍 👎
- Preference-Based Problem Solving for Constraint Programming 👍 👎
- Solving Satisfiability with Less Searching 👍 👎
- Logic programming with solution preferences 👍 👎
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences 👍 👎
- Introducing Preferences in Planning as Satisfiability 👍 👎
- Solving disjunctive temporal problems with preferences using maximum satisfiability 👍 👎
- A general framework for preferences in answer set programming 👍 👎
This page was built for publication: Solving satisfiability problems with preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606909)
