01056nam2-2200349---450-99000341371020331620100616150841.0978-1-4073-0613-1000341371USA01000341371(ALEPH)000341371USA0100034137120100616d2009----km-y0itay50------baengGBa---||||001yy<<The>> Urnfield Culture in continental CroatiaSnjezana KaravanicOxfordArcheopress2009VII, 233 p.ill.30 cmBAR International series2036001000018484BAR International series2001ArcheologiaCroaziaBNCF939.8KARAVANIC,Snjexana607983ITsalbcISBD990003413710203316XI.5. Coll. 12/709221307 LMXI.5.00264764BKUMASENATORE9020100616USA011508Urnfield Culture in continental Croatia1125761UNISA03416nam 2200697Ia 450 991096677140332120200520144314.01-4416-1678-01-60750-376-X600-00-1439-2(CKB)1000000000765302(EBL)448770(SSID)ssj0000338455(PQKBManifestationID)11254932(PQKBTitleCode)TC0000338455(PQKBWorkID)10295806(PQKB)10382127(Au-PeEL)EBL448770(CaPaEBR)ebr10309230(CaONFJC)MIL577647(OCoLC)491253312(MiAaPQ)EBC448770(EXLCZ)99100000000076530220081220d2009 uy 0engur|n|---|||||txtccrHandbook of satisfiability /edited by Armin Biere ... [et al.]1st ed.Amsterdam, The Netherlands ;Washington, DC IOS Pressc20091 online resource (980 p.)Frontiers in artificial intelligence and applications,0922-6389 ;v. 185Description based upon print version of record.1-58603-929-6 Includes bibliographical references and indexes.Title page; Contents; Part I. Theory and Algorithms; Chapter 1. A History of Satisfiability; Chapter 2. CNF Encodings; Chapter 3. Complete Algorithms; Chapter 4. CDCL Solvers; Chapter 5. Look-Ahead Based SAT Solvers; Chapter 6. Incomplete Algorithms; Chapter 7. Fundaments of Branching Heuristics; Chapter 8. Random Satisfiability; Chapter 9. Exploiting Runtime Variation in Complete Solvers; Chapter 10. Symmetry and Satisfiability; Chapter 11. Minimal Unsatisfiability and Autarkies; Chapter 12. Worst-Case Upper Bounds; Chapter 13. Fixed-Parameter TractabilityPart II. Applications and ExtensionsChapter 14. Bounded Model Checking; Chapter 15. Planning and SAT; Chapter 16. Software Verification; Chapter 17. Combinatorial Designs by SAT Solvers; Chapter 18. Connections to Statistical Physics; Chapter 19. MaxSAT; Chapter 20. Model Counting; Chapter 21. Non-Clausal SAT and ATPG; Chapter 22. Pseudo-Boolean and Cardinality Constraints; Chapter 23. QBF Theory; Chapter 24. QBFs reasoning; Chapter 25. SAT Techniques for Modal and Description Logics; Chapter 26. Satisfiability Modulo Theories; Chapter 27. Stochastic Boolean Satisfiability; Subject IndexCited Author IndexContributing Authors and AffiliationsA collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers.Frontiers in artificial intelligence and applications ;v. 185.Propositional calculusCongressesDecision makingCongressesComputer algorithmsCongressesAlgebra, BooleanCongressesPropositional calculusDecision makingComputer algorithmsAlgebra, Boolean006.3ST 125rvkST 300rvkBiere Armin1193224MiAaPQMiAaPQMiAaPQBOOK9910966771403321Handbook of satisfiability4381938UNINA