| Publication | Date of Publication | Type |
|---|
Subsumption-linear Q-resolution for QBF theorem proving
Logic, Language, Information, and Computation | 2024-02-28 | Paper |
Partitioning methods for satisfiability testing on large formulas
Automated Deduction — Cade-13 | 2019-01-15 | Paper |
The QBF Gallery: behind the scenes
Artificial Intelligence | 2016-05-20 | Paper |
| Contrasat -- a contrarian SAT solver | 2015-10-20 | Paper |
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Contributions to the theory of practical quantified Boolean formula solving
Lecture Notes in Computer Science | 2013-01-08 | Paper |
Producing and verifying extremely large propositional refutations
Annals of Mathematics and Artificial Intelligence | 2012-12-12 | Paper |
Variable independence and resolution paths for quantified Boolean formulas
Principles and Practice of Constraint Programming – CP 2011 | 2011-09-23 | Paper |
Careful ranking of multiple solvers with timeouts and ties
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Generalized conflict-clause strengthening for satisfiability solvers
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Zero-One Designs Produce Small Hard SAT Instances
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
Using the TPTP Language for Writing Derivations and Finite Interpretations
Automated Reasoning | 2009-03-12 | Paper |
Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
Automated Reasoning | 2009-03-12 | Paper |
Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Another look at graph coloring via propositional satisfiability
Discrete Applied Mathematics | 2008-01-21 | Paper |
Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Toward leaner binary-clause reasoning in a satisfiability solver
Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
Persistent and quasi-persistent lemmas in propositional model elimination
Annals of Mathematics and Artificial Intelligence | 2004-05-27 | Paper |
Fast and Easy Reach-Cone Joint Limits
Journal of Graphics Tools | 2003-08-25 | Paper |
| scientific article; zbMATH DE number 1754556 (Why is no real title available?) | 2003-08-10 | Paper |
A perspective on certain polynomial-time solvable classes of satisfiability
Discrete Applied Mathematics | 2003-03-09 | Paper |
Partitioning methods for satisfiability testing on large formulas
Information and Computation | 2003-01-14 | Paper |
A tutorial on the well-founded semantics
Programming and Computer Software | 2001-11-06 | Paper |
| Combining preorder and postorder resolution in a satisfiability solver | 2001-09-24 | Paper |
Complexity analysis of propositional resolution with autarky pruning
Discrete Applied Mathematics | 2000-06-13 | Paper |
A propositional theorem prover to solve planning and other problems
Annals of Mathematics and Artificial Intelligence | 2000-06-07 | Paper |
Lemma and cut strategies for propositional model elimination
Annals of Mathematics and Artificial Intelligence | 2000-06-07 | Paper |
Autarky pruning in propositional model elimination reduces failure redundancy
Journal of Automated Reasoning | 1999-11-25 | Paper |
Deriving constraints among argument sizes in logic programs
Annals of Mathematics and Artificial Intelligence | 1997-10-27 | Paper |
| scientific article; zbMATH DE number 956865 (Why is no real title available?) | 1997-08-19 | Paper |
The well-founded semantics for general logic programs
Journal of the ACM | 1994-11-13 | Paper |
Commonsense axiomatizations for logic programs
The Journal of Logic Programming | 1994-01-13 | Paper |
The alternating fixpoint of logic programs with negation
Journal of Computer and System Sciences | 1993-10-10 | Paper |
Octrees for faster isosurface generation
ACM Transactions on Graphics | 1993-04-01 | Paper |
Van Gelder's response
The Journal of Logic Programming | 1992-11-10 | Paper |
Modeling simultaneous events with default reasoning and tight derivations
The Journal of Logic Programming | 1990-01-01 | Paper |
Negation as failure using tight derivations for general logic programs
The Journal of Logic Programming | 1989-01-01 | Paper |
PRAM processor allocation: a hidden bottleneck in sublogarithmic algorithms
IEEE Transactions on Computers | 1989-01-01 | Paper |
Parallel complexity of logical query programs
Algorithmica | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4199654 (Why is no real title available?) | 1988-01-01 | Paper |
A satisfiability tester for non-clausal propositional calculus
Information and Computation | 1988-01-01 | Paper |
Efficient loop detection in prolog using the tortoise-and-hare technique
The Journal of Logic Programming | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3870637 (Why is no real title available?) | 1984-01-01 | Paper |
Structured programming in Cobol
Communications of the ACM | 1977-01-01 | Paper |
