Theory and Applications of Satisfiability Testing: 8th International Conference, Sat 2005, St Andrews, Uk, June 19-23, 2005: Proceedings
Fahiem Bacchus & Toby Walsh (eds.)
Springer (2005)
| 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 | |||||||||
| Categories | ||||||||||
| Buy the book | $119.00 direct from Amazon Amazon page | |||||||||
| Call number | QA9.3.S3653 2005 | |||||||||
| ISBN(s) | 3540262768 9783540262763 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,709 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesAdam Kolany (2010). Reversed Resolution in Reducing General Satisfiability Problem. Studia Logica 95 (3).
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.
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.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2011-06-02Total downloads2 ( #232,684 of 549,754 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
