MiniSat

swMATH577MaRDI QIDQ13332FDOQ13332

Author name not available (Why is that?)

Source code repository: https://github.com/niklasso/minisat/

Described by source

• Theory and Applications of Satisfiability Testing

Cited In (only showing first 100 items - show all)

• Extended Resolution Proofs for Conjoining BDDs
• Efficient theory combination via Boolean search
• Solving equation systems by agreeing and learning
• Eliminating Redundant Clauses in SAT Instances
• Constraint answer set programming systems
• Boundary Points and Resolution
• Combining decision procedures by (model-)equality propagation
• Exploiting step semantics for efficient bounded model checking of asynchronous systems
• Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
• SAT-solving in CSP trace refinement
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
• Symbolic algorithmic verification of intransitive generalized noninterference
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• Online Estimation of SAT Solving Runtime
• KBO orientability
• Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)
• Logics in Artificial Intelligence
• A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis
• Optimization Modulo Theories with Linear Rational Costs
• Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
• Incremental preprocessing methods for use in BMC
• A logical approach to efficient Max-SAT solving
• Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
• Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
• A SAT Approach to Clique-Width
• Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
• Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
• Guarantees and limits of preprocessing in constraint satisfaction and reasoning
• HordeSat: A Massively Parallel Portfolio SAT Solver
• Towards Robust CNF Encodings of Cardinality Constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructing infinite models represented by tree automata
• Verification conditions for source-level imperative programs
• Automatic verification of reduction techniques in higher order logic
• E-MaLeS 1.1
• Deciding Bit-Vector Arithmetic with Abstraction
• On the completeness of pruning techniques for planning with conditional effects
• SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata
• An overview of parallel SAT solving
• Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
• A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
• Abstract Answer Set Solvers
• Data compression for proof replay
• Compiling finite linear CSP into SAT
• The configurable SAT solver challenge (CSSC)
• Automatic construction of parallel portfolios via algorithm configuration
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
• Mining top-\(k\) motifs with a SAT-based framework
• About some UP-based polynomial fragments of SAT
• Improving configuration checking for satisfiable random \(k\)-SAT instances
• Cardinality networks: a theoretical and empirical study
• Leveraging belief propagation, backtrack search, and statistics for model counting
• SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning
• An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
• Cache conscious data structures for Boolean satisfiability solvers
• Reducing chaos in SAT-like search: finding solutions close to a given one
• Proving Termination Using Recursive Path Orders and SAT Solving
• SAT-based explicit LTL reasoning and its application to satisfiability checking
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
• Correct Hardware Design and Verification Methods
• SAT solver management strategies in IC3: an experimental approach
• Symbolic trajectory evaluation for word-level verification: theory and implementation
• 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
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
• Imperative Functional Programming with Isabelle/HOL
• Interpolation and model checking for nonlinear arithmetic
• Progress in certifying hardware model checking results
• Tools and Algorithms for the Construction and Analysis of Systems
• Conformant planning as a case study of incremental QBF solving
• Long-distance mutual exclusion for planning
• Learning Rate Based Branching Heuristic for SAT Solvers
• A competitive and cooperative approach to propositional satisfiability
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• Symmetric explanation learning: effective dynamic symmetry handling for SAT
• Theory and Applications of Satisfiability Testing
• Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics
• Boosting haplotype inference with local search
• Attacking Bivium Using SAT Solvers
• Algebraic, AIDA/Cube and side channel analysis of KATAN family of block ciphers
• Title not available (Why is that?)
• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
• Certifying proofs for SAT-based model checking
• Title not available (Why is that?)
• Preprocessing of propagation redundant clauses
• DRAT-based bit-vector proofs in CVC4
• On the complexity of reconstructing chemical reaction networks
• Parallel SAT solving in bounded model checking
• Reducing higher-order theorem proving to a sequence of SAT problems
• On the independence of axioms in BL and MTL
• Improved Static Symmetry Breaking for SAT
• A unified framework for DPLL(T) + certificates
• Theory and Applications of Satisfiability Testing

This page was built for software: MiniSat