Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/511
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBeyersdorff, Olaf. ;en_US
dc.contributor.authorWintersteiger, Christoph M. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:17:55Z-
dc.date.available2020-05-17T08:17:55Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319941448 ;en_US
dc.identifier.isbn9783319941431 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/511-
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319941431. ;en_US
dc.descriptionen_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionQA75.5-76.95 ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018. The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of SAT interpreted in a broad sense, including theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications. ;en_US
dc.description.statementofresponsibilityedited by Olaf Beyersdorff, Christoph M. Wintersteiger.en_US
dc.format.extentXIX, 452 p. 73 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10929. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10929. ;en_US
dc.relation.haspart9783319941431.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputer Programmingen_US
dc.subjectSoftware Engineeringen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectComputersen_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectArtificial Intelligenceen_US
dc.subjectComputer Scienceen_US
dc.subjectTheory of Computation. ;en_US
dc.subjectArtificial Intelligence and Roboticsen_US
dc.subjectSoftware Engineeringen_US
dc.subjectProgramming Techniquesen_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectData Structures. ;en_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.titleTheory and Applications of Satisfiability Testing ee SAT 2018en_US
dc.title.alternative21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9ee12, 2018, Proceedings /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319941431.pdf13.08 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBeyersdorff, Olaf. ;en_US
dc.contributor.authorWintersteiger, Christoph M. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:17:55Z-
dc.date.available2020-05-17T08:17:55Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319941448 ;en_US
dc.identifier.isbn9783319941431 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/511-
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319941431. ;en_US
dc.descriptionen_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionQA75.5-76.95 ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018. The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of SAT interpreted in a broad sense, including theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications. ;en_US
dc.description.statementofresponsibilityedited by Olaf Beyersdorff, Christoph M. Wintersteiger.en_US
dc.format.extentXIX, 452 p. 73 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10929. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10929. ;en_US
dc.relation.haspart9783319941431.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputer Programmingen_US
dc.subjectSoftware Engineeringen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectComputersen_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectArtificial Intelligenceen_US
dc.subjectComputer Scienceen_US
dc.subjectTheory of Computation. ;en_US
dc.subjectArtificial Intelligence and Roboticsen_US
dc.subjectSoftware Engineeringen_US
dc.subjectProgramming Techniquesen_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectData Structures. ;en_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.titleTheory and Applications of Satisfiability Testing ee SAT 2018en_US
dc.title.alternative21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9ee12, 2018, Proceedings /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319941431.pdf13.08 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBeyersdorff, Olaf. ;en_US
dc.contributor.authorWintersteiger, Christoph M. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:17:55Z-
dc.date.available2020-05-17T08:17:55Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319941448 ;en_US
dc.identifier.isbn9783319941431 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/511-
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319941431. ;en_US
dc.descriptionen_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionQA75.5-76.95 ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book constitutes the refereed proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018, held in Oxford, UK, in July 2018. The 20 revised full papers, 4 short papers, and 2 tool papers were carefully reviewed and selected from 58 submissions. The papers address different aspects of SAT interpreted in a broad sense, including theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications as well as case studies and reports on findings based on rigorous experimentation. They are organized in the following topical sections: maximum satisfiability; conflict driven clause learning; model counting; quantified Boolean formulae; theory; minimally unsatisfiable sets; satisfiability modulo theories; and tools and applications. ;en_US
dc.description.statementofresponsibilityedited by Olaf Beyersdorff, Christoph M. Wintersteiger.en_US
dc.format.extentXIX, 452 p. 73 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10929. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10929. ;en_US
dc.relation.haspart9783319941431.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputer Programmingen_US
dc.subjectSoftware Engineeringen_US
dc.subjectData structures (Computer science). ;en_US
dc.subjectComputersen_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectArtificial Intelligenceen_US
dc.subjectComputer Scienceen_US
dc.subjectTheory of Computation. ;en_US
dc.subjectArtificial Intelligence and Roboticsen_US
dc.subjectSoftware Engineeringen_US
dc.subjectProgramming Techniquesen_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectData Structures. ;en_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.titleTheory and Applications of Satisfiability Testing ee SAT 2018en_US
dc.title.alternative21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9ee12, 2018, Proceedings /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319941431.pdf13.08 MBAdobe PDFThumbnail
Preview File