default search action
Journal of Automated Reasoning (JAR), Volume 24
Volume 24, Numbers 1/2, February 2000
- Ian P. Gent, Toby Walsh:
Satisfiability in the Year 2000. 1-3 - Miron Abramovici, José T. de Sousa:
A SAT Solver Using Reconfigurable Hardware and Virtual Logic. 5-36 - Etienne de Klerk, Hans van Maaren, Joost P. Warners:
Relaxations of the Satisfiability Problem Using Semidefinite Programming. 37-65 - Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. Kautz:
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. 67-100 - Jan Friso Groote, Joost P. Warners:
The Propositional Formula Checker HeerHugo. 101-125 - Edward A. Hirsch:
SAT Local Search Algorithms: Worst-Case Study. 127-143 - Wolfgang Küchlin, Carsten Sinz:
Proving Consistency Assertions for Automotive Product Data Management. 145-163 - Fabio Massacci, Laura Marraro:
Logical Cryptanalysis as a SAT Problem. 165-203 - Patrick Mills, Edward P. K. Tsang:
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems. 205-223 - Irina Rish, Rina Dechter:
Resolution versus Search: Two Strategies for SAT. 225-275 - Hantao Zhang, Mark E. Stickel:
Implementing the Davis-Putnam Method. 277-296
Volume 24, Number 3, April 2000
- Peter Balsiger, Alain Heuerding, Stefan Schwendimann:
A Benchmark Method for the Propositional Modal Logics K, KT, S4. 297-317 - Fabio Massacci:
Single Step Tableaux for Modal Logics. 319-364 - R. Padmanabhan, P. Penner:
A Hyperbase for Binary Lattice Hyperidentities. 365-370 - Geoff Sutcliffe:
The CADE-16 ATP System Competition. 371-396
Volume 24, Number 4, May 2000
- Edward A. Hirsch:
New Worst-Case Upper Bounds for SAT. 397-420 - Holger H. Hoos, Thomas Stützle:
Local Search Algorithms for SAT: An Empirical Evaluation. 421-481 - E. Thomas Richards, Barry Richards:
Nonsystematic Search and No-Good Learning. 483-533
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.