Solving satisfiability problems with preferences
From MaRDI portal
Recommendations
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- Combining approaches for solving satisfiability problems with qualitative preferences
- Preference-Based Problem Solving for Constraint Programming
- Introducing preferences in planning as satisfiability
- Solving disjunctive temporal problems with preferences using maximum satisfiability
- Logic programming with solution preferences
- scientific article; zbMATH DE number 5575002
- A general framework for preferences in answer set programming
- Solving Satisfiability with Less Searching
Cites work
- scientific article; zbMATH DE number 5605058 (Why is no real title available?)
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5139167 (Why is no real title available?)
- scientific article; zbMATH DE number 3904558 (Why is no real title available?)
- scientific article; zbMATH DE number 1903357 (Why is no real title available?)
- scientific article; zbMATH DE number 2102695 (Why is no real title available?)
- scientific article; zbMATH DE number 2243357 (Why is no real title available?)
- A linear-time transformation of linear inequalities into conjunctive normal form
- A machine program for theorem-proving
- A structure-preserving clause form translation
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Algorithms for Weighted Boolean Optimization
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Efficient CNF encoding of Boolean cardinality constraints
- Logic Programming
- Logic programming with satisfiability
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Minimaxsat: an efficient weighted Max-SAT solver
- New inference rules for Max-SAT
- On using cutting planes in pseudo-Boolean optimization
- Preferred answer sets for ordered logic programs
- Prioritized logic programming and its application to commonsense reasoning
- Solving Max-SAT as weighted CSP
- The complexity of resolution refinements
- Theory and Applications of Satisfiability Testing
- 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
- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- optsat: A Tool for Solving SAT Related Optimization Problems
Cited in
(29)- Solving QBF with counterexample guided refinement
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Progress in clasp series 3
- Boolean lexicographic optimization: algorithms \& applications
- Preference-Based Problem Solving for Constraint Programming
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- optsat: A Tool for Solving SAT Related Optimization Problems
- Paracoherent answer set computation
- Minimal sets on propositional formulae. Problems and reductions
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Abstraction-based algorithm for 2QBF
- Declarative approaches to outcome determination in judgment aggregation
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- 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
- Antichain with SAT and tries
- A complexity perspective on entailment of parameterized linear constraints
- Combining approaches for solving satisfiability problems with qualitative preferences
- Minimal intervention strategies in logical signaling networks with ASP
- Enumeration of minimal models and MUSes in WASP
- Analysis of cyclic fault propagation via ASP
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Mining top-\(k\) motifs with a SAT-based framework
- SAT-Based Horn Least Upper Bounds
- Manipulation of articulated objects using dual-arm robots via answer set programming
- MCS Extraction with Sublinear Oracle Queries
- Implementing preferences with asprin
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
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)
