Pages that link to "Item:Q293409"
From MaRDI portal
The following pages link to A linear-time transformation of linear inequalities into conjunctive normal form (Q293409):
Displaying 18 items.
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- HySAT: An efficient proof engine for bounded model checking of hybrid systems (Q883144) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Encoding cardinality constraints using multiway merge selection networks (Q2009191) (← links)
- On preprocessing for weighted MaxSAT (Q2234104) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences (Q2900530) (← links)
- Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Quantitative Logic Reasoning (Q3305344) (← links)
