Geschäftskunden Kundenprogramme
Vor Ort
Merkzettel Warenkorb
  • Produktbild: Theory and Applications of Satisfiability Testing – SAT 2016
  • Produktbild: Theory and Applications of Satisfiability Testing – SAT 2016
Band 9710

Theory and Applications of Satisfiability Testing – SAT 2016 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings

Aus der Reihe Lecture Notes in Computer Science

Fr. 73.90

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

12.06.2016

Abbildungen

XXIV, 119 illus., schwarz-weiss Illustrationen

Herausgeber

Nadia Creignou + weitere

Verlag

Springer

Seitenzahl

564

Maße (L/B/H)

23.5/15.5/3.2 cm

Gewicht

879 g

Auflage

1st ed. 2016

Sprache

Englisch

ISBN

978-3-319-40969-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

12.06.2016

Abbildungen

XXIV, 119 illus., schwarz-weiss Illustrationen

Herausgeber

Verlag

Springer

Seitenzahl

564

Maße (L/B/H)

23.5/15.5/3.2 cm

Gewicht

879 g

Auflage

1st ed. 2016

Sprache

Englisch

ISBN

978-3-319-40969-6

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Theory and Applications of Satisfiability Testing – SAT 2016
  • Produktbild: Theory and Applications of Satisfiability Testing – SAT 2016

  • Parameterized Compilation Lower Bounds for Restricted CNF-formulas.- Satisfiability via Smooth Pictures.- Solution-Graphs of Boolean Formulas and Isomorphism.- Strong Backdoors for Default Logic.- The Normalized Autocorrelation Length of Max r-Sat Converges in Probability to (1-1/2=r)/r.- Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle.- Extreme Cases in SAT Problems.- Improved Static Symmetry Breaking for SAT.- Learning Rate Based Branching Heuristic for SAT Solvers.- On the Hardness of SAT with Community Structure.- Trade-offs between Time and Memory in a Tighter Model of CDCL SAT Solvers.- A SAT Approach to Branch Width.- Computing Maximum Unavoidable Subgraphs Using SAT Solvers.- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT.- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer.- Deciding Bit-Vector Formulas with mcSAT.- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams.- Speeding Up the Constraint-Based Method in Difference Logic.- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers.- Finding Finite Models in Multi-Sorted First Order Logic.- MCS Extraction with Sublinear Oracle Queries.- Predicate Elimination for Preprocessing in First-Order Theorem Proving.- Quantified Boolean Formula Incremental Determinization.- Non-prenex QBF Solving using Abstraction.- On Q-Resolution and CDCL QBF Solving.- On Stronger Calculi for QBFs.- Q-Resolution with Generalized Axioms.- 2QBF: Challenges and Solutions.- Dependency Schemes for DQBF.- Lifting QBF Resolution Calculi to DQBF.- Long Distance Q-Resolution with Dependency Schemes.- BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies.- HordeQBF: A Modular and Massively Parallel QBF Solver.- LMHS: A SAT-IP Hybrid MaxSAT Solver.- OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing.- SpyBug: Automated Bug Detection in the Con_guration Space of SAT Solvers.