Solving difficult SAT instances in the presence of symmetry

Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks [10] can be solved in seconds on commodity PCs. More recent benchmarks take longer to solve because of their large size, but are still...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annual ACM IEEE Design Automation Conference: Proceedings of the 39th conference on Design automation : New Orleans, Louisiana, USA; 10-14 June 2002 s. 731 - 736
Hlavní autori:	Aloul, Fadi A., Ramani, Arathi, Markov, Igor L., Sakallah, Karem A.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 10.06.2002
Edícia:	ACM Conferences
Predmet:	Applied sciences Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms > Algebraic algorithms Electronics Exact sciences and technology Integrated circuits Integrated circuits by function (including memories and processors) Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices faster search instances symmetry speed-up SAT difficult CNF
ISBN:	1581134614, 9781581134612
ISSN:	0738-100X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!