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
• Optimization modulo theories with linear rational costs
• HordeSat: a massively parallel portfolio SAT solver
• 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
• 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 unified framework for DPLL(T) + certificates
• 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
• Towards Robust CNF Encodings of Cardinality Constraints
• 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
• Anatomy and empirical evaluation of modern SAT solvers
• 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
• SAT-based explicit LTL reasoning and its application to satisfiability checking
• 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
• Functional design errors in digital circuits. Diagnosis correction and repair
• On orthogonal symmetric chain decompositions
• SAT-Based Formula Simplification
• Searching for Autarkies to Trim Unsatisfiable Clause Sets
• The Log-Support Encoding of CSP into SAT
• Accelerating backtrack search with a best-first-search strategy
• An explicit transition system construction approach to LTL satisfiability checking
• Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
• Decomposing SAT problems into connected components
• Extreme cases in SAT problems
• Theory and Applications of Satisfiability Testing
• Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis
• Solving the \$100 modal logic challenge
• Writing declarative specifications for clauses
• Tableau reasoning for description logics and its extension to probabilities
• Chronological backtracking
• Leveraging GPUs for effective clause sharing in parallel SAT solving
• Temporal logic modeling of biological systems
• Ricochet Robots reloaded: a case-study in multi-shot ASP solving
• A volunteer-computing-based grid architecture incorporating idle resources of computational clusters
• A verified SAT solver framework with learn, forget, restart, and incrementality
• raSAT: an SMT solver for polynomial constraints
• A Progressive Simplifier for Satisfiability Modulo Theories
• Model Checking Software
• Synchronous counting and computational algorithm design
• Automatic construction of optimal static sequential portfolios for AI planning and beyond
• Design and results of the Fifth Answer Set Programming Competition
• Careful synchronization of partial deterministic finite automata
• Quantitative logic reasoning
• Definability for model counting
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
• Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms
• Assessing progress in SAT solvers through the Lens of incremental SAT
• Identifying necessary reactions in metabolic pathways by minimal model generation
• Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases

This page was built for software: MiniSat