Chaff
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Generating Diverse Solutions in SAT
- Toward leaner binary-clause reasoning in a satisfiability solver
- An improved bit parallel exact maximum clique algorithm
- Modelling and solving English peg solitaire
- Long proofs of (seemingly) simple formulas
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- scientific article; zbMATH DE number 2243408 (Why is no real title available?)
- Logic programming with infinite sets
- scientific article; zbMATH DE number 1956571 (Why is no real title available?)
- Computer Aided Verification
- Model checking abstract state machines with answer set programming
- A Search-Infer-and-Relax Framework for Integrating Solution Methods
- scientific article; zbMATH DE number 5542982 (Why is no real title available?)
- Constraint and satisfiability reasoning for graph coloring
- Matrix Interpretations for Proving Termination of Term Rewriting
- scientific article; zbMATH DE number 1979551 (Why is no real title available?)
- scientific article; zbMATH DE number 1796136 (Why is no real title available?)
- Extended Resolution Proofs for Conjoining BDDs
- scientific article; zbMATH DE number 1903356 (Why is no real title available?)
- scientific article; zbMATH DE number 2090318 (Why is no real title available?)
- SAS+ planning as satisfiability
- STR3: a path-optimal filtering algorithm for table constraints
- Efficient SAT-based bounded model checking for software verification
- Decomposition representations of logical equations in problems of inversion of discrete functions
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Logics in Artificial Intelligence
- The Log-Support Encoding of CSP into SAT
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- scientific article; zbMATH DE number 1979548 (Why is no real title available?)
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- Planning as propositional CSP: From Walksat to local search techniques for action graphs
- An efficient subsumption test pipeline for BS(LRA) clauses
- SCL(EQ): SCL for first-order logic with equality
- Combining Abstraction Refinement and SAT-Based Model Checking
- scientific article; zbMATH DE number 1903365 (Why is no real title available?)
- scientific article; zbMATH DE number 2111140 (Why is no real title available?)
- Using Community Structure to Detect Relevant Learnt Clauses
- Theory and Applications of Satisfiability Testing
- Conformant planning via heuristic forward search: A new approach
- Backjumping is Exception Handling
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- Symbolic techniques in satisfiability solving
- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
- On the power of clause-learning SAT solvers as resolution engines
- Fast congruence closure and extensions
- Accelerating backtrack search with a best-first-search strategy
- The return of \textit{xorro}
- DPLL: the core of modern satisfiability solvers
- GridSAT: Design and implementation of a computational grid application
- On CDCL-Based Proof Systems with the Ordered Decision Strategy
- Computational aspects of infeasibility analysis in mixed integer programming
- Solving SAT problem by heuristic polarity decision-making algorithm
- Solving satisfiability problems with preferences
- Generalized conflict-clause strengthening for satisfiability solvers
- Tools and Algorithms for the Construction and Analysis of Systems
- Preface to the special issue ``SI: satisfiability modulo theories
- Towards NP-P via proof complexity and search
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Regular-SAT: A many-valued approach to solving combinatorial problems
- Linear Encodings of Bounded LTL Model Checking
- A taxonomy of exact methods for partial Max-SAT
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- BerkMin: A fast and robust SAT-solver
- Theory and Applications of Satisfiability Testing
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Improving implementation of SAT competitions 2017--2019 winners
- scientific article; zbMATH DE number 2112982 (Why is no real title available?)
- Producing and verifying extremely large propositional refutations
- Ranking with multiple reference points: efficient SAT-based learning procedures
- Using constraint programming for solving RCPSP/MAX-cal
- Computer Aided Verification
- Between restarts and backjumps
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Efficient theory combination via Boolean search
- Statistical regimes across constrainedness regions
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Correct Hardware Design and Verification Methods
- scientific article; zbMATH DE number 5139168 (Why is no real title available?)
- Wombit: a portfolio bit-vector solver using word-level propagation
- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
- SatEx: A web-based framework for SAT experimentation
- An efficient approach to solving random \(k\)-SAT problems
- Formal Methods for Hardware Verification
- A parallelization scheme based on work stealing for a class of SAT solvers
- On preprocessing techniques and their impact on propositional model counting
- scientific article; zbMATH DE number 5263038 (Why is no real title available?)
- Tradeoffs in the Complexity of Backdoor Detection
- Correct Hardware Design and Verification Methods
- Equivalent literal propagation in the DLL procedure
- Formal Methods in Computer-Aided Design
- SAT problems with chains of dependent variables
- Optimization modulo theories with linear rational costs
- A backjumping technique for disjunctive logic programming
- Applications and Theory of Petri Nets 2004
- Some (in)translatability results for normal logic programs and propositional theories
- HordeSat: a massively parallel portfolio SAT solver
- Automatic construction and verification of isotopy invariants
- Modelling and solving temporal reasoning as propositional satisfiability
This page was built for software: Chaff
