GRASP: a search algorithm for propositional satisfiability
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A generative power-law search tree model
- AND/OR search spaces for graphical models
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Resolution and binary decision diagrams cannot simulate each other polynomially
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Backjump-based backtracking for constraint satisfaction problems
- Proving unsatisfiability of CNFs locally
- A note about k-DNF resolution
- What is answer set programming to propositional satisfiability
- Domain reduction techniques for global NLP and MINLP optimization
- Semantically-guided goal-sensitive reasoning: inference system and completeness
- Cliques enumeration and tree-like resolution proofs
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Conflict-driven answer set solving: from theory to practice
- Resolution cannot polynomially simulate compressed-BFS
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- A complete adaptive algorithm for propositional satisfiability
- Formal verification based on Boolean expression diagrams
- Resource-constrained project scheduling with activity splitting and setup times
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
- Understanding the power of Max-SAT resolution through up-resilience
- Computational aspects of infeasibility analysis in mixed integer programming
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays
- Supercharging plant configurations using Z3
- Assessing progress in SAT solvers through the Lens of incremental SAT
- On dedicated CDCL strategies for PB solvers
- Eliminating models during model elimination
- A logic-based Benders decomposition for microscopic railway timetable planning
- Simulating strong practical proof systems with extended resolution
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Propositional proof systems based on maximum satisfiability
- Clause vivification by unit propagation in CDCL SAT solvers
- A conflict-driven solving procedure for poly-power constraints
- Definability for model counting
- Editorial: Symbolic computation and satisfiability checking
- Hyperresolution for Gödel logic with truth constants
- A novel SAT solver for the van der Waerden numbers
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Cutting to the chase.
- On preprocessing techniques and their impact on propositional model counting
- Bounded model checking of infinite state systems
- Strong ETH and resolution via games and the multiplicity of strategies
- Modular strategic SMT solving with \textbf{SMT-RAT}
- Search techniques for SAT-based Boolean optimization
- Another look at graph coloring via propositional satisfiability
- Conflict analysis in mixed integer programming
- Extended resolution simulates binary decision diagrams
- GridSAT: Design and implementation of a computational grid application
- Selection of search strategies for solving 3-SAT problems
- An interpolating theorem prover
- What we can learn from conflicts in propositional satisfiability
- BerkMin: A fast and robust SAT-solver
- Random backtracking in backtrack search algorithms for satisfiability
- SatEx: A web-based framework for SAT experimentation
- Towards an efficient library for SAT: A manifesto
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Time-space trade-offs in resolution: superpolynomial lower bounds for superlinear space
- Bounded model checking with parametric data structures
- Space complexity in polynomial calculus
- Propositional SAT solving
- Extracting a DPLL algorithm
- An approach using SAT solvers for the RCPSP with logical constraints
- On a class of decision diagrams
- Truth assignments as conditional autarkies
- SAT race 2015
- An annotated bibliography of GRASP-Part II: Applications
- Advances in WASP
- Clause-learning for modular systems
- Between SAT and UNSAT: the fundamental difference in CDCL SAT
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- A View from the Engine Room: Computational Support for Symbolic Model Checking
- Limitations of Restricted Branching in Clause Learning
- Planning as satisfiability: heuristics
- Towards NP-P via proof complexity and search
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- Satisfiability checking: theory and applications
- Preface
- \textit{clingcon}: the next generation
- Cumulative space in black-white pebbling and resolution
- Deciding floating-point logic with abstract conflict driven clause learning
- Complexity-sensitive decision procedures for abstract argumentation
- The External Interface for Extending WASP
- Branch and bound for piecewise linear neural network verification
- Conflict Analysis for MINLP
- MiFuMax -- a literate MaxSAT solver. System description
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- On exponential lower bounds for partially ordered resolution
- On linear resolution
- The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Short Proofs Are Hard to Find
- On CDCL-Based Proof Systems with the Ordered Decision Strategy
- Inconsistency proofs for ASP: the ASP-DRUPE format
- scientific article; zbMATH DE number 7199588 (Why is no real title available?)
- Constraint and satisfiability reasoning for graph coloring
- Improving configuration checking for satisfiable random \(k\)-SAT instances
This page was built for publication: GRASP: a search algorithm for propositional satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571400)
