Papers by Allen Van Gelder

README

2011 A Uniform Approach for Generating Proofs and Strategies for both True and False QBF Formulas strategies.pdf strategies.bib
2011 Careful Ranking of Multiple Solvers with Timeouts and Ties careful.pdf careful.bib
2011 Generalized Conflict-Clause Strengthening for Satisfiability Solvers generalized.pdf generalized.bib
2011 Stable Feature Flow Fields stableFFF.pdf stableFFF.bib
2010 Zero-One Designs Produce Small Hard SAT Instances sgen2-sat10.pdf sgen2-sat10.bib
2009 Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces ccmin-avg-sat09.pdf ccmin-avg-sat09.bib
2009 Report on Relaxed Jordan Canonical Form for Computer Animation and Visualization rjcfTR.pdf rjcfTR.bib
2009 Using PVsolve to Analyze and Locate Positions of Parallel Vectors pvsolve-preprint.pdf pvsolve-preprint.bib
2009 Using PVsolve to Analyze and Locate Positions of Parallel Vectors pvsolve.pdf pvsolve.bib
2008 Another Look at Graph Coloring via Propositional Satisfiability colorsat02.pdf colorsat02.bib
2008 Another Look at Graph Coloring via Propositional Satisfiability colorsat07.pdf colorsat07.bib
2008 Clause Learning Can Effectively P-Simulate General Propositional Resolution eff-p-sim-aaai08.pdf eff-p-sim-aaai08.bib
2008 Decomposition and Visualization of Fourth-Order Elastic-Plastic Tensors tensors-vg08-long.pdf tensors-vg08-long.bib
2008 Verifying RUP Proofs of Propositional Unsatisfiability proofs-isaim08.pdf proofs-isaim08.bib
2007 Verifying Propositional Unsatisfiability: Pitfalls to Avoid proofs-sat07.pdf proofs-sat07.bib
2006 Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs cover-number-short.pdf cover-number-short.bib
2006 Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs cover-number.pdf cover-number.bib
2005 Input Distance and Lower Bounds for Propositional Resolution Proof Length input-dist.pdf input-dist.bib
2005 Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning pool-res.pdf pool-res.bib
2005 Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver leaner05.pdf leaner05.bib
2004 Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination amai04.pdf amai04.bib
2003 A Perspective on Certain Polynomial Time Solvable Classes of Satisfiability franco-vg.pdf franco-vg.bib
2002 Combining Vision and Computer Graphics for Video Motion Capture fs02.pdf fs02.bib
2002 Decision Procedures Should Be Able to Produce (Easily) Checkable Proofs need-proofs.pdf need-proofs.bib
2002 Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution sat-pre-post.pdf sat-pre-post.bib
2002 Generalizations of Watched Literals for Backtracking Search watched-lits.pdf watched-lits.bib
2002 Interactive Video-Based Motion Capture for Character Animation hawaii02.pdf hawaii02.bib
2001 Combining Preorder and Postorder Resolution in a Satisfiability Solver lics01-sat.pdf lics01-sat.bib
2001 Efficient Spherical Joint Limits with Reach Cones jtl-tr.pdf jtl-tr.bib
2001 Fast and Easy Reach-Cone Joint Limits jtl.pdf jtl.bib
2001 Stream Surface Generation for Fluid Flow Solutions on Curvilinear Grids streamsurf01.pdf streamsurf01.bib
2000 Human Motion from Active Contours human00.pdf human00.bib
2000 Lemmas in Propositional Model Search and Refutation Search sat2000.pdf sat2000.bib
2000 Partitioning Methods for Satisfiability Testing on Large Formulas partition-IC.pdf partition-IC.bib
1999 A Propositional Theorem Prover to Solve Planning and Other Problems planning-dist.pdf planning-dist.bib
1999 Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy aut-jar-dist.pdf aut-jar-dist.bib
1999 Complexity Analysis of Propositional Resolution with Autarky Pruning modoc-ub-dist.pdf modoc-ub-dist.bib
1999 Lemma and Cut Strategies for Propositional Model Elimination lemmas-dist.pdf lemmas-dist.bib
1999 Volume Decimation of Irregular Tetrahedral Grids decimation-cgi99.pdf decimation-cgi99.bib
1998 A Tutorial on the Well-Founded Semantics wftut.pdf wftut.bib
1998 Approximate Simulation of Elastic Membranes by Triangulated Spring Meshes elastic-tools-1.pdf elastic-tools-1.bib
1998 Propositional Search with $k$-Clause Introduction Can Be Polynomially Simulated by Resolution poly-res.pdf poly-res.bib
1997 An Interactive Fur Modeling Technique fur_gi.pdf fur_gi.bib
1997 Anatomically Based Modeling anatomy97.pdf anatomy97.bib
1996 Direct Volume Rendering with Shading via 3D Textures voltx96.pdf voltx96.bib
1996 Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids vis96.pdf vis96.bib
1996 Partitioning Methods for Satisfiability Testing on Large Formulas partition-cade13.pdf partition-cade13.bib
1996 Satisfiability Testing with More Reasoning and Less Guessing kclose-tr.pdf kclose-tr.bib
1995 Efficient Computation of Polygon Area and Polyhedron Volume gg95.pdf gg95.bib
1994 Doing It with Mirrors: Low Budget Stereo Graphics mirrors94.pdf mirrors94.bib
1994 Multi-Dimensional Trees for Controlled Volume Rendering and Compression mdh94.pdf mdh94.bib
1994 Topological Considerations in Isosurface Generation ambig94.pdf ambig94.bib
1993 Common-Sense Axiomatizations for Logic Programs wfax.pdf wfax.bib
1993 Deterministic Parsing of Languages with Dynamic Operators ddgen93.pdf ddgen93.bib
1993 Foundations of Aggregation in Deductive Databases aggll-preprint.pdf aggll-preprint.bib
1993 Incomplete Thoughts about Incomplete Satisfiability Procedures incomplete.pdf incomplete.bib
1993 Rapid Exploration of Curvilinear Grids Using Direct Volume Rendering vis93.pdf vis93.bib
1993 The Alternating Fixpoint of Logic Programs with Negation altfpjcss.pdf altfpjcss.bib
1992 Interactive Animated Visualization of Flow Fields flow92.pdf flow92.bib
1992 Interactive Animated Visualization of Flow Fields volvis92.pdf volvis92.bib
1992 Octrees for Faster Isosurface Generation oct92.pdf oct92.bib
1992 The well-founded semantics of aggregation pods92.pdf pods92.bib
1991 A Coherent Projection Approach for Direct Volume Rendering proj91.pdf proj91.bib
1991 Deriving Constraints Among Argument Sizes in Logic Programs chu91.pdf chu91.bib
1991 Safety and translation of relational calculus formulas safety91.pdf safety91.bib
1991 Termination Detection in Logic Programs using Argument Sizes termab91.pdf termab91.bib
1991 The Well-Founded Semantics for General Logic Programs wf.pdf wf.bib
1990 A New Form of Circumscription for Logic Programs wfcircum90.pdf wfcircum90.bib
1990 Modeling simultaneous events with default reasoning and tight derivations jlp90.pdf jlp90.bib
1989 Negation as Failure Using Tight Derivations for General Logic Programs jlp89.pdf jlp89.bib
1989 PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms pram89.pdf pram89.bib
1989 Packet Distribution on a Ring packet89.pdf packet89.bib
1988 Parallel Complexity of Logical Query Programs parallel88.pdf parallel88.bib
1988 A Satisfiability Tester for Non-Clausal Propositional Calculus satIC1988.pdf satIC1988.bib
1988 Efficient tests for top-down termination of logical rules jacm88.pdf jacm88.bib
1987 Efficient loop detection in Prolog using the tortoise and hare technique jlp87.pdf jlp87.bib
1987 Safety and correct translation of relational calculus formulas safety87.pdf safety87.bib
1986 A message passing framework for logical query evaluation sigmod86.pdf sigmod86.bib
1986 Design overview of the Nail! system nail86.pdf nail86.bib

Questions regarding about page content should be directed to

webmaster@cse.ucsc.edu

Last modified .