<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Computational complexity theory / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Constraint programming / Planning Domain Definition Language / Boolean satisfiability problem / Satisfiability modulo theories / Hybrid system
Date: 2018-09-27 16:37:21
Theoretical computer science
Mathematics
Computational complexity theory
Logic in computer science
Electronic design automation
Formal methods
NP-complete problems
Constraint programming
Planning Domain Definition Language
Boolean satisfiability problem
Satisfiability modulo theories
Hybrid system

SMT-Based Nonlinear PDDL+ Planning

Add to Reading List

Source URL: scungao.github.io

Download Document from Source Website

File Size: 631,37 KB

Share Document on Facebook

Similar Documents

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

DocID: 1ukgD - View Document

Theoretical computer science / Mathematics / Computational complexity theory / Operations research / Logic in computer science / Mathematical optimization / NP-complete problems / Boolean algebra / Maximum satisfiability problem / Boolean satisfiability problem / Constraint satisfaction / Solver

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

DocID: 1rsZm - View Document

Theoretical computer science / Computational complexity theory / Mathematics / Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Symposium on Discrete Algorithms / Approximation algorithm / Random walk / 2-satisfiability

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

DocID: 1roWY - View Document

Mathematics / Theoretical computer science / Abstract algebra / FO / Finite model theory / Sheaf / Boolean satisfiability problem / Uniform space

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

DocID: 1rd10 - View Document

Logic / Mathematical logic / Mathematics / Propositional calculus / Automated theorem proving / Boolean algebra / Syntax / Boolean satisfiability problem / Clause / Valuation / Propositional variable / Unit propagation

Microsoft PowerPoint - perspCompatibility Mode]

DocID: 1r0cq - View Document