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