Pages that link to "Item:Q5325885"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing (Q5325885):
Displayed 50 items.
- MiniSat (Q13332) (← 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)
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← 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)
- Symmetry in Gardens of Eden (Q396822) (← 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)
- 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)
- 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)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Verification conditions for source-level imperative programs (Q465685) (← 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)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← 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)
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- SAT solver management strategies in IC3: an experimental approach (Q526434) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
- Haplotype inference with pseudo-Boolean optimization (Q545548) (← links)
- Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics (Q555381) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- Explaining the \texttt{cumulative} propagator (Q647477) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Variable and clause elimination for LTL satisfiability checking (Q748758) (← links)
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers (Q821566) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Interpolation and model checking for nonlinear arithmetic (Q832268) (← links)
- Compiling finite linear CSP into SAT (Q842794) (← links)