Pages that link to "Item:Q5613969"
From MaRDI portal
The following pages link to A Computing Procedure for Quantification Theory (Q5613969):
Displayed 50 items.
- Optimization techniques for Craig interpolant compaction in unbounded model checking (Q888467) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- Completeness of resolution revisited (Q914411) (← links)
- An incremental method for generating prime implicants/implicates (Q917336) (← links)
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem (Q918700) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- Thread-parallel integrated test pattern generator utilizing satisfiability analysis (Q987743) (← links)
- A generative power-law search tree model (Q1010292) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Labelled splitting (Q1037396) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- First order Stålmarck. Universal lemmas through branch merges (Q1040785) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- Automated theorem proving methods (Q1057850) (← links)
- Condensed detachment as a rule of inference (Q1060210) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
- The intractability of resolution (Q1071750) (← links)
- Polynomial-average-time satisfiability problems (Q1095678) (← links)
- Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093) (← links)
- Inconsistency check of a set of clauses using Petri net reductions (Q1100906) (← links)
- Some results and experiments in programming techniques for propositional logic (Q1100931) (← links)
- A parallel approach for theorem proving in propositional logic (Q1102766) (← links)
- A satisfiability tester for non-clausal propositional calculus (Q1111774) (← links)
- Probabilistic performance of a heurisic for the satisfiability problem (Q1115189) (← links)
- Stratification and knowledge base management (Q1122994) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- Backtracking with multi-level dynamic search rearrangement (Q1138385) (← links)
- A switching algorithm for the solution of quadratic Boolean equations (Q1153123) (← links)
- Solving the satisfiability problem by using randomized approach (Q1190510) (← links)
- Tseitin's formulas revisited (Q1193906) (← links)
- Complexity of resolution proofs and function introduction (Q1194246) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- Graph properties for normal logic programs (Q1208418) (← links)
- On the role of unification in mechanical theorem proving (Q1225469) (← links)
- On the complexity of regular resolution and the Davis-Putnam procedure (Q1249435) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- How good are branching rules in DPLL? (Q1281405) (← links)
- Length of prime implicants and number of solutions of random CNF formulae (Q1285568) (← links)
- A two-phase algorithm for solving a class of hard satisfiability problems (Q1306378) (← links)
- Simplification in a satisfiability checker for VLSI applications (Q1312163) (← links)
- An exact algorithm for the constraint satisfaction problem: Application to logical inference (Q1313760) (← links)
- Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
- A kind of logical compilation for knowledge bases (Q1331921) (← links)
- Tractability through symmetries in propositional calculus (Q1332641) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)