Person: Allen Van Gelder

DBLP: Gelder:Allen_Van

Facilitated 1 volumes:

Ed

Contributed to:

2013

2012

2011

2010

2009

2007

2006

2006

2005

2002

2001

1996

1993

1993

1992

1991

1990

1989

1988

1987

1986

1986

1986

1984

Wrote 26 papers:

SAT-2013-LonsingEG #learning #performance #pseudo #quantifier

Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation (FL, UE, AVG), pp. 100–115.

SAT-2012-GelderWL #preprocessor #quantifier

Extended Failed-Literal Preprocessing for Quantified Boolean Formulas (AVG, SBW, FL), pp. 86–99.

SAT-2011-Gelder #multi #ranking

Careful Ranking of Multiple Solvers with Timeouts and Ties (AVG), pp. 317–328.

SAT-2011-Gelder11a #satisfiability

Generalized Conflict-Clause Strengthening for Satisfiability Solvers (AVG), pp. 329–342.

SAT-2010-GelderS #design #satisfiability

Zero-One Designs Produce Small Hard SAT Instances (AVG, IS), pp. 388–397.

SAT-2009-Gelder #proving

Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces (AVG), pp. 141–146.

SAT-2007-Gelder #satisfiability #verification

Verifying Propositional Unsatisfiability: Pitfalls to Avoid (AVG), pp. 328–333.

IJCAR-2006-GelderS #automation #generative #higher-order #logic #parsing

Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation (AVG, GS), pp. 156–161.

IJCAR-2006-SutcliffeSCG #finite #using

Using the TPTP Language for Writing Derivations and Finite Interpretations (GS, SS, KC, AVG), pp. 67–81.

SAT-2006-Gelder #metric #proving

Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs (AVG), pp. 48–53.

SAT-2005-Gelder #bound #distance #proving

Input Distance and Lower Bounds for Propositional Resolution Proof Length (AVG), pp. 282–293.

SAT-2002-Gelder #reasoning #satisfiability #towards

Toward leaner binary-clause reasoning in a satisfiability solver (AVG), p. 16.

SAT-2001-Gelder #satisfiability

Combining Preorder and Postorder Resolution in a Satisfiability Solver (AVG), pp. 115–128.

CADE-1996-ParkG #clustering #satisfiability #scalability #testing

Partitioning Methods for Satisfiability Testing on Large Formulas (TJP, AVG), pp. 748–762.

ILPS-1993-PostGK #parsing

Deterministic Parsing of Languages with Dynamic Operators (KP, AVG, JK), pp. 456–472.

PODS-1993-Gelder #estimation #multi

Multiple Join Size Estimation by Virtual Domains (AVG), pp. 180–189.

PODS-1992-Gelder #semantics

The Well-Founded Semantics of Aggregation (AVG), pp. 127–138.

PODS-1991-SohnG #detection #logic programming #source code #termination #using

Termination Detection in Logic Programs using Argument Sizes (KS, AVG), pp. 216–226.

PODS-1990-Gelder #constraints #logic programming #source code

Deriving Constraints Among Argument Sizes in Logic Programs (AVG), pp. 47–60.

PODS-1989-Gelder #fixpoint #logic programming #source code

The Alternating Fixpoint of Logic Programs with Negation (AVG), pp. 1–10.

PODS-1988-GelderRS #logic programming #semantics #set #source code

Unfounded Sets and Well-Founded Semantics for General Logic Programs (AVG, KAR, JSS), pp. 221–230.

PODS-1987-GelderT #calculus #relational #safety

Safety and Correct Translation of Relational Calculus Formulas (AVG, RWT), pp. 313–327.

ICLP-1986-MorrisUG86 #design #exclamation #overview

Design Overview of the NAIL! System (KAM, JDU, AVG), pp. 554–568.

SIGMOD-1986-Gelder #evaluation #framework #logic #message passing #query

A Message Passing Framework for Logical Query Evaluation (AVG), pp. 155–165.

SLP-1986-Gelder86 #logic programming #source code #using

Negation as Failure Using Tight Derivations for General Logic Programs (AVG), pp. 127–138.

CADE-1984-Gelder #calculus #satisfiability

A Satisfiability Tester for Non-Clausal Propositional Calculus (AVG), pp. 101–112.