<--- Back to Details
First PageDocument Content
Constraint programming / Logic in computer science / Automated theorem proving / Electronic design automation / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Uninterpreted function / Decision problem / Theoretical computer science / Mathematics / Applied mathematics
Date: 2012-05-29 03:59:19
Constraint programming
Logic in computer science
Automated theorem proving
Electronic design automation
NP-complete problems
Satisfiability Modulo Theories
Boolean satisfiability problem
Uninterpreted function
Decision problem
Theoretical computer science
Mathematics
Applied mathematics

Add to Reading List

Source URL: research.microsoft.com

Download Document from Source Website

File Size: 267,13 KB

Share Document on Facebook

Similar Documents

EE365: Dynamic Programming Proof 1 Markov decision problem find policy µ = (µ0 , . . . , µT −1 ) that minimizes

DocID: 1v845 - View Document

Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata Nathalie Bertrand1 , Thomas Brihaye2 , and Blaise Genest3 1 3

DocID: 1v4hH - View Document

Available online at www.sciencedirect.com Motor control is decision-making Daniel M Wolpert1 and Michael S Landy2 Motor behavior may be viewed as a problem of maximizing the utility of movement outcome in the face of se

DocID: 1uXwJ - View Document

WATI Assistive Technology Decision Making Guide Area of Concern ________________________________________________________________ Problem Identification Student’s Abilities/Difficulties

DocID: 1uLnf - View Document

ABCs of the Bomber Problem and its Relatives Richard Weber Abstract In a classic Markov decision problem of Derman, Lieberman, and Rossan investor has an initial capital x from which to make investments, the oppo

DocID: 1uFWS - View Document