Efficient data structures for backtrack search SAT solvers
Efficient data structures for backtrack search SAT solvers
Boolean Satisfiability Data Structures Backtrack Search Algorithms
137-152
Lynce, Ines
2325eb92-000d-4de6-8e5f-1a35f91e7c45
Marques-Silva, Joao
f992f61f-cedd-4897-9f73-1a3ac7ebb35c
January 2005
Lynce, Ines
2325eb92-000d-4de6-8e5f-1a35f91e7c45
Marques-Silva, Joao
f992f61f-cedd-4897-9f73-1a3ac7ebb35c
Lynce, Ines and Marques-Silva, Joao
(2005)
Efficient data structures for backtrack search SAT solvers.
Annals of Mathematics and Artificial Intelligence, 47 (1), .
Text
jpms-amai05.pdf
- Other
More information
Published date: January 2005
Keywords:
Boolean Satisfiability Data Structures Backtrack Search Algorithms
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 262209
URI: http://eprints.soton.ac.uk/id/eprint/262209
PURE UUID: 15996d28-d1c9-437e-a1ca-d83ab542b971
Catalogue record
Date deposited: 29 Mar 2006
Last modified: 14 Mar 2024 07:07
Export record
Contributors
Author:
Ines Lynce
Author:
Joao Marques-Silva
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics