The following pages link to MiniSat (Q13332):
Displaying 50 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Set constraint model and automated encoding into SAT: application to the social golfer problem (Q256655) (← links)
- Fast, flexible MUS enumeration (Q272009) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- Labelled interpolation systems for hyper-resolution, clausal, and local proofs (Q286731) (← links)
- Automating Boolean set operations in Mizar proof checking with the aid of an external SAT solver (Q286803) (← links)
- Generating SAT instances with community structure (Q309919) (← links)
- Looking-ahead in backtracking algorithms for abstract argumentation (Q324699) (← links)
- On a class of decision diagrams (Q329079) (← links)
- SAT race 2015 (Q334795) (← links)
- Online belief tracking using regression for contingent planning (Q334802) (← links)
- Merging almost sorted sequences yields a 24-sorter (Q344521) (← links)
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- Formal verification of logical descriptions with functional uncertainty based on logarithmic encoding of conditions (Q384705) (← links)
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) (Q400514) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Combining decision procedures by (model-)equality propagation (Q436376) (← links)
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Analytic tableaux for higher-order logic with choice (Q438561) (← links)
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework (Q438582) (← links)
- Symbolic algorithmic verification of intransitive generalized noninterference (Q439858) (← links)
- Incremental preprocessing methods for use in BMC (Q453488) (← links)
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning (Q457250) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Verification conditions for source-level imperative programs (Q465685) (← links)
- Automatic verification of reduction techniques in higher order logic (Q469363) (← links)
- On the completeness of pruning techniques for planning with conditional effects (Q473577) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata (Q479819) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
