Allen van Gelder

Available identifiers

zbMath Open van-gelder.allenMaRDI QIDQ1104094

List of research outcomes

Publication	Date of Publication	Type
Subsumption-linear Q-resolution for QBF theorem proving	2024-02-28	Paper
Partitioning methods for satisfiability testing on large formulas	2019-01-15	Paper
The QBF Gallery: behind the scenes	2016-05-20	Paper
https://portal.mardi4nfdi.de/entity/Q3194801	2015-10-20	Paper
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas	2013-08-12	Paper
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation	2013-08-05	Paper
Contributions to the Theory of Practical Quantified Boolean Formula Solving	2013-01-08	Paper
Producing and verifying extremely large propositional refutations	2012-12-12	Paper
Variable Independence and Resolution Paths for Quantified Boolean Formulas	2011-09-23	Paper
Careful Ranking of Multiple Solvers with Timeouts and Ties	2011-06-17	Paper
Generalized Conflict-Clause Strengthening for Satisfiability Solvers	2011-06-17	Paper
Zero-One Designs Produce Small Hard SAT Instances	2010-09-29	Paper
Using the TPTP Language for Writing Derivations and Finite Interpretations	2009-03-12	Paper
Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation	2009-03-12	Paper
Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning	2008-05-27	Paper
Another look at graph coloring via propositional satisfiability	2008-01-21	Paper
Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs	2007-09-04	Paper
Theory and Applications of Satisfiability Testing	2005-12-15	Paper
Toward leaner binary-clause reasoning in a satisfiability solver	2005-05-13	Paper
Persistent and quasi-persistent lemmas in propositional model elimination	2004-05-27	Paper
Fast and Easy Reach-Cone Joint Limits	2003-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q4534955	2003-08-10	Paper
A perspective on certain polynomial-time solvable classes of satisfiability	2003-03-09	Paper
Partitioning methods for satisfiability testing on large formulas	2003-01-14	Paper
A tutorial on the well-founded semantics	2001-11-06	Paper
https://portal.mardi4nfdi.de/entity/Q2741518	2001-09-24	Paper
Complexity analysis of propositional resolution with autarky pruning	2000-06-13	Paper
A propositional theorem prover to solve planning and other problems	2000-06-07	Paper
Lemma and cut strategies for propositional model elimination	2000-06-07	Paper
Autarky pruning in propositional model elimination reduces failure redundancy	1999-11-25	Paper
Deriving constraints among argument sizes in logic programs	1997-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q5687274	1997-08-19	Paper
The well-founded semantics for general logic programs	1994-11-13	Paper
Commonsense axiomatizations for logic programs	1994-01-13	Paper
The alternating fixpoint of logic programs with negation	1993-10-10	Paper
Octrees for faster isosurface generation	1993-04-01	Paper
Van Gelder's response	1992-11-10	Paper
Modeling simultaneous events with default reasoning and tight derivations	1990-01-01	Paper
PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms	1989-01-01	Paper
Negation as failure using tight derivations for general logic programs	1989-01-01	Paper
Parallel complexity of logical query programs	1988-01-01	Paper
A satisfiability tester for non-clausal propositional calculus	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3348436	1988-01-01	Paper
Efficient loop detection in prolog using the tortoise-and-hare technique	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3336732	1984-01-01	Paper
Structured programming in Cobol	1977-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Allen van Gelder