GRASP: a search algorithm for propositional satisfiability

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

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

Extended resolution simulates binary decision diagrams
Editorial: Symbolic computation and satisfiability checking
Efficient SAT-based bounded model checking for software verification
Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs
GridSAT: Design and implementation of a computational grid application
Computational aspects of infeasibility analysis in mixed integer programming
BerkMin: A fast and robust SAT-solver
Satisfiability Checking: Theory and Applications
Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
Towards NP-P via proof complexity and search
SatEx: A web-based framework for SAT experimentation
Proving unsatisfiability of CNFs locally
An annotated bibliography of GRASP-Part II: Applications
A competitive and cooperative approach to propositional satisfiability
On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
Experimental and Efficient Algorithms
Semantically-guided goal-sensitive reasoning: inference system and completeness
Cutting to the Chase Solving Linear Integer Arithmetic
Advances in WASP
Resolution and binary decision diagrams cannot simulate each other polynomially
Random backtracking in backtrack search algorithms for satisfiability
Deciding floating-point logic with abstract conflict driven clause learning
Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
A Decision-Making Procedure for Resolution-Based SAT-Solvers
Simulating strong practical proof systems with extended resolution
Answer set programming based on propositional satisfiability
Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
The Mechanical Verification of a DPLL-Based Satisfiability Solver
Formal verification based on Boolean expression diagrams
A note about \(k\)-DNF resolution
A generative power-law search tree model
Clingcon: The next generation
ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
An approach using SAT solvers for the RCPSP with logical constraints
On a class of decision diagrams
Conflict-driven answer set solving: from theory to practice
Constraint Integer Programming: A New Approach to Integrate CP and MIP
A logic-based Benders decomposition for microscopic railway timetable planning
Design and results of the Fifth Answer Set Programming Competition
Conflict analysis in mixed integer programming
SAT race 2015
Propositional SAT Solving
Title not available (Why is that?)
Complexity-sensitive decision procedures for abstract argumentation
Constraint and Satisfiability Reasoning for Graph Coloring
Definability for model counting
A heuristic block coordinate descent approach for controlled tabular adjustment
A complete adaptive algorithm for propositional satisfiability
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
Approximating minimal unsatisfiable subformulae by means of adaptive core search
A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
Another look at graph coloring via propositional satisfiability
CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
Supercritical Space-Width Trade-offs for Resolution
Planning as satisfiability: heuristics
Resolution cannot polynomially simulate compressed-BFS
An interpolating theorem prover
Cutting to the chase.
Backjump-based backtracking for constraint satisfaction problems
Cumulative Space in Black-White Pebbling and Resolution
Improving configuration checking for satisfiable random \(k\)-SAT instances
UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
AND/OR search spaces for graphical models
On Linear Resolution
Title not available (Why is that?)
State space search nogood learning: online refinement of critical-path dead-end detectors in planning
Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
Methods for solving reasoning problems in abstract argumentation -- a survey
Bounded model checking of infinite state systems
Propositional proof skeletons
On CDCL-Based Proof Systems with the Ordered Decision Strategy
Clause-Learning for Modular Systems
Certified SAT solving with GPU accelerated inprocessing
Computations about formal multiple zeta spaces defined by binary extended double shuffle relations
Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays
Towards an efficient library for SAT: A manifesto
On preprocessing techniques and their impact on propositional model counting
A review on declarative approaches for constrained clustering
Resource-constrained project scheduling with activity splitting and setup times
Supercharging plant configurations using Z3
On dedicated CDCL strategies for PB solvers
Title not available (Why is that?)
A novel SAT solver for the van der Waerden numbers
Time-space trade-offs in resolution: superpolynomial lower bounds for superlinear space
Debugging Non-ground ASP Programs: Technique and Graphical Tools
Reluplex: a calculus for reasoning about deep neural networks
Conflict Analysis for MINLP
ASP and subset minimality: enumeration, cautious reasoning and MUSes
Strong ETH and resolution via games and the multiplicity of strategies
Inconsistency Proofs for ASP: The ASP - DRUPE Format
Propositional proof systems based on maximum satisfiability
What we can learn from conflicts in propositional satisfiability
Eliminating models during model elimination
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
Title not available (Why is that?)
Narrow Proofs May Be Maximally Long
Cautious reasoning in ASP via minimal models and unsatisfiable cores

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)