<--- Back to Details
First PageDocument Content
Operations research / Constraint programming / Logic in computer science / Electronic design automation / Formal methods / Satisfiability Modulo Theories / Solver / Boolean satisfiability problem / Constraint satisfaction / Theoretical computer science / Applied mathematics / Mathematics
Date: 2007-03-14 18:49:09
Operations research
Constraint programming
Logic in computer science
Electronic design automation
Formal methods
Satisfiability Modulo Theories
Solver
Boolean satisfiability problem
Constraint satisfaction
Theoretical computer science
Applied mathematics
Mathematics

Tool-Support for the Analysis of Hybrid Systems and Models

Add to Reading List

Source URL: www.date-conference.com

Download Document from Source Website

File Size: 236,82 KB

Share Document on Facebook

Similar Documents

1  Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP)

DocID: 1ukgD - View Document

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

DocID: 1rsZm - View Document

Curriculum Vitae: Alexis C. Kaporis  Contact information Address :  Phone:

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

DocID: 1roWY - View Document

A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin

A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin

DocID: 1rd10 - View Document

Microsoft PowerPoint - perspCompatibility Mode]

Microsoft PowerPoint - perspCompatibility Mode]

DocID: 1r0cq - View Document