Pages that link to "Item:Q4319327"
From MaRDI portal
The following pages link to A Computational Study of Satisfiability Algorithms for Propositional Logic (Q4319327):
Displaying 26 items.
- A weight-balanced branching rule for SAT (Q597527) (← links)
- On market-inspired approaches to propositional satisfiability (Q814434) (← links)
- New methods for computing inferences in first order logic (Q1309900) (← links)
- Logic cuts for processing networks with fixed charges (Q1317071) (← links)
- Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
- Embedding complex decision procedures inside an interactive theorem prover. (Q1353946) (← links)
- Branch-and-cut solution of inference problems in propositional logic (Q1356213) (← links)
- Solving propositional satisfiability problems (Q1356218) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- Running time experiments on some algorithms for solving propositional satisfiability problems (Q1897402) (← links)
- Branching rules for satisfiability (Q1904401) (← links)
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages (Q1918922) (← links)
- Testing heuristics: We have it all wrong (Q1922626) (← links)
- Structured proof procedures (Q1924823) (← links)
- Resolution versus search: Two strategies for SAT (Q1977760) (← links)
- Implementing the Davis-Putnam method (Q1977761) (← links)
- Resolution versus search: Two strategies for SAT (Q2749860) (← links)
- Implementing the Davis-Putnam method (Q2749864) (← links)
- ON SATISFIABILITY TREES (Q2981086) (← links)
- An Incremental Branch-and-Bound Method for the Satisfiability Problem (Q4427350) (← links)
- Survey propagation: An algorithm for satisfiability (Q5318246) (← links)
- Characterizing Propagation Methods for Boolean Satisfiability (Q5756574) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897190) (← links)