The following pages link to BerkMin (Q18983):
Displaying 50 items.
- Application of productions for automatic control of logical design of discrete devices (Q367970) (← links)
- Formal verification of logical descriptions with functional uncertainty based on logarithmic encoding of conditions (Q384705) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Decision procedures. An algorithmic point of view (Q518892) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- Logic programming with infinite sets (Q812390) (← links)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- SAT-solving in practice, with a tutorial example from supervisory control (Q843991) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Heuristic-based backtracking relaxation for propositional satisfiability (Q862398) (← links)
- The complexity of pure literal elimination (Q862401) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Dynamic symmetry-breaking for Boolean satisfiability (Q976993) (← links)
- A generative power-law search tree model (Q1010292) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- An empirical study of branching heuristics through the lens of global learning rate (Q1680251) (← links)
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints (Q1753130) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- A SAT approach to query optimization in mediator systems (Q1777403) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Deep cooperation of CDCL and local search for SAT (Q2118286) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques (Q2385178) (← links)
- The model evolution calculus as a first-order DPLL method (Q2389629) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
- On look-ahead heuristics in disjunctive logic programming (Q2426102) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Search techniques for SAT-based Boolean optimization (Q2455454) (← links)
- Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
- Solving SAT problem by heuristic polarity decision-making algorithm (Q2465749) (← links)
- Conflict analysis in mixed integer programming (Q2471271) (← links)
- GridSAT: Design and implementation of a computational grid application (Q2505055) (← links)
- Verification of embedded systems based on interval analysis (Q2506266) (← links)
- Random backtracking in backtrack search algorithms for satisfiability (Q2643305) (← links)
- Learning Rate Based Branching Heuristic for SAT Solvers (Q2818006) (← links)
- On the resolution of bipolar max-min equations. (Q2829128) (← links)
- Symbolic computational techniques for solving games (Q2845509) (← links)
- Bounded model checking with parametric data structures (Q2864380) (← links)
- Interpolant learning and reuse in SAT-based model checking (Q2864382) (← links)
- (Q2995155) (← links)
