<--- Back to Details
First PageDocument Content
Automated theorem proving / Model theory / Logic in computer science / Constraint programming / NP-complete problems / Boolean satisfiability problem / Satisfiability Modulo Theories / DPLL algorithm / Interpretation / Theoretical computer science / Logic / Mathematical logic
Date: 2013-02-07 03:54:46
Automated theorem proving
Model theory
Logic in computer science
Constraint programming
NP-complete problems
Boolean satisfiability problem
Satisfiability Modulo Theories
DPLL algorithm
Interpretation
Theoretical computer science
Logic
Mathematical logic

First-order reasoning in Yices2 Master Thesis in Computer Science Simon Cruanes∗ supervised by Bruno Dutertre †, Viktor Kuncak ‡, Benjamin Werner § SRI International, Menlo Park, CA September 2011 – March 2012

Add to Reading List

Source URL: cedeela.fr

Download Document from Source Website

File Size: 973,50 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