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