MiniSat
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Abductive reasoning on molecular interaction maps
- Functional design errors in digital circuits. Diagnosis correction and repair
- Incremental column-wise verification of arithmetic circuits using computer algebra
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way
- scientific article; zbMATH DE number 5613972 (Why is no real title available?)
- Correct Hardware Design and Verification Methods
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems
- Solving QBF with counterexample guided refinement
- Set constraint model and automated encoding into SAT: application to the social golfer problem
- Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing
- On orthogonal symmetric chain decompositions
- A study of symmetry breaking predicates and model counting
- scientific article; zbMATH DE number 5542982 (Why is no real title available?)
- Local redundancy in SAT: generalizations of blocked clauses
- Extended Resolution Proofs for Conjoining BDDs
- Impact of Community Structure on SAT Solver Performance
- Approximate model-based diagnosis using greedy stochastic search
- Replanning in domains with partial information and sensing actions
- Pitfalls and best practices in algorithm configuration
- SAT-Based Formula Simplification
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- The 10th IJCAR automated theorem proving system competition -- CASC-J10
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- CompoSAT: specification-guided coverage for model finding
- Searching for Autarkies to Trim Unsatisfiable Clause Sets
- The Log-Support Encoding of CSP into SAT
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- A posthumous contribution by Larry Wos: excerpts from an unpublished column
- Pardinus: a temporal relational model finder
- Flexible proof production in an industrial-strength SMT solver
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Interpolation and model checking for nonlinear arithmetic
- Progress in certifying hardware model checking results
- Using Community Structure to Detect Relevant Learnt Clauses
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
- Theory and Applications of Satisfiability Testing
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
- On the power of clause-learning SAT solvers as resolution engines
- An iterative method for linear decomposition of index generating functions
- Accelerating backtrack search with a best-first-search strategy
- Imperative Functional Programming with Isabelle/HOL
- meSAT: multiple encodings of CSP to SAT
- Solving SAT problem by heuristic polarity decision-making algorithm
- Solving satisfiability problems with preferences
- Generalized conflict-clause strengthening for satisfiability solvers
- Empirical study of the anatomy of modern SAT solvers
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem
- View-based propagator derivation
- Tools and Algorithms for the Construction and Analysis of Systems
- The CADE-26 automated theorem proving system competition -- CASC-26
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- Implementing efficient All solutions SAT solvers
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Compositional propositional proofs
- Improving implementation of SAT competitions 2017--2019 winners
- Design and results of the second international competition on computational models of argumentation
- How we designed winning algorithms for abstract argumentation and which insight we attained
- Between restarts and backjumps
- SATenstein: automatically building local search SAT solvers from components
- Long-distance mutual exclusion for planning
- Fast, flexible MUS enumeration
- Quantified maximum satisfiability
- DRABT
- Efficient theory combination via Boolean search
- scientific article; zbMATH DE number 5542984 (Why is no real title available?)
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Conformant planning as a case study of incremental QBF solving
- Boolean Abstraction for Temporal Logic Satisfiability
- Wombit: a portfolio bit-vector solver using word-level propagation
- Automatic Termination
- On preprocessing techniques and their impact on propositional model counting
- scientific article; zbMATH DE number 6542823 (Why is no real title available?)
- Rewriting optimization statements in answer-set programs
- Solving equation systems by agreeing and learning
- scientific article; zbMATH DE number 5263038 (Why is no real title available?)
- On the one-way function candidate proposed by Goldreich
- Abstract cores in implicit hitting set MaxSat solving
- Optimization modulo theories with linear rational costs
- Constraint CNF: SAT and CSP Language Under One Roof.
- Finding Lean Induced Cycles in Binary Hypercubes
- HordeSat: a massively parallel portfolio SAT solver
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- Modelling and solving temporal reasoning as propositional satisfiability
- Satallax: An Automatic Higher-Order Prover
- Eliminating Redundant Clauses in SAT Instances
- An explicit transition system construction approach to LTL satisfiability checking
- Algorithms for computing minimal equivalent subformulas
- Supercharging plant configurations using Z3
- Towards a compact SAT-based encoding of itemset mining tasks
- Deep cooperation of CDCL and local search for SAT
- Efficient all-UIP learned clause minimization
- Hash-based preprocessing and inprocessing techniques in SAT solvers
- Certified DQBF solving by definition extraction
- OptiLog: a framework for SAT-based systems
This page was built for software: MiniSat
