Pages that link to "Item:Q4571400"
From MaRDI portal
The following pages link to GRASP: a search algorithm for propositional satisfiability (Q4571400):
Displayed 50 items.
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q280157) (← links)
- An approach using SAT solvers for the RCPSP with logical constraints (Q321002) (← links)
- On a class of decision diagrams (Q329079) (← links)
- SAT race 2015 (Q334795) (← links)
- Planning as satisfiability: heuristics (Q359984) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers (Q421579) (← links)
- Deciding floating-point logic with abstract conflict driven clause learning (Q479837) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- A heuristic block coordinate descent approach for controlled tabular adjustment (Q547141) (← links)
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- A generative power-law search tree model (Q1010292) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← links)
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Proving unsatisfiability of CNFs locally (Q1610678) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- Resolution cannot polynomially simulate compressed-BFS (Q1776193) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
- Resource-constrained project scheduling with activity splitting and setup times (Q2003582) (← links)
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints (Q2029253) (← links)
- Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays (Q2108176) (← links)
- Supercharging plant configurations using Z3 (Q2117195) (← links)
- Assessing progress in SAT solvers through the Lens of incremental SAT (Q2118309) (← links)
- On dedicated CDCL strategies for PB solvers (Q2118312) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
- Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)