default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAllen Van Gelder
Person information
- affiliation: University of California, Santa Cruz, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c61]Allen Van Gelder:
Partial Boolean Functions for QBF Semantics. ISAIM 2024: 236-253- 2023
- [c60]Allen Van Gelder:
Subsumption-Linear Q-Resolution for QBF Theorem Proving. WoLLIC 2023: 362-376
2010 – 2019
- 2016
- [j40]Florian Lonsing
, Martina Seidl, Allen Van Gelder:
The QBF Gallery: Behind the scenes. Artif. Intell. 237: 92-114 (2016) - 2015
- [i1]Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBF Gallery: Behind the Scenes. CoRR abs/1508.01045 (2015) - 2014
- [j39]Mikolas Janota, Charles Jordan, Will Klieber, Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games. J. Satisf. Boolean Model. Comput. 9(1): 187-206 (2014) - 2013
- [c59]Allen Van Gelder:
Primal and Dual Encoding from Applications into Quantified Boolean Formulas. CP 2013: 694-707 - [c58]Florian Lonsing, Uwe Egly, Allen Van Gelder:
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. SAT 2013: 100-115 - [e1]Matti Järvisalo, Allen Van Gelder:
Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings. Lecture Notes in Computer Science 7962, Springer 2013, ISBN 978-3-642-39070-8 [contents] - 2012
- [j38]Allen Van Gelder:
Producing and verifying extremely large propositional refutations - Have your cake and eat it too. Ann. Math. Artif. Intell. 65(4): 329-372 (2012) - [j37]Allen Van Gelder:
Contrasat - A Contrarian SAT Solver. J. Satisf. Boolean Model. Comput. 8(3/4): 117-122 (2012) - [c57]Allen Van Gelder:
Contributions to the Theory of Practical Quantified Boolean Formula Solving. CP 2012: 647-663 - [c56]Allen Van Gelder, Samuel B. Wood, Florian Lonsing:
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas. SAT 2012: 86-99 - [c55]Allen Van Gelder:
Vortex core detection: back to basics. Visualization and Data Analysis 2012: 829413 - 2011
- [j36]Tino Weinkauf, Holger Theisel, Allen Van Gelder, Alex T. Pang:
Stable Feature Flow Fields. IEEE Trans. Vis. Comput. Graph. 17(6): 770-780 (2011) - [c54]Allen Van Gelder:
Variable Independence and Resolution Paths for Quantified Boolean Formulas. CP 2011: 789-803 - [c53]Alexandra Goultiaeva, Allen Van Gelder, Fahiem Bacchus:
A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas. IJCAI 2011: 546-553 - [c52]Allen Van Gelder:
Careful Ranking of Multiple Solvers with Timeouts and Ties. SAT 2011: 317-328 - [c51]Allen Van Gelder:
Generalized Conflict-Clause Strengthening for Satisfiability Solvers. SAT 2011: 329-342 - 2010
- [c50]Allen Van Gelder, Ivor T. A. Spence:
Zero-One Designs Produce Small Hard SAT Instances. SAT 2010: 388-397
2000 – 2009
- 2009
- [j35]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) - [c49]Allen Van Gelder:
Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces. SAT 2009: 141-146 - 2008
- [j34]Allen Van Gelder:
Another look at graph coloring via propositional satisfiability. Discret. Appl. Math. 156(2): 230-243 (2008) - [c48]Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder:
Clause Learning Can Effectively P-Simulate General Propositional Resolution. AAAI 2008: 283-290 - [c47]Allen Van Gelder:
Verifying RUP Proofs of Propositional Unsatisfiability. ISAIM 2008 - [c46]Alisa Neeman, Rebecca M. Brannon, Boris Jeremic, Allen Van Gelder, Alex Pang:
Decomposition and Visualization of Fourth-Order Elastic-Plastic Tensors. VG/PBG@SIGGRAPH 2008: 121-128 - 2007
- [c45]Allen Van Gelder:
Verifying Propositional Unsatisfiability: Pitfalls to Avoid. SAT 2007: 328-333 - 2006
- [c44]Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Allen Van Gelder:
Using the TPTP Language for Writing Derivations and Finite Interpretations. IJCAR 2006: 67-81 - [c43]Allen Van Gelder, Geoff Sutcliffe:
Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation. IJCAR 2006: 156-161 - [c42]Allen Van Gelder:
Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs. SAT 2006: 48-53 - 2005
- [j33]Allen Van Gelder:
Toward leaner binary-clause reasoning in a satisfiability solver. Ann. Math. Artif. Intell. 43(1): 239-253 (2005) - [c41]Allen Van Gelder:
Independently Checkable Proofs from Decision Procedures: Issues and Progress. LPAR 2005: 1 - [c40]Allen Van Gelder:
Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning. LPAR 2005: 580-594 - [c39]Allen Van Gelder:
Input Distance and Lower Bounds for Propositional Resolution Proof Length. SAT 2005: 282-293 - 2004
- [j32]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
- [j31]John V. Franco, Allen Van Gelder:
A perspective on certain polynomial-time solvable classes of satisfiability. Discret. Appl. Math. 125(2-3): 177-214 (2003) - [j30]Jane Wilhelms, Allen Van Gelder:
Combining vision and computer graphics for video motion capture. Vis. Comput. 19(6): 360-376 (2003) - 2002
- [c38]Allen Van Gelder:
Generalizations of Watched Literals for Backtracking Search. AI&M 2002 - [c37]Allen Van Gelder:
Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution. AI&M 2002 - [c36]Maryann Simmons, Jane Wilhelms, Allen Van Gelder:
Model-based reconstruction for creature animation. Symposium on Computer Animation 2002: 139-146 - 2001
- [j29]Allen Van Gelder:
Combining Preorder and Postorder Resolution in a Satisfiability Solver. Electron. Notes Discret. Math. 9: 115-128 (2001) - [j28]Jane Wilhelms, Allen Van Gelder:
Fast and Easy Reach-Cone Joint Limits. J. Graphics, GPU, & Game Tools 6(2): 27-41 (2001) - [c35]Allen Van Gelder:
Stream Surface Generation for Fluid Flow Solutions on Curvilinear Grids. VisSym 2001: 95-106 - 2000
- [b2]Sara Baase, Allen Van Gelder:
Computer Algorithms - Introduction to Design and Analysis (3. ed., repr. with corr.). Pearson / Prentice Hall 2000, ISBN 978-0-201-61244-8, pp. I-XIX, 1-688 - [j27]Tai Joon Park, Allen Van Gelder:
Partitioning Methods for Satisfiability Testing on Large Formulas. Inf. Comput. 162(1-2): 179-184 (2000) - [c34]Fumiaki Okushi, Allen Van Gelder:
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination. AI&M 2000 - [c33]Jane Wilhelms, Allen Van Gelder, L. Atkinson-Derman, A. Luo:
Human Motion from Active Contours. Workshop on Human Motion 2000: 155-160
1990 – 1999
- 1999
- [j26]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) - [j25]Allen Van Gelder, Fumiaki Okushi:
Lemma and cut strategies for propositional model elimination. Ann. Math. Artif. Intell. 26(1-4): 113-132 (1999) - [j24]Allen Van Gelder:
Complexity Analysis of Propositional Resolution with Autarky Pruning. Discret. Appl. Math. 96-97: 195-221 (1999) - [j23]Allen Van Gelder:
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy. J. Autom. Reason. 23(2): 137-193 (1999) - [c32]Allen Van Gelder, Vivek Verma, Jane Wilhelms:
Volume Decimation of Irregular Tetrahedral Grids. Computer Graphics International 1999: 222- - 1998
- [j22]Allen Van Gelder:
Approximate Simulation of Elastic Membranes by Triangulated Spring Meshes. J. Graphics, GPU, & Game Tools 3(2): 21-41 (1998) - 1997
- [c31]Allen Van Gelder, Jane Wilhelms:
An Interactive Fur Modeling Technique. Graphics Interface 1997: 181-188 - [c30]Allen Van Gelder, Jane Wilhelms:
Varying spring constants for accurate simulation of elastic materials. SIGGRAPH Visual Proceedings 1997: 153 - [c29]Jane Wilhelms, Allen Van Gelder:
Anatomically based modeling. SIGGRAPH 1997: 173-180 - 1996
- [c28]Tai Joon Park, Allen Van Gelder:
Partitioning Methods for Satisfiability Testing on Large Formulas. CADE 1996: 748-762 - [c27]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 - [c26]Allen Van Gelder, Kwansik Kim:
Direct Volume Rendering with Shading via Three-Dimensional Textures. VVS 1996: 23-30 - 1995
- [j21]Allen Van Gelder, Jane Wilhelms:
Corrigendum: Topological Considerations in Isosurface Generation. ACM Trans. Graph. 14(3): 307-308 (1995) - [c25]Jane Wilhelms, Allen Van Gelder:
Multi-Dimensional Trees for Controlled Volume Rendering and Compression. VVS 1995: 27-34 - 1994
- [j20]Allen Van Gelder, Jane Wilhelms:
Topological considerations in isosurface generation. ACM Trans. Graph. 13(4): 337-375 (1994) - 1993
- [j19]Allen Van Gelder:
The Alternating Fixpoint of Logic Programs with Negation. J. Comput. Syst. Sci. 47(1): 185-221 (1993) - [j18]Allen Van Gelder, John S. Schlipf:
Commonsense Axiomatizations for Logic Programs. J. Log. Program. 17(2/3&4): 161-195 (1993) - [c24]Allen Van Gelder, Yumi K. Tsuji:
Satisfiability testing with more reasoning and less guessing. Cliques, Coloring, and Satisfiability 1993: 559-586 - [c23]Allen Van Gelder:
Foundations of Aggregation in Deductive Databases. DOOD 1993: 13-34 - [c22]Allen Van Gelder:
Multiple Join Size Estimation by Virtual Domains. PODS 1993: 180-189 - [c21]Kjell Post, Allen Van Gelder, James Kerr:
Deterministic Parsing of Languages with Dynamic Operators. ILPS 1993: 456-472 - [c20]Allen Van Gelder, Jane Wilhelms:
Rapid Exploration of Curvilinear Grids Using Direct Volume Rendering. IEEE Visualization 1993: 70-77 - 1992
- [j17]Allen Van Gelder:
Short Note: Van Gelder's Response. J. Log. Program. 14(1&2): 185 (1992) - [j16]Jane Wilhelms, Allen Van Gelder:
Octrees for Faster Isosurface Generation. ACM Trans. Graph. 11(3): 201-227 (1992) - [c19]Rosana S. G. Lanzelotte, Mohamed Zaït, Allen Van Gelder:
Measuring the effectiveness of optimization. Search Strategies. BDA 1992: 162- - [c18]Serge Abiteboul, Allen Van Gelder:
Optimizing active databases using the SPLIT technique. BDA 1992: 204- - [c17]Serge Abiteboul, Allen Van Gelder:
Optimizing Active Databases using the Split Technique. ICDT 1992: 171-187 - [c16]Allen Van Gelder:
The Well-Founded Semantics of Aggregation. PODS 1992: 127-138 - [c15]Allen Van Gelder, Jane Wilhelms:
Interactive Visualization of Flow Fields. VVS 1992: 47-54 - 1991
- [j15]Allen Van Gelder:
Deriving Constraints Among Argument Sizes in Logic Programs. Ann. Math. Artif. Intell. 3(2-4): 361-392 (1991) - [j14]Allen Van Gelder, Kenneth A. Ross, John S. Schlipf:
The Well-Founded Semantics for General Logic Programs. J. ACM 38(3): 620-650 (1991) - [j13]Allen Van Gelder, Rodney W. Topor:
Safety and Translation of Relational Calculus Queries. ACM Trans. Database Syst. 16(2): 235-278 (1991) - [c14]Kirack Sohn, Allen Van Gelder:
Termination Detection in Logic Programs using Argument Sizes. PODS 1991: 216-226 - [c13]Jane Wilhelms, Allen Van Gelder:
A coherent projection approach for direct volume rendering. SIGGRAPH 1991: 275-284 - 1990
- [j12]Allen Van Gelder:
Modeling Simultaneous Events with Default Reasoning and Tight Derivations. J. Log. Program. 8(1): 41-52 (1990) - [c12]Allen Van Gelder:
A New Form of Circumscription for Logic Programs (Extended Abstract). LPNMR 1990: 170-177 - [c11]Allen Van Gelder:
Deriving Constraints Among Argument Sizes in Logic Programs. PODS 1990: 47-60 - [c10]Jane Wilhelms, Allen Van Gelder:
Octrees for faster isosurface generation. VVS 1990: 57-62 - [c9]Jane Wilhelms, Allen Van Gelder:
Topological considerations in isosurface generation extended abstract. VVS 1990: 79-86
1980 – 1989
- 1989
- [j11]Allen Van Gelder:
Negation as Failure using Tight Derivations for General Logic Programs. J. Log. Program. 6(1&2): 109-133 (1989) - [j10]David Peleg, Allen Van Gelder:
Packet Distribution on a Ring. J. Parallel Distributed Comput. 6(3): 558-567 (1989) - [j9]Allen Van Gelder:
PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms. IEEE Trans. Computers 38(2): 289-292 (1989) - [c8]Allen Van Gelder:
The Alternating Fixpoint of Logic Programs with Negation. PODS 1989: 1-10 - 1988
- [j8]Jeffrey D. Ullman, Allen Van Gelder:
Parallel Complexity of Logical Query Programs. Algorithmica 3: 5-42 (1988) - [j7]Allen Van Gelder:
A Satisfiability Tester for Non-clausal Propositional Calculus. Inf. Comput. 79(1): 1-21 (1988) - [j6]Jeffrey D. Ullman, Allen Van Gelder:
Efficient tests for top-down termination of logical rules. J. ACM 35(2): 345-373 (1988) - [c7]Allen Van Gelder, Kenneth A. Ross, John S. Schlipf:
Unfounded Sets and Well-Founded Semantics for General Logic Programs. PODS 1988: 221-230 - [p1]Allen Van Gelder:
Negation as Failure Using Tight Derivations for General Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 149-176 - 1987
- [j5]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) - [j4]Allen Van Gelder:
Efficient Loop Detection in Prolog using the Tortoise-and-Hare Technique. J. Log. Program. 4(1): 23-31 (1987) - [c6]Allen Van Gelder, Rodney W. Topor:
Safety and Correct Translation of Relational Calculus Formulas. PODS 1987: 313-327 - 1986
- [b1]Allen Van Gelder:
Logic programming for parallel implementation. Stanford University, USA, 1986 - [c5]Jeffrey D. Ullman, Allen Van Gelder:
Parallel Complexity of Logical Query Programs. FOCS 1986: 438-454 - [c4]Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder:
Design Overview of the NAIL! System. ICLP 1986: 554-568 - [c3]Allen Van Gelder:
A Message Passing Framework for Logical Query Evaluation. SIGMOD Conference 1986: 155-165 - [c2]Allen Van Gelder:
Negation as Failure Using Tight Derivations for General Logic Programs. SLP 1986: 127-138 - 1984
- [j3]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) - [c1]Allen Van Gelder:
A Satisfiability Tester for Non-Clausal Propositional Calculus. CADE 1984: 101-112
1970 – 1979
- 1977
- [j2]Allen Van Gelder:
Structured Programming in Cobol: An Approach for Application Programmers. Commun. ACM 20(1): 2-12 (1977)
1960 – 1969
- 1967
- [j1]Allen Van Gelder:
Some New Results in Pseudo-Random Number Generation. J. ACM 14(4): 785-792 (1967)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
