<--- Back to Details
First PageDocument Content
Theoretical computer science / Constraint programming / Software engineering / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Satisfiability modulo theories / Solver / Boolean satisfiability problem / DPLL algorithm / Constraint satisfaction problem
Date: 2017-09-02 14:08:49
Theoretical computer science
Constraint programming
Software engineering
Electronic design automation
Formal methods
Logic in computer science
NP-complete problems
Satisfiability modulo theories
Solver
Boolean satisfiability problem
DPLL algorithm
Constraint satisfaction problem

Visualizing SMT-Based Parallel Constraint Solving Jelena Budakovic, Matteo Marescotti, Antti E. J. Hyv¨arinen, and Natasha Sharygina Universit` a della Svizzera italiana, Switzerland Abstract

Add to Reading List

Source URL: smt-workshop.cs.uiowa.edu

Download Document from Source Website

File Size: 755,62 KB

Share Document on Facebook

Similar Documents

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

DocID: 1xUdh - View Document

PDF Document

DocID: 1xSrV - View Document

Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka

Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka

DocID: 1vleR - View Document

Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email:  September 1995

Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995

DocID: 1v7SC - View Document

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be

DocID: 1v72L - View Document