Theory and Applications of Satisfiability Testing: 8th International Conference, Sat 2005, St Andrews, Uk, June 19-23, 2005: Proceedings
|Abstract||This book constitutes the refereed proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing, SAT 2005, held in St Andrews, Scotland in June 2005. The 26 revised full papers presented together with 16 revised short papers presented as posters during the technical programme were carefully selected from 73 submissions. The whole spectrum of research in propositional and quantified Boolean formula satisfiability testing is covered including proof systems, search techniques, probabilistic analysis of algorithms and their properties, problem encodings, industrial applications, specific tools, case studies, and empirical results|
|Keywords||Propositional calculus Decision making Computer algorithms|
|Buy the book||$44.01 used (64% off) $61.03 new (39% off) $119.00 direct from Amazon Amazon page|
|Call number||QA9.3.S3653 2005|
|Through your library||Configure|
Similar books and articles
Holger H. Hoos & David G. Mitchell (eds.) (2005). Theory and Applications of Satisfiability Testing: 7th International Conference, Sat 2004, Vancouver, Bc, Canada, May 10-13, 2004: Revised Selected Papers. [REVIEW] Springer.
Ofer Strichman & Stefan Szeider (eds.) (2010). Theory and Applications of Satisfiability Testing-- Sat 2010: 13th International Conference, Sat 2010 Edinburgh, Uk, July 2010: Proceedings. [REVIEW] Springer.
O. B. Lupanov (ed.) (2005). Stochastic Algorithms: Foundations and Applications: Third International Symposium, Saga 2005, Moscow, Russia, October 20-22, 2005: Proceedings. [REVIEW] Springer.
V. Di Gesù, F. Masulli & Alfredo Petrosino (eds.) (2006). Fuzzy Logic and Applications: 5th International Workshop, Wilf 2003, Naples, Italy, October 9-11, 2003: Revised Selected Papers. [REVIEW] Springer.
Adam Kolany (2010). Reversed Resolution in Reducing General Satisfiability Problem. Studia Logica 95 (3).
Alessandro Armando (ed.) (2002). Frontiers of Combining Systems: 4th International Workshop, Frocos 2002, Santa Margherita Ligure, Italy, April 8-10, 2002: Proceedings. [REVIEW] Springer.
G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde (2002). Satisfiability Testing for Boolean Formulas Using Δ-Trees. Studia Logica 72 (1):85 - 112.
V. W. Marek (2009). Introduction to Mathematics of Satisfiability. Taylor & Francis.
H. Kirchner & Christophe Ringeissen (eds.) (2000). Frontiers of Combining Systems: Third International Workshop, Frocos 2000, Nancy, France, March 22-24, 2000: Proceedings. [REVIEW] Springer.
Franz Baader & Ulrike Sattler (2001). An Overview of Tableau Algorithms for Description Logics. Studia Logica 69 (1):5-40.
A. Blackwell, K. Marriott & A. Shimojima (eds.) (2004). Diagrammatic Representation and Inference. Springer.
Nathan Segerlind (2007). The Complexity of Propositional Proofs. Bulletin of Symbolic Logic 13 (4):417-481.
Patrick Blackburn & Edith Spaan (1993). A Modal Perspective on the Computational Complexity of Attribute Value Grammar. Journal of Logic, Language and Information 2 (2):129-169.
Sorry, there are not enough data points to plot this chart.
Added to index2011-06-02
Total downloads2 ( #232,684 of 549,754 )
Recent downloads (6 months)0
How can I increase my downloads?