Allen Van Gelder

Affiliations:
  • University of California, Santa Cruz, USA


According to our database1, Allen Van Gelder authored at least 94 papers between 1967 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Subsumption-Linear Q-Resolution for QBF Theorem Proving.
Proceedings of the Logic, Language, Information, and Computation, 2023

2016
The QBF Gallery: Behind the scenes.
Artif. Intell., 2016

2014
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games.
J. Satisf. Boolean Model. Comput., 2014

2013
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Primal and Dual Encoding from Applications into Quantified Boolean Formulas.
Proceedings of the Principles and Practice of Constraint Programming, 2013

2012
Contrasat - A Contrarian SAT Solver.
J. Satisf. Boolean Model. Comput., 2012

Producing and verifying extremely large propositional refutations - Have your cake and eat it too.
Ann. Math. Artif. Intell., 2012

Vortex core detection: back to basics.
Proceedings of the Visualization and Data Analysis 2012, 2012

Extended Failed-Literal Preprocessing for Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Contributions to the Theory of Practical Quantified Boolean Formula Solving.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
Stable Feature Flow Fields.
IEEE Trans. Vis. Comput. Graph., 2011

Generalized Conflict-Clause Strengthening for Satisfiability Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Careful Ranking of Multiple Solvers with Timeouts and Ties.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas.
Proceedings of the IJCAI 2011, 2011

Variable Independence and Resolution Paths for Quantified Boolean Formulas.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010
Zero-One Designs Produce Small Hard SAT Instances.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

2009
Using PVsolve to Analyze and Locate Positions of Parallel Vectors.
IEEE Trans. Vis. Comput. Graph., 2009

Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
Another look at graph coloring via propositional satisfiability.
Discret. Appl. Math., 2008

Decomposition and Visualization of Fourth-Order Elastic-Plastic Tensors.
Proceedings of the Eurographics / IEEE VGTC Symposium on Volume and Point-Based Graphics, 2008

Verifying RUP Proofs of Propositional Unsatisfiability.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Clause Learning Can Effectively P-Simulate General Propositional Resolution.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Verifying Propositional Unsatisfiability: Pitfalls to Avoid.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006
Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Using the TPTP Language for Writing Derivations and Finite Interpretations.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005
Toward leaner binary-clause reasoning in a satisfiability solver.
Ann. Math. Artif. Intell., 2005

Input Distance and Lower Bounds for Propositional Resolution Proof Length.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning.
Proceedings of the Logic for Programming, 2005

Independently Checkable Proofs from Decision Procedures: Issues and Progress.
Proceedings of the Logic for Programming, 2005

2004
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination.
Ann. Math. Artif. Intell., 2004

2003
Combining vision and computer graphics for video motion capture.
Vis. Comput., 2003

A perspective on certain polynomial-time solvable classes of satisfiability.
Discret. Appl. Math., 2003

2002
Model-based reconstruction for creature animation.
Proceedings of the 2002 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, 2002

Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2002

Generalizations of Watched Literals for Backtracking Search.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2002

2001
Fast and Easy Reach-Cone Joint Limits.
J. Graphics, GPU, & Game Tools, 2001

Combining Preorder and Postorder Resolution in a Satisfiability Solver.
Electron. Notes Discret. Math., 2001

Stream Surface Generation for Fluid Flow Solutions on Curvilinear Grids.
Proceedings of the 3rd Joint Eurographics - IEEE TCVG Symposium on Visualization, 2001

2000
Partitioning Methods for Satisfiability Testing on Large Formulas.
Inf. Comput., 2000

Human Motion from Active Contours.
Proceedings of the Workshop on Human Motion, 2000

Computer Algorithms - Introduction to Design and Analysis (3. ed., repr. with corr.).
Pearson / Prentice Hall, ISBN: 978-0-201-61244-8, 2000

1999
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy.
J. Autom. Reason., 1999

Complexity Analysis of Propositional Resolution with Autarky Pruning.
Discret. Appl. Math., 1999

Lemma and cut strategies for propositional model elimination.
Ann. Math. Artif. Intell., 1999

A propositional theorem prover to solve planning and other problems.
Ann. Math. Artif. Intell., 1999

Volume Decimation of Irregular Tetrahedral Grids.
Proceedings of the Computer Graphics International Conference, CGI 1999, Canmore, Alberta, 1999

1998
Approximate Simulation of Elastic Membranes by Triangulated Spring Meshes.
J. Graphics, GPU, & Game Tools, 1998

1997
Anatomically based modeling.
Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, 1997

Varying spring constants for accurate simulation of elastic materials.
Proceedings of the ACM SIGGRAPH 97 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH '97, 1997

An Interactive Fur Modeling Technique.
Proceedings of the Graphics Interface 1997 Conference, 1997

1996
Direct Volume Rendering with Shading via Three-Dimensional Textures.
Proceedings of the Proceeding of the 1996 Symposium on Volume Visualization, 1996

Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids.
Proceedings of the 7th IEEE Visualization Conference, 1996

1995
Corrigendum: Topological Considerations in Isosurface Generation.
ACM Trans. Graph., 1995

Multi-Dimensional Trees for Controlled Volume Rendering and Compression.
Proceedings of the 1994 Symposium on Volume Visualization, 1995

1994
Topological considerations in isosurface generation.
ACM Trans. Graph., 1994

1993
Commonsense Axiomatizations for Logic Programs.
J. Log. Program., 1993

The Alternating Fixpoint of Logic Programs with Negation.
J. Comput. Syst. Sci., 1993

Rapid Exploration of Curvilinear Grids Using Direct Volume Rendering.
Proceedings of the 4th IEEE Visualization Conference, 1993

Deterministic Parsing of Languages with Dynamic Operators.
Proceedings of the Logic Programming, 1993

Multiple Join Size Estimation by Virtual Domains.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

Foundations of Aggregation in Deductive Databases.
Proceedings of the Deductive and Object-Oriented Databases, Third International Conference, 1993

Satisfiability testing with more reasoning and less guessing.
Proceedings of the Cliques, 1993

1992
Octrees for Faster Isosurface Generation.
ACM Trans. Graph., 1992

Short Note: Van Gelder's Response.
J. Log. Program., 1992

Interactive Visualization of Flow Fields.
Proceedings of the 1992 Workshop on Volume Visualization, 1992

The Well-Founded Semantics of Aggregation.
Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992

Measuring the effectiveness of optimization. Search Strategies.
Proceedings of the VIIIèmes Journées Bases de Données Avancées, 1992

Optimizing active databases using the SPLIT technique.
Proceedings of the VIIIèmes Journées Bases de Données Avancées, 1992

1991
Safety and Translation of Relational Calculus Queries.
ACM Trans. Database Syst., 1991

The Well-Founded Semantics for General Logic Programs.
J. ACM, 1991

Deriving Constraints Among Argument Sizes in Logic Programs.
Ann. Math. Artif. Intell., 1991

A coherent projection approach for direct volume rendering.
Proceedings of the 18th Annual Conference on Computer Graphics and Interactive Techniques, 1991

Termination Detection in Logic Programs using Argument Sizes.
Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

1990
Modeling Simultaneous Events with Default Reasoning and Tight Derivations.
J. Log. Program., 1990

Topological considerations in isosurface generation extended abstract.
Proceedings of the 1990 Workshop on Volume Visualization, 1990

A New Form of Circumscription for Logic Programs (Extended Abstract).
Proceedings of the Workshop Logic Programming and Non-Monotonic Logic, 1990

1989
PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms.
IEEE Trans. Computers, 1989

Packet Distribution on a Ring.
J. Parallel Distributed Comput., 1989

Negation as Failure using Tight Derivations for General Logic Programs.
J. Log. Program., 1989

1988
A Satisfiability Tester for Non-clausal Propositional Calculus
Inf. Comput., October, 1988

Efficient tests for top-down termination of logical rules.
J. ACM, 1988

Parallel Complexity of Logical Query Programs.
Algorithmica, 1988

Unfounded Sets and Well-Founded Semantics for General Logic Programs.
Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1988

Negation as Failure Using Tight Derivations for General Logic Programs.
Proceedings of the Foundations of Deductive Databases and Logic Programming, 1988

1987
Efficient Loop Detection in Prolog using the Tortoise-and-Hare Technique.
J. Log. Program., 1987

YAWN! (Yet Another Window on NAIL!).
IEEE Data Eng. Bull., 1987

Safety and Correct Translation of Relational Calculus Formulas.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

1986
Logic programming for parallel implementation.
PhD thesis, 1986

A Message Passing Framework for Logical Query Evaluation.
Proceedings of the 1986 ACM SIGMOD International Conference on Management of Data, 1986

Design Overview of the NAIL! System.
Proceedings of the Third International Conference on Logic Programming, 1986

1984
System/U: A Database System Based on the Universal Relation Assumption.
ACM Trans. Database Syst., 1984

1977
Structured Programming in Cobol: An Approach for Application Programmers.
Commun. ACM, 1977

1967
Some New Results in Pseudo-Random Number Generation.
J. ACM, 1967


  Loading...