The following pages link to Allen van Gelder (Q1104094):
Displaying 47 items.
- (Q174150) (redirect page) (← links)
- (Q286396) (redirect page) (← links)
- The QBF Gallery: behind the scenes (Q286397) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- A satisfiability tester for non-clausal propositional calculus (Q1111774) (← links)
- Deriving constraints among argument sizes in logic programs (Q1360682) (← links)
- Persistent and quasi-persistent lemmas in propositional model elimination (Q1430298) (← links)
- Toward leaner binary-clause reasoning in a satisfiability solver (Q1777406) (← links)
- Autarky pruning in propositional model elimination reduces failure redundancy (Q1808886) (← links)
- Partitioning methods for satisfiability testing on large formulas (Q1854377) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Complexity analysis of propositional resolution with autarky pruning (Q1961454) (← links)
- A propositional theorem prover to solve planning and other problems (Q1978018) (← links)
- Lemma and cut strategies for propositional model elimination (Q1978019) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- (Q2741518) (← links)
- Extended Failed-Literal Preprocessing for Quantified Boolean Formulas (Q2843325) (← links)
- Careful Ranking of Multiple Solvers with Timeouts and Ties (Q3007693) (← links)
- Generalized Conflict-Clause Strengthening for Satisfiability Solvers (Q3007694) (← links)
- Variable Independence and Resolution Paths for Quantified Boolean Formulas (Q3169452) (← links)
- (Q3194801) (← links)
- (Q3336732) (← links)
- (Q3348436) (← links)
- Modeling simultaneous events with default reasoning and tight derivations (Q3485856) (← links)
- Using the TPTP Language for Writing Derivations and Finite Interpretations (Q3613401) (← links)
- Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation (Q3613406) (← links)
- Efficient loop detection in prolog using the tortoise-and-hare technique (Q3747702) (← links)
- PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms (Q3817606) (← links)
- Negation as failure using tight derivations for general logic programs (Q3821633) (← links)
- Van Gelder's response (Q4015957) (← links)
- Octrees for faster isosurface generation (Q4032290) (← links)
- Structured programming in Cobol (Q4107885) (← links)
- Commonsense axiomatizations for logic programs (Q4275257) (← links)
- The well-founded semantics for general logic programs (Q4302849) (← links)
- Fast and Easy Reach-Cone Joint Limits (Q4405953) (← links)
- (Q4534955) (← links)
- Partitioning methods for satisfiability testing on large formulas (Q4647562) (← links)
- Contributions to the Theory of Practical Quantified Boolean Formula Solving (Q4899301) (← links)
- Zero-One Designs Produce Small Hard SAT Instances (Q4931562) (← links)
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (Q5326456) (← links)
- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning (Q5387867) (← links)
- (Q5687274) (← links)
- Theory and Applications of Satisfiability Testing (Q5713719) (← links)
- Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs (Q5756556) (← links)
- A tutorial on the well-founded semantics (Q5930853) (← links)
