Allen Van Gelder

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
82Variable Independence and Resolution Paths for Quantified Boolean Formulas. Allen Van Gelder. CP 2011, 789-803. Web SearchBibTeXDownload
81Stable Feature Flow Fields. Tino Weinkauf, Holger Theisel, Allen Van Gelder, Alex T. Pang. IEEE Trans. Vis. Comput. Graph. (17): 770-780 (2011). Web SearchBibTeXDownload
80A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas. Alexandra Goultiaeva, Allen Van Gelder, Fahiem Bacchus. IJCAI 2011, 546-553. Web SearchBibTeXDownload
79Careful Ranking of Multiple Solvers with Timeouts and Ties. Allen Van Gelder. SAT 2011, 317-328. Web SearchBibTeXDownload
78Generalized Conflict-Clause Strengthening for Satisfiability Solvers. Allen Van Gelder. SAT 2011, 329-342. Web SearchBibTeXDownload
2010
77Zero-One Designs Produce Small Hard SAT Instances. Allen Van Gelder, Ivor Spence. SAT 2010, 388-397. Web SearchBibTeXDownload
2009
76Using PVsolve to Analyze and Locate Positions of Parallel Vectors. Allen Van Gelder, Alex Pang. IEEE Trans. Vis. Comput. Graph. (15): 682-695 (2009). Web SearchBibTeXDownload
75Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces. Allen Van Gelder. SAT 2009, 141-146. Web SearchBibTeXDownload
2008
74Clause Learning Can Effectively P-Simulate General Propositional Resolution. Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder. AAAI 2008, 283-290. Web SearchBibTeX
73Another look at graph coloring via propositional satisfiability. Allen Van Gelder. Discrete Applied Mathematics (156): 230-243 (2008). Web SearchBibTeXDownload
72Decomposition and Visualization of Fourth-Order Elastic-Plastic Tensors. Alisa Neeman, Rebecca M. Brannon, Boris Jeremic, Allen Van Gelder, Alex Pang. Volume Graphics 2008, 121-128. Web SearchBibTeXDownload
2007
71Verifying Propositional Unsatisfiability: Pitfalls to Avoid. Allen Van Gelder. SAT 2007, 328-333. Web SearchBibTeXDownload
2006
70Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation. Allen Van Gelder, Geoff Sutcliffe. IJCAR 2006, 156-161. Web SearchBibTeXDownload
69Using the TPTP Language for Writing Derivations and Finite Interpretations. Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Allen Van Gelder. IJCAR 2006, 67-81. Web SearchBibTeXDownload
68Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs. Allen Van Gelder. SAT 2006, 48-53. Web SearchBibTeXDownload
2005
67Toward leaner binary-clause reasoning in a satisfiability solver. Allen Van Gelder. Ann. Math. Artif. Intell. (43): 239-253 (2005). Web SearchBibTeXDownload
66Independently Checkable Proofs from Decision Procedures: Issues and Progress. Allen Van Gelder. LPAR 2005, 1. Web SearchBibTeXDownload
65Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning. Allen Van Gelder. LPAR 2005, 580-594. Web SearchBibTeXDownload
64Input Distance and Lower Bounds for Propositional Resolution Proof Length. Allen Van Gelder. SAT 2005, 282-293. Web SearchBibTeXDownload
2004
63Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination. Fumiaki Okushi, Allen Van Gelder. Ann. Math. Artif. Intell. (40): 373-402 (2004). Web SearchBibTeXDownload
2003
62A perspective on certain polynomial-time solvable classes of satisfiability. John V. Franco, Allen Van Gelder. Discrete Applied Mathematics (125): 177-214 (2003). Web SearchBibTeXDownload
61Combining vision and computer graphics for video motion capture. Jane Wilhelms, Allen Van Gelder. The Visual Computer (19): 360-376 (2003). Web SearchBibTeXDownload
2002
60Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution. Allen Van Gelder. AMAI 2002. Web SearchBibTeXDownload
59Generalizations of Watched Literals for Backtracking Search. Allen Van Gelder. AMAI 2002. Web SearchBibTeXDownload
2001
58Combining Preorder and Postorder Resolution in a Satisfiability Solver. Allen Van Gelder. Electronic Notes in Discrete Mathematics (9): 115-128 (2001). Web SearchBibTeXDownload
2000
57Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination. Fumiaki Okushi, Allen Van Gelder. AMAI 2000. Web SearchBibTeXDownload
56Partitioning Methods for Satisfiability Testing on Large Formulas. Tai Joon Park, Allen Van Gelder. Inf. Comput. (162): 179-184 (2000). Web SearchBibTeXDownload
55Human Motion from Active Contours. Jane Wilhelms, Allen Van Gelder, L. Atkinson-Derman, A. Luo. Workshop on Human Motion 2000, 155-160. Web SearchBibTeXDownload
1999
54A propositional theorem prover to solve planning and other problems. Allen Van Gelder, Fumiaki Okushi. Ann. Math. Artif. Intell. (26): 87-112 (1999). Web SearchBibTeXDownload
53Lemma and cut strategies for propositional model elimination. Allen Van Gelder, Fumiaki Okushi. Ann. Math. Artif. Intell. (26): 113-132 (1999). Web SearchBibTeXDownload
52Volume Decimation of Irregular Tetrahedral Grids. Allen Van Gelder, Vivek Verma, Jane Wilhelms. Computer Graphics International 1999, 222. Web SearchBibTeXDownload
51Complexity Analysis of Propositional Resolution with Autarky Pruning. Allen Van Gelder. Discrete Applied Mathematics (96-97): 195-221 (1999). Web SearchBibTeXDownload
50Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy. Allen Van Gelder. J. Autom. Reasoning (23): 137-193 (1999). Web SearchBibTeXDownload
1997
49An Interactive Fur Modeling Technique. Allen Van Gelder, Jane Wilhelms. Graphics Interface 1997, 181-188. Web SearchBibTeX
48Anatomically based modeling. Jane Wilhelms, Allen Van Gelder. SIGGRAPH 1997, 173-180. Web SearchBibTeXDownload
1996
47Partitioning Methods for Satisfiability Testing on Large Formulas. Tai Joon Park, Allen Van Gelder. CADE 1996, 748-762. Web SearchBibTeXDownload
46Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids. Jane Wilhelms, Allen Van Gelder, Paul Tarantino, Jonathan Gibbs. IEEE Visualization 1996, 57-64. Web SearchBibTeXDownload
45Direct Volume Rendering with Shading via Three-Dimensional Textures. Allen Van Gelder, Kwansik Kim. VVS 1996, 23. Web SearchBibTeXDownload
1995
44Corrigendum: Topological Considerations in Isosurface Generation. Allen Van Gelder, Jane Wilhelms. ACM Trans. Graph. (14): 307-308 (1995). Web SearchBibTeXDownload
43Multi-Dimensional Trees for Controlled Volume Rendering and Compression. Jane Wilhelms, Allen Van Gelder. VVS 1995, 27-34. Web SearchBibTeXDownload
1994
42Topological considerations in isosurface generation. Allen Van Gelder, Jane Wilhelms. ACM Trans. Graph. (13): 337-375 (1994). Web SearchBibTeXDownload
1993
41Foundations of Aggregation in Deductive Databases. Allen Van Gelder. DOOD 1993, 13-34. Web SearchBibTeXDownload
40Rapid Exploration of Curvilinear Grids Using Direct Volume Rendering. Allen Van Gelder, Jane Wilhelms. IEEE Visualization 1993, 70-77. Web SearchBibTeXDownload
39Deterministic Parsing of Languages with Dynamic Operators. Kjell Post, Allen Van Gelder, James Kerr. ILPS 1993, 456-472. Web SearchBibTeX
38The Alternating Fixpoint of Logic Programs with Negation. Allen Van Gelder. J. Comput. Syst. Sci. (47): 185-221 (1993). Web SearchBibTeXDownload
37Commonsense Axiomatizations for Logic Programs. Allen Van Gelder, John S. Schlipf. J. Log. Program. (17): 161-195 (1993). Web SearchBibTeXDownload
36Multiple Join Size Estimation by Virtual Domains. Allen Van Gelder. PODS 1993, 180-189. Web SearchBibTeX
1992
35Octrees for Faster Isosurface Generation. Jane Wilhelms, Allen Van Gelder. ACM Trans. Graph. (11): 201-227 (1992). Web SearchBibTeXDownload
34Optimizing active databases using the SPLIT technique. Serge Abiteboul, Allen Van Gelder. BDA 1992, 204. Cited by 11Web SearchBibTeX
33Measuring the effectiveness of optimization. Search Strategies. Rosana S. G. Lanzelotte, Mohamed Zaït, Allen Van Gelder. BDA 1992, 162. Web SearchBibTeX
32Optimizing Active Databases using the Split Technique. Serge Abiteboul, Allen Van Gelder. ICDT 1992, 171-187. Web SearchBibTeXDownload
31Short Note: Van Gelder's Response. Allen Van Gelder. J. Log. Program. (14): 185 (1992). Web SearchBibTeXDownload
30The Well-Founded Semantics of Aggregation. Allen Van Gelder. PODS 1992, 127-138. Web SearchBibTeX
29Interactive Visualization of Flow Fields. Allen Van Gelder, Jane Wilhelms. VVS 1992, 47-54. Web SearchBibTeXDownload
1991
28Safety and Translation of Relational Calculus Queries. Allen Van Gelder, Rodney W. Topor. ACM Trans. Database Syst. (16): 235-278 (1991). Web SearchBibTeXDownload
27Deriving Constraints Among Argument Sizes in Logic Programs. Allen Van Gelder. Ann. Math. Artif. Intell. (3): 361-392 (1991). Web SearchBibTeXDownload
26The Well-Founded Semantics for General Logic Programs. Allen Van Gelder, Kenneth A. Ross, John S. Schlipf. J. ACM (38): 620-650 (1991). Cited by 1595Web SearchBibTeXDownload
25Termination Detection in Logic Programs using Argument Sizes. Kirack Sohn, Allen Van Gelder. PODS 1991, 216-226. Web SearchBibTeX
24A coherent projection approach for direct volume rendering. Jane Wilhelms, Allen Van Gelder. SIGGRAPH 1991, 275-284. Web SearchBibTeXDownload
1990
23Modeling Simultaneous Events with Default Reasoning and Tight Derivations. Allen Van Gelder. J. Log. Program. (8): 41-52 (1990). Web SearchBibTeXDownload
22A New Form of Circumscription for Logic Programs (Extended Abstract). Allen Van Gelder. LPNMR 1990, 170-177. Web SearchBibTeX
21Deriving Constraints Among Argument Sizes in Logic Programs. Allen Van Gelder. PODS 1990, 47-60. Web SearchBibTeX
1989
20PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms. Allen Van Gelder. IEEE Trans. Computers (38): 289-292 (1989). Web SearchBibTeXDownload
19Negation as Failure using Tight Derivations for General Logic Programs. Allen Van Gelder. J. Log. Program. (6): 109-133 (1989). Web SearchBibTeXDownload
18Packet Distribution on a Ring. David Peleg, Allen Van Gelder. J. Parallel Distrib. Comput. (6): 558-567 (1989). Web SearchBibTeXDownload
17The Alternating Fixpoint of Logic Programs with Negation. Allen Van Gelder. PODS 1989, 1-10. Web SearchBibTeX
1988
16Parallel Complexity of Logical Query Programs. Jeffrey D. Ullman, Allen Van Gelder. Algorithmica (3): 5-42 (1988). Cited by 92Web SearchBibTeXDownload
15Negation as Failure Using Tight Derivations for General Logic Programs. Allen Van Gelder. Foundations of Deductive Databases and Logic Programming. 1988, 149-176. Web SearchBibTeX
14A Satisfiability Tester for Non-clausal Propositional Calculus. Allen Van Gelder. Inf. Comput. (79): 1-21 (1988). Web SearchBibTeXDownload
13Efficient tests for top-down termination of logical rules. Jeffrey D. Ullman, Allen Van Gelder. J. ACM (35): 345-373 (1988). Cited by 128Web SearchBibTeXDownload
12Unfounded Sets and Well-Founded Semantics for General Logic Programs. Allen Van Gelder, Kenneth A. Ross, John S. Schlipf. PODS 1988, 221-230. Cited by 4Web SearchBibTeX
1987
11YAWN! (Yet Another Window on NAIL!). Katherine A. Morris, Jeffrey F. Naughton, Yatin P. Saraiya, Jeffrey D. Ullman, Allen Van Gelder. IEEE Data Eng. Bull. (10): 28-43 (1987). Cited by 32Web SearchBibTeXDownload
10Efficient Loop Detection in Prolog using the Tortoise-and-Hare Technique. Allen Van Gelder. J. Log. Program. (4): 23-31 (1987). Web SearchBibTeXDownload
9Safety and Correct Translation of Relational Calculus Formulas. Allen Van Gelder, Rodney W. Topor. PODS 1987, 313-327. Web SearchBibTeX
1986
8Parallel Complexity of Logical Query Programs. Jeffrey D. Ullman, Allen Van Gelder. FOCS 1986, 438-454. Cited by 92Web SearchBibTeXDownload
7Design Overview of the NAIL! System. Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder. ICLP 1986, 554-568. Cited by 124Web SearchBibTeXDownload
6A Message Passing Framework for Logical Query Evaluation. Allen Van Gelder. SIGMOD Conference 1986, 155-165. Web SearchBibTeX
5Negation as Failure Using Tight Derivations for General Logic Programs. Allen Van Gelder. SLP 1986, 127-138. Web SearchBibTeX
1984
4System/U: A Database System Based on the Universal Relation Assumption. Henry F. Korth, Jeffrey D. Ullman, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman. ACM Trans. Database Syst. (9): 331-347 (1984). Cited by 94Web SearchBibTeXDownload
3A Satisfiability Tester for Non-Clausal Propositional Calculus. Allen Van Gelder. CADE 1984, 101-112. Web SearchBibTeXDownload
1977
2Structured Programming in Cobol: An Approach for Application Programmers. Allen Van Gelder. Commun. ACM (20): 2-12 (1977). Web SearchBibTeXDownload
1967
1Some New Results in Pseudo-Random Number Generation. Allen Van Gelder. J. ACM (14): 785-792 (1967). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research