|
- Hans van Maaren and Linda van Norden.
Sums of Squares, Satisfiability and Maximum Satisfiability. Springer Lecture Notes in Computer Science.
SAT 2005 Springer LNCS 3569 (2005), 293-307.
[ .pdf ]
- Hans van Maaren and Linda van Norden.
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances.
Annals of Mathematics and Artificial Intelligence 44 (2005), 157-177.
[ .pdf ]
- Marijn Heule and Hans van Maaren. Aligning CNF- and
Equivalence-Reasoning. Proceedings of the Seventh International
Conference on Theory and Applications of Satisfiability Testing.
Vancouver, Holger H. Hoos, David G. Mitchell editors (2004).
- Hans van Maaren and Linda van Norden. Hidden threshold Phenomena
for Fixed Density random Sat formulae. E. Giunchiglia and A.
Tacchella (Eds): SAT 2003, Lecture Notes in Computer Science 2919.
Springer - Verlag Berlin Heidelberg (2004), 135-149.
[ .pdf ]
- E. de Klerk and H. Van Maaren. On semi definite programming
relaxations of (2+p)-SAT. Annals of Mathematics and Artificial
Intelligence 37 (2003), 285-305.
- Hans van Maaren and Joost P. Warners. Solving satisfiability problems
using elliptic approximations. A note on volumes and weights. Annals
of Mathematics and Artificial Intelligence 37 (2003), 273-283.
-
Linda van Norden and Hans van Maaren. A linear Programming
Based Satisfiability Solver Using a New Horn-Driven Search Tree
Design. Springer Lecture Notes of Computer Science 2470:
Principles and Practice of Constraint Programming (2002), 775-776.
[ .pdf ]
-
E. de Klerk and J.P. Warners.
Semidefinite programming relaxations for MAX 2-SAT and 3-SAT: Computational perspectives.
In Combinatorial and Global Optimization, P.M. Pardalos, A. Migdalas, and R.E. Burkard (eds.), Series on Applied Optimization
14, World Scientific Publishers, April 2002, ISBN 981-02-4802-4.
[ link ]
-
Joost P. Warners, Hans van Maaren. Solving satisfiability
problems using elliptic approximations. Effective branching rules.
Discrete Applied Mathematics 107 (2000), 241-259.
- Hans van Maaren, Joost P. Warners. Bounds and fast approximation
algorithms for binary quadratic optimization problems with
application to MAX 2SAT. Discrete Applied Mathematics 107
(2000), 225-239.
- Hans van Maaren. A Short note on Some Tractable Cases of the
Satisfiability Problem. Information and Computation 158,
125-130 (2000).
- E. de Klerk, H. van Maaren and J.P. Warners. Relaxations of the
Satisfiability Problem Using Semidefinite Programming. In ''SAT
2000, Highlights of Satisfiability Research in the Year 2000''.
IOS-Press, Frontiers in Artificial Intelligence and Applications.
vol. 63 Editors: Ian Gent, Hans van Maaren
and Toby Walsh. (2000). 189-213.
-
E. de Klerk, H. van Maaren, J.P. Warners. Relaxations of
the Satisfiability Problem Using Semidefinite Programming.
Journal of Automated Reasoning 24 (2000)
37-65.
- Joost P. Warners, Hans van Maaren. Recognition of tractable
satisfiability problems through balanced polynomial representations.
Discrete Applied Mathematics 99/1-3 (2000), 229-244.
- Hans van Maaren. Elliptic approximations of propositional formula.
''The Satisfiability Problem and Boolean Functions''. Guest
Editors: Franco, Gallo, Kleine Buening, Speckenmeijer, Boros and
Hammer. Topics in Discrete Mathematics, 10 (1999).
- Hans van Maaren. Elliptic approximations of propositional
formulae. Discrete Applied Mathematics 96-97 (1999),
223-244.
-
Joost P. Warners, Hans van Maaren. A two-phase algorithm
for solving a class of hard satisfiability problems. Operations
Research Letters 23 (1998), 81-88.
-
Joost P. Warners. A linear-time transformation of linear
inequalities into conjunctive normal form. Information Processing Letters
68 (2) (1998), 63-69.
- Hans van Maaren. On the Use of Second Order Derivatives for the
Satisfiability Problem. DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, vol. 35 (1997), 677-687.
-
Jan Friso Groote, Hans van Maaren. Equivalence of the
Concave Optimization method and d'Agostino's Tableaux for
Propositional Logic. ISCIS XI, Proceedings of The eleventh
International Symposium on Computer and Information Sciences.
Antalya, Turkey, Eds V. Atalay et al. (1996),
41-51.
-
H. van Maaren, Jan Friso Groote and Michiel Rozema. Verification
of propositional formulae by means of convex and concave transforms.
Proceedings of the fourth international symposium on artificial
intelligence and mathematics, AI/MATH-96. Fort Lauderdale, Florida,
AT&T Bell Laboratories, 146-149.
|
Publications
