235 results on '"Van Gelder, Allen"'
Search Results
2. Subsumption-Linear Q-Resolution for QBF Theorem Proving
3. The QBF Gallery: Behind the Scenes
4. Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
5. Primal and Dual Encoding from Applications into Quantified Boolean Formulas
6. Contributions to the Theory of Practical Quantified Boolean Formula Solving
7. Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
8. Variable Independence and Resolution Paths for Quantified Boolean Formulas
9. Generalized Conflict-Clause Strengthening for Satisfiability Solvers
10. Careful Ranking of Multiple Solvers with Timeouts and Ties
11. Zero-One Designs Produce Small Hard SAT Instances
12. Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces
13. Verifying Propositional Unsatisfiability: Pitfalls to Avoid
14. Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs
15. Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
16. Using the TPTP Language for Writing Derivations and Finite Interpretations
17. Input Distance and Lower Bounds for Propositional Resolution Proof Length
18. Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
19. Stream Surface Generation for Fluid Flow Solutions on Curvilinear Grids
20. Partitioning methods for satisfiability testing on large formulas
21. Foundations of aggregation in deductive databases
22. Optimizing active databases using the split technique (Preliminary Report)
23. Producing and verifying extremely large propositional refutations: Have your cake and eat it too
24. Another look at graph coloring via propositional satisfiability
25. Toward leaner binary-clause reasoning in a satisfiability solver
26. Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination
27. Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
28. Combining vision and computer graphics for video motion capture
29. Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
30. Variable Independence and Resolution Paths for Quantified Boolean Formulas
31. Generalized Conflict-Clause Strengthening for Satisfiability Solvers
32. Careful Ranking of Multiple Solvers with Timeouts and Ties
33. Zero-One Designs Produce Small Hard SAT Instances
34. Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy
35. Verifying Propositional Unsatisfiability: Pitfalls to Avoid
36. A propositional theorem prover to solve planning and other problems
37. Lemma and cut strategies for propositional model elimination
38. Using the TPTP Language for Writing Derivations and Finite Interpretations
39. Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
40. Independently Checkable Proofs from Decision Procedures: Issues and Progress
41. Input Distance and Lower Bounds for Propositional Resolution Proof Length
42. Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
43. Independently Checkable Proofs from Decision Procedures: Issues and Progress
44. Deriving constraints among argument sizes in logic programs
45. A perspective on certain polynomial-time solvable classes of satisfiability
46. Satisfiability testing with more reasoning and less guessing
47. The well-founded semantics for general logic programs
48. Direct Volume Rendering with Shading via Three-Dimensional Textures
49. Combining Preorder and Postorder Resolution in a Satisfiability Solver
50. Complexity analysis of propositional resolution with autarky pruning
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.