FORMAL METHODS LECTURE VI BINARY DECISION DIAGRAMS (BDD S)
|
|
- Julie Robinson
- 6 years ago
- Views:
Transcription
1 Alessandro Artale (FM First Semester 2009/2010) p. 1/38 FORMAL METHODS LECTURE VI BINARY DECISION DIAGRAMS (BDD S) Alessandro Artale Faulty of Computer Siene Free University of Bolzano artale/ Some material (text, figures) displayed in these slides is ourtesy of: M. Benereetti, A. Cimatti, M. Fisher, F. Giunhiglia, M. Pistore, M. Roveri, R.Sebastiani.
2 Alessandro Artale (FM First Semester 2009/2010) p. 2/38 Summary of Leture VI Motivations. Ordered Binary Deision Diagrams (OBDD). OBDD s as Canonial Forms. Building OBDD s.
3 Alessandro Artale (FM First Semester 2009/2010) p. 3/38 State Spae Explosion The bottlenek: Exhaustive analysis may require to store all the states of the Kripke struture, and to explore them one-by-one. The state spae may be exponential in the number of omponents and variables (E.g., 300 boolean vars up to states!) State Spae Explosion: Too muh memory required; Too muh CPU time required to explore eah state. A solution: Symboli Model Cheking.
4 Alessandro Artale (FM First Semester 2009/2010) p. 4/38 Symboli Model Cheking: Intuitions Symboli representation of Set of states by formulae in propositional logi. manipulation of sets of states, rather than single states; manipulation of sets of transitions, rather than single transitions.
5 Alessandro Artale (FM First Semester 2009/2010) p. 5/38 Summary Motivations. Ordered Binary Deision Diagrams (OBDD). OBDD s as Canonial Forms. Building OBDD s
6 Alessandro Artale (FM First Semester 2009/2010) p. 6/38 Ordered Binary Deision Diagrams (OBDD) Ordered Binary Deision Diagrams (OBDD) are used to represent formulae in propositional logi. A simple version: Binary Deision Trees: Non-Terminal nodes labeled with boolean variables/propositions; Leaves (terminal nodes) are labeled with either 0 or 1; Two kinds of lines: dashed and solid; Paths leading to 1 represent models, while paths leading to 0 represent ounter-models.
7 Alessandro Artale (FM First Semester 2009/2010) p. 7/38 Binary Deision Trees: An Example BDT representing the formula: ϕ = x y. x y y The assignment, x = 0,y = 0, makes true the formula.
8 Alessandro Artale (FM First Semester 2009/2010) p. 8/38 Binary Deision Trees (BDT) Let T be a BDT, then T determines a unique boolean formula in the following way: Fixed an assignment for the variables in T we start at the root and: If the value of the variable in the urrent node is 1 we follow the solid line; Otherwise, we follow the dashed line; The truth value of the formula is given by the value of the leaf we reah.
9 Alessandro Artale (FM First Semester 2009/2010) p. 9/38 Binary Deision Trees (Cont.) BDT s with multiple ourrenes of a variable along a path are: 1. Rather ineffiient (Redundant paths); 2. Diffiult to hek whether they represent the same formula (equivalene test). Example of two equivalent BDT s x x y z y y x 1 y x z 1 0 1
10 Ordered Deision Trees Ordered Deision Tree (OBDT): from root to leaves variables are enountered always in the same order without repetitions along paths. Example: Ordered Deision tree for ϕ = (a b) ( d) a b b d d d d d d d d Alessandro Artale (FM First Semester 2009/2010) p. 10/38
11 Alessandro Artale (FM First Semester 2009/2010) p. 11/38 Summary Motivations. Ordered Binary Deision Diagrams (OBDD). OBDD s as Canonial Forms. Building OBDD s
12 Alessandro Artale (FM First Semester 2009/2010) p. 12/38 Reduing the size of Ordered Deision Trees OBDT s are still exponential in the number of variables: Given n variables the OBDT s will have 2 n+1 1 nodes! We an redue the size of OBDT s by a reursive appliations of the following redutions: Remove Redundanies: Nodes with same left and right hildren an be eliminated; Share Subnodes: Roots of struturally idential sub-trees an be ollapsed.
13 Alessandro Artale (FM First Semester 2009/2010) p. 13/38 Redution: Example a b b d d d d d d d d
14 Alessandro Artale (FM First Semester 2009/2010) p. 14/38 Redution: Example (Cont.) Detet redundaies: a b b d d d d d d d d
15 Alessandro Artale (FM First Semester 2009/2010) p. 15/38 Redution: Example (Cont.) Remove redundaies: a b b 0 d 0 d 0 d
16 Alessandro Artale (FM First Semester 2009/2010) p. 16/38 Redution: Example (Cont.) Remove redundaies: a b b 1 0 d 0 d 0 d
17 Alessandro Artale (FM First Semester 2009/2010) p. 17/38 Redution: Example (Cont.) Share idential nodes: a b b 1 0 d 0 d 0 d
18 Alessandro Artale (FM First Semester 2009/2010) p. 18/38 Redution: Example (Cont.) Share idential nodes: a b b 0 d 1
19 Alessandro Artale (FM First Semester 2009/2010) p. 19/38 Redution: Example (Cont.) Detet redundanies: a b b 0 d 1
20 Alessandro Artale (FM First Semester 2009/2010) p. 20/38 Redution: Example (Cont.) Remove redundanies: a b 0 d 1 Final OBDD!
21 Alessandro Artale (FM First Semester 2009/2010) p. 21/38 OBDD s as Canonial Forms Definition. Given two OBDD s, B ϕ,b ψ, they have a ompatible variable ordering if there are no variables x,y suh that x < y in B ϕ while y < x in B ψ. Theorem. A Redued OBDD is a Canonial Form of a boolean formula: One a variable ordering is established (i.e., OBDD s have ompatible variable ordering), equivalent formulas are represented by the same OBDD: ϕ 1 ϕ 2 iff OBDD(ϕ 1 ) OBDD(ϕ 2 )
22 Alessandro Artale (FM First Semester 2009/2010) p. 22/38 Importane of OBDD s Canonial forms for OBDD s allow us to perform in an effiient way the following tests: Equivalene hek is simple: We test whether the redued and order ompatible OBDD s have idential struture. Validity hek requires onstant time! ϕ iff the redued OBDD B ϕ B (un)satisfiability hek requires onstant time! ϕ iff the redued OBDD B ϕ B The set of the paths from the root to 1 represent all the models of the formula; The set of the paths from the root to 0 represent all the ounter-models of the formula.
23 Alessandro Artale (FM First Semester 2009/2010) p. 23/38 Importane of Variable Ordering Changing the ordering of variables may inrease the size of OBDD s. Example, two OBDD s for the formula: ϕ = (a1 b1) (a2 b2) (a3 b3) a1 a1 b1 b1 a2 a2 a2 a3 a3 a3 a3 b2 b2 b1 b1 b1 b1 b1 b1 b1 b1 a3 b2 b2 b2 b2 b3 b3 b3 b3 True False True False Linear size Exponential size
24 Alessandro Artale (FM First Semester 2009/2010) p. 24/38 Summary Motivations. Ordered Binary Deision Diagrams (OBDD). OBDD s as Canonial Forms. Building OBDD s.
25 Alessandro Artale (FM First Semester 2009/2010) p. 25/38 The REDUCE Algorithm Notation. Given a non-terminal node, n, then lo(n) denotes the node pointed via the dashed line, while hi(n) denotes the node pointed by the solid line. Given an OBDD, REDUCE proeeds bottom-up assigning an integer label, id(n), to eah node: 1. Assign label 0 to all 0-terminals and label 1 to all 1-terminals. Given now a non-terminal node for x i, say n, then: 2. If id(lo(n)) = id(hi(n)), then id(n) = id(lo(n)); 3. If there is another node for x i, say m, suh that id(lo(n)) = id(lo(m)) and id(hi(n)) = id(hi(m)), then, id(n) =id(m); 4. Otherwise we set id(n) to the next unused integer.
26 Alessandro Artale (FM First Semester 2009/2010) p. 26/38 The Redue Algorithm (Cont) REDUCE Final Step: Collapsing nodes with the same label and redireting edges aordingly with the node ollapsing. Example: See Figure 6.14 from the book.
27 Alessandro Artale (FM First Semester 2009/2010) p. 27/38 Reursive struture of OBDD s Given a formula ϕ and a variable ordering X = {x 1,x 2,...,x n }, the algorithm to build OBDD s from formulas, OBDD(ϕ,X), operates reursively: 1. If ϕ =, then, OBDD(,X) = B = 1; 2. If ϕ =, then, OBDD(,X) = B = 0; 3. If ϕ = x i, then, OBDD(x i,x) = B xi x i If ϕ = ϕ 1, then, OBDD( ϕ 1,X) is obtained by negating the terminal nodes of OBDD(ϕ 1,X); 5. If ϕ = ϕ 1 op ϕ 2 (op a binary boolean operator), then, OBDD(ϕ 1 op ϕ 2,X) =apply(op,obdd(ϕ 1,X),OBDD(ϕ 2,X)).
28 Alessandro Artale (FM First Semester 2009/2010) p. 28/38 The algorithm APPLY Given two OBDD s, B ϕ,b ψ, the all apply(op,b ϕ,b ψ ) omputes the redued OBDD of the formula ϕ op ψ. The algorithms operates reursively on the struture of the two OBDD s: 1. Let x be the variable highest in the ordering whih ours in B ϕ or B ψ, then 2. Split the problem in two sub-problems: one for x being true and the other for x being false and solve reursively; 3. At the leaves, apply the boolean operation diretly.
29 Alessandro Artale (FM First Semester 2009/2010) p. 29/38 The algorithm APPLY (Cont.) Definition. Let ϕ be a formula and x a variable. We denote by ϕ[0/x] (ϕ[1/x]) the formula obtained by replaing all ourrenes of x in ϕ by 0 (1). This allow us to split boolean formulas in simpler ones. Lemma [Shannon Expansion]. Let ϕ be a formula and x a variable, then: ϕ (x ϕ[1/x]) ( x ϕ[0/x]) The funtion APPLY is based on the Shannon Expansion: ϕopψ (x (ϕ[1/x]opψ[1/x])) ( x (ϕ[0/x]opψ[0/x]))
30 Alessandro Artale (FM First Semester 2009/2010) p. 30/38 The algorithm APPLY (Cont.) Apply(op,B ϕ,b ψ ) proeeds from the roots downward. Let r ϕ,r ψ the roots of B ϕ,b ψ respetively: 1. If both r ϕ,r ψ are terminal nodes, then, Apply(op,B ϕ,b ψ ) =B (rϕ op r ψ ); 2. If both roots are x i -nodes, then reate an x i -node with a dashed line to Apply(op,B lo(rϕ ),B lo(rψ )) and a solid line to Apply(op,B hi(rϕ ),B hi(rψ )); 3. If r ϕ is an x i -node, but r ψ is a terminal node or an x j -node with j > i (i.e., ψ[0/x i ] ψ[1/x i ] ψ), then reate an x i -node with dashed line to Apply(op,B lo(rϕ ),B ψ ) and solid line to Apply(op,B hi(rϕ ),B ψ ); 4. If r ψ is an x i -node, but r ϕ is a terminal node or an x j -node with j > i, is handled as above.
31 Alessandro Artale (FM First Semester 2009/2010) p. 31/38 OBBD Inremental Building: An Example ϕ = (A 1 A 2 ) (A 1 A 2 ) ( A 1 A 2 ) ( A 1 A 2 ) (A1 v A2) (A1 v A2) ( A1 v A2) ( A2 v A2) A1 A1 A1 A1 A2 A2 A2 A2 T F T F T F T F (A1 v A2) ^ (A1 v A2) ( A1 v A2) ^ ( A1 v A2) A1 A1 T F T F (A1 v A2) ^ (A1 v A2) ( A1 v A2) ^ ( A1 v A2) ^ F
32 Alessandro Artale (FM First Semester 2009/2010) p. 32/38 Boolean Quantifiation Quantifying over boolean variables is a ruial operation to ompute Preimages (i.e., the next-time operator). If x is a boolean variable, then x.ϕ ϕ[0/x] ϕ[1/x] x.ϕ ϕ[0/x] ϕ[1/x] Let W = {w 1,...,w n ). Multi-variable quantifiation: W.ϕ (w 1,...,w n ).ϕ w 1... w n.ϕ
33 Alessandro Artale (FM First Semester 2009/2010) p. 33/38 The RESTRICT Algorithm To ompute the OBDD for x.ϕ we need to ompute the OBDD for both ϕ[0/x] and ϕ[1/x]. B ϕ[0/x] = RESTRICT(0,x,B ϕ ). For eah node n labeled with x, then: 1. Inoming edges are redireted to lo(n); 2. n is removed. B ϕ[1/x] = RESTRICT(1,x,B ϕ ). As above, only rediret inoming edges to hi(n).
34 Alessandro Artale (FM First Semester 2009/2010) p. 34/38 Boolean Quantifiation (Cont.) B x.ϕ = APPLY(, RESTRICT(0,x,B ϕ ), RESTRICT(1,x,B ϕ )) x 1 x 1 x 1 y 1 y 1 y 1 x 2 x 2 x 2 y 2 y 2 y 2 x 3 y 3 y B ϕ RESTRICT(0,x 3,B ϕ ) RESTRICT(1,x 3,B ϕ )
35 Alessandro Artale (FM First Semester 2009/2010) p. 35/38 Boolean Quantifiation (Cont.) B x.ϕ = APPLY(, RESTRICT(0,x,B ϕ ), RESTRICT(1,x,B ϕ )) x 1 x 1 x 1 y 1 y 1 y 1 x 2 x 2 x 2 y 2 y 2 y 2 y 3 y RESTRICT(0,x 3,B ϕ ) RESTRICT(1,x 3,B ϕ ) x 3.B ϕ
36 Alessandro Artale (FM First Semester 2009/2010) p. 36/38 Time Complexity Algorithm Time-Complexity REDUCE(B) O( B log B ) APPLY(op,B ϕ,b ψ ) O( B ϕ B ψ ) N.B. The above omplexity results depend from the size of the input OBDD s: The size of OBDD s may grow exponentially wrt. the number of variables in worst-ase. Example: there exist no polynomial-size OBDD representing the eletroni iruit of a bitwise multiplier.
37 Alessandro Artale (FM First Semester 2009/2010) p. 37/38 OBDD Summary Require setting a variable ordering a priori (ritial!) Normal representation of a boolean formula. One built, logial operations (satisfiability, validity, equivalene) immediate. Represents all models and ounter-models of the formula. Require exponential spae in worst-ase.
38 Alessandro Artale (FM First Semester 2009/2010) p. 38/38 Summary of Leture VI Motivations. Ordered Binary Deision Diagrams (OBDD). OBDD s as Canonial Forms. Building OBDD s.
Formal Methods Lecture VII Symbolic Model Checking
Formal Methods Lecture VII Symbolic Model Checking Faculty of Computer Science Free University of Bozen-Bolzano artale@inf.unibz.it http://www.inf.unibz.it/ artale/ Academic Year: 2006/07 Some material
More informationFORMAL METHODS LECTURE V: CTL MODEL CHECKING
FORMAL METHODS LECTURE V: CTL MODEL CHECKING Alessandro Artale Faculty of Computer Science Free University of Bolzano Room 2.03 artale@inf.unibz.it http://www.inf.unibz.it/ artale/ Some material (text,
More informationBoolean decision diagrams and SAT-based representations
Boolean decision diagrams and SAT-based representations 4th July 200 So far we have seen Kripke Structures 2 Temporal logics (and their semantics over Kripke structures) 3 Model checking of these structures
More informationFORMAL METHODS LECTURE IV: COMPUTATION TREE LOGIC (CTL)
Alessandro Artale (FM First Semester 2007/2008) p. 1/37 FORMAL METHODS LECTURE IV: COMPUTATION TREE LOGIC (CTL) Alessandro Artale Faculty of Computer Science Free University of Bolzano artale@inf.unibz.it
More informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
More informationFORMAL METHODS LECTURE III: LINEAR TEMPORAL LOGIC
Alessandro Artale (FM First Semester 2007/2008) p. 1/39 FORMAL METHODS LECTURE III: LINEAR TEMPORAL LOGIC Alessandro Artale Faculty of Computer Science Free University of Bolzano artale@inf.unibz.it http://www.inf.unibz.it/
More informationSequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson & J. Fischer) January 21,
Sequene Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson & J. Fisher) January 21, 201511 9 Suffix Trees and Suffix Arrays This leture is based on the following soures, whih are all reommended
More informationAnnouncements. Office Hours Swap: OH schedule has been updated to reflect this.
SA Solving Announements Offie Hours Swap: Zavain has offie hours from 4-6PM toay in builing 460, room 040A. Rose has offie hours tonight from 7-9PM in Gates B26B. Keith has offie hours hursay from 2-4PM
More informationMaximum Entropy and Exponential Families
Maximum Entropy and Exponential Families April 9, 209 Abstrat The goal of this note is to derive the exponential form of probability distribution from more basi onsiderations, in partiular Entropy. It
More informationReduced Ordered Binary Decision Diagrams
Reduced Ordered Binary Decision Diagrams Lecture #12 of Advanced Model Checking Joost-Pieter Katoen Lehrstuhl 2: Software Modeling & Verification E-mail: katoen@cs.rwth-aachen.de December 13, 2016 c JPK
More informationBinary Decision Diagrams
Binary Decision Diagrams Logic Circuits Design Seminars WS2010/2011, Lecture 2 Ing. Petr Fišer, Ph.D. Department of Digital Design Faculty of Information Technology Czech Technical University in Prague
More informationFormal Verification by Model Checking
Outline Formal Verifiation by Model Cheking Natasha Sharygina Carnegie Mellon University Guest Letures at the Analysis of Software Artifats Class, Spring 2005 1 Leture 1: Overview of Model Cheking Leture
More informationBDD Based Upon Shannon Expansion
Boolean Function Manipulation OBDD and more BDD Based Upon Shannon Expansion Notations f(x, x 2,, x n ) - n-input function, x i = or f xi=b (x,, x n ) = f(x,,x i-,b,x i+,,x n ), b= or Shannon Expansion
More informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
More information15.12 Applications of Suffix Trees
248 Algorithms in Bioinformatis II, SoSe 07, ZBIT, D. Huson, May 14, 2007 15.12 Appliations of Suffix Trees 1. Searhing for exat patterns 2. Minimal unique substrings 3. Maximum unique mathes 4. Maximum
More informationTwo-Level Minimization
Two-Level Minimization Logi Ciruits Design Seminars WS2010/2011, Leture 5 Ing. Petr Fišer, Ph.D. Department of Digital Design Faulty of Information Tehnology Czeh Tehnial University in Prague Evropský
More informationBinary Decision Diagrams Boolean Functions
Binary Decision Diagrams Representation of Boolean Functions BDDs, OBDDs, ROBDDs Operations Model-Checking over BDDs 72 Boolean functions:b = {0,1}, f :B B B Boolean Functions Boolean expressions: t ::=
More informationSensitivity Analysis in Markov Networks
Sensitivity Analysis in Markov Networks Hei Chan and Adnan Darwihe Computer Siene Department University of California, Los Angeles Los Angeles, CA 90095 {hei,darwihe}@s.ula.edu Abstrat This paper explores
More informationSymbolic Model Checking with ROBDDs
Symbolic Model Checking with ROBDDs Lecture #13 of Advanced Model Checking Joost-Pieter Katoen Lehrstuhl 2: Software Modeling & Verification E-mail: katoen@cs.rwth-aachen.de December 14, 2016 c JPK Symbolic
More informationBinary Decision Diagrams
Binary Decision Diagrams Literature Some pointers: H.R. Andersen, An Introduction to Binary Decision Diagrams, Lecture notes, Department of Information Technology, IT University of Copenhagen Tools: URL:
More informationFormal Verification SE303 Conception des systèmes sur puces (SoC)
Formal Verifiation SE33 Coneption des systèmes sur pues (SoC) Ulrih Kühne 29//27 Outline Introdution Short History of Hardware Failures Design and Verifiation Proess Funtional Verifiation Ciruit Models
More informationReduced Ordered Binary Decision Diagrams
Reduced Ordered Binary Decision Diagrams Lecture #13 of Advanced Model Checking Joost-Pieter Katoen Lehrstuhl 2: Software Modeling & Verification E-mail: katoen@cs.rwth-aachen.de June 5, 2012 c JPK Switching
More informationBinary Decision Diagrams. Graphs. Boolean Functions
Binary Decision Diagrams Graphs Binary Decision Diagrams (BDDs) are a class of graphs that can be used as data structure for compactly representing boolean functions. BDDs were introduced by R. Bryant
More informationSummary. Computation Tree logic Vs. LTL. CTL at a glance. KM,s =! iff for every path " starting at s KM," =! COMPUTATION TREE LOGIC (CTL)
Summary COMPUTATION TREE LOGIC (CTL) Slides by Alessandro Artale http://www.inf.unibz.it/ artale/ Some material (text, figures) displayed in these slides is courtesy of: M. Benerecetti, A. Cimatti, M.
More informationA brief introduction to Logic. (slides from
A brief introduction to Logic (slides from http://www.decision-procedures.org/) 1 A Brief Introduction to Logic - Outline Propositional Logic :Syntax Propositional Logic :Semantics Satisfiability and validity
More informationBinary Decision Diagrams
Binary Decision Diagrams An Introduction and Some Applications Manas Thakur PACE Lab, IIT Madras Manas Thakur (IIT Madras) BDDs 1 / 25 Motivating Example Binary decision tree for a truth table Manas Thakur
More informationBinary Decision Diagrams
Binary Decision Diagrams Binary Decision Diagrams (BDDs) are a class of graphs that can be used as data structure for compactly representing boolean functions. BDDs were introduced by R. Bryant in 1986.
More informationMcCreight s Suffix Tree Construction Algorithm. Milko Izamski B.Sc. Informatics Instructor: Barbara König
1. Introution MCreight s Suffix Tree Constrution Algorithm Milko Izamski B.S. Informatis Instrutor: Barbara König The main goal of MCreight s algorithm is to buil a suffix tree in linear time. This is
More informationLecture 7: Sampling/Projections for Least-squares Approximation, Cont. 7 Sampling/Projections for Least-squares Approximation, Cont.
Stat60/CS94: Randomized Algorithms for Matries and Data Leture 7-09/5/013 Leture 7: Sampling/Projetions for Least-squares Approximation, Cont. Leturer: Mihael Mahoney Sribe: Mihael Mahoney Warning: these
More informationProbabilistic Graphical Models
Probabilisti Graphial Models David Sontag New York University Leture 12, April 19, 2012 Aknowledgement: Partially based on slides by Eri Xing at CMU and Andrew MCallum at UMass Amherst David Sontag (NYU)
More informationMost results in this section are stated without proof.
Leture 8 Level 4 v2 he Expliit formula. Most results in this setion are stated without proof. Reall that we have shown that ζ (s has only one pole, a simple one at s =. It has trivial zeros at the negative
More informationBinary Decision Diagrams
Binar Decision Diagrams Ma 3, 2004 1 Overview Boolean functions Possible representations Binar decision trees Binar decision diagrams Ordered binar decision diagrams Reduced ordered binar decision diagrams
More informationPropositional Logic: Evaluating the Formulas
Institute for Formal Models and Verification Johannes Kepler University Linz VL Logik (LVA-Nr. 342208) Winter Semester 2015/2016 Propositional Logic: Evaluating the Formulas Version 2015.2 Armin Biere
More informationDecision Procedures for Satisfiability and Validity in Propositional Logic
Decision Procedures for Satisfiability and Validity in Propositional Logic Meghdad Ghari Institute for Research in Fundamental Sciences (IPM) School of Mathematics-Isfahan Branch Logic Group http://math.ipm.ac.ir/isfahan/logic-group.htm
More informationParallelized Side-Channel Attack Resisted Scalar Multiplication Using q-based Addition-Subtraction k-chains
Parallelized Side-Channel Atta Resisted Salar Multipliation Using -Based Addition-Subtration -hains Kittiphop Phalaarn Department of Computer Engineering Chulalongorn University email: ittiphop.ph@student.hula.a.th
More informationOutline. Complexity Theory. Introduction. What is abduction? Motivation. Reference VU , SS Logic-Based Abduction
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 7. Logic-Based Abduction Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien
More informationmax min z i i=1 x j k s.t. j=1 x j j:i T j
AM 221: Advaned Optimization Spring 2016 Prof. Yaron Singer Leture 22 April 18th 1 Overview In this leture, we will study the pipage rounding tehnique whih is a deterministi rounding proedure that an be
More informationModal Horn Logics Have Interpolation
Modal Horn Logis Have Interpolation Marus Kraht Department of Linguistis, UCLA PO Box 951543 405 Hilgard Avenue Los Angeles, CA 90095-1543 USA kraht@humnet.ula.de Abstrat We shall show that the polymodal
More informationDifferential Equations 8/24/2010
Differential Equations A Differential i Equation (DE) is an equation ontaining one or more derivatives of an unknown dependant d variable with respet to (wrt) one or more independent variables. Solution
More information1 First-order logic. 1 Syntax of first-order logic. 2 Semantics of first-order logic. 3 First-order logic queries. 2 First-order query evaluation
Knowledge Bases and Databases Part 1: First-Order Queries Diego Calvanese Faculty of Computer Science Master of Science in Computer Science A.Y. 2007/2008 Overview of Part 1: First-order queries 1 First-order
More informationCryptography, winter term 16/17: Sample solution to assignment 2
U N S A R I V E R S A V I E I T A S N I S S Cryptography, winter term 6/7: Sample solution to assignment Cornelius Brand, Mar Roth Exerise. (Messing up the one-time pad) Consider the following modifiation
More informationCTL Model Checking. Wishnu Prasetya.
CTL Model Checking Wishnu Prasetya wishnu@cs.uu.nl www.cs.uu.nl/docs/vakken/pv Background Example: verification of web applications à e.g. to prove existence of a path from page A to page B. Use of CTL
More informationBypassing Space Explosion in High-Speed Regular Expression Matching
Bypassing Spae Explosion in High-Speed Regular Expression Mathing Jignesh Patel Alex X. Liu Eri Torng Astrat Network intrusion detetion and prevention systems ommonly use regular expression (RE) signatures
More informationMathematical Logic Propositional Logic - Tableaux*
Mathematical Logic Propositional Logic - Tableaux* Fausto Giunchiglia and Mattia Fumagalli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and Mattia
More informationState Diagrams. Margaret M. Fleck. 14 November 2011
State Diagrams Margaret M. Flek 14 November 2011 These notes over state diagrams. 1 Introdution State diagrams are a type of direted graph, in whih the graph nodes represent states and labels on the graph
More informationQuantified Boolean Formulas Part 1
Quantified Boolean Formulas Part 1 Uwe Egly Knowledge-Based Systems Group Institute of Information Systems Vienna University of Technology Results of the SAT 2009 application benchmarks for leading solvers
More informationModel Checking for Propositions CS477 Formal Software Dev Methods
S477 Formal Software Dev Methods Elsa L Gunter 2112 S, UIU egunter@illinois.edu http://courses.engr.illinois.edu/cs477 Slides based in part on previous lectures by Mahesh Vishwanathan, and by Gul gha January
More informationCMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017
CMSC 451: Leture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 Reading: Chapt 11 of KT and Set 54 of DPV Set Cover: An important lass of optimization problems involves overing a ertain domain,
More informationA NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM
NETWORK SIMPLEX LGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM Cen Çalışan, Utah Valley University, 800 W. University Parway, Orem, UT 84058, 801-863-6487, en.alisan@uvu.edu BSTRCT The minimum
More information23.1 Tuning controllers, in the large view Quoting from Section 16.7:
Lesson 23. Tuning a real ontroller - modeling, proess identifiation, fine tuning 23.0 Context We have learned to view proesses as dynami systems, taking are to identify their input, intermediate, and output
More informationEECS 219C: Computer-Aided Verification Boolean Satisfiability Solving III & Binary Decision Diagrams. Sanjit A. Seshia EECS, UC Berkeley
EECS 219C: Computer-Aided Verification Boolean Satisfiability Solving III & Binary Decision Diagrams Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: Lintao Zhang Announcement Project proposals due
More informationOverview. Discrete Event Systems Verification of Finite Automata. What can finite automata be used for? What can finite automata be used for?
Computer Engineering and Networks Overview Discrete Event Systems Verification of Finite Automata Lothar Thiele Introduction Binary Decision Diagrams Representation of Boolean Functions Comparing two circuits
More informationSERIJA III
SERIJA III www.math.hr/glasnik I. Gaál, B. Jadrijević and L. Remete Totally real Thue inequalities over imaginary quadrati fields Aepted manusript This is a preliminary PDF of the author-produed manusript
More informationAdvanced Computational Fluid Dynamics AA215A Lecture 4
Advaned Computational Fluid Dynamis AA5A Leture 4 Antony Jameson Winter Quarter,, Stanford, CA Abstrat Leture 4 overs analysis of the equations of gas dynamis Contents Analysis of the equations of gas
More information13th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 13)
13th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 13) Relation Algebras, Matrices, and Multi-Valued Decision Diagrams Francis Atampore and Dr. Michael Winter
More informationAn Efficient Sequential SAT Solver With Improved Search Strategies
An Effiient Sequential SAT Solver With Improved Searh Strategies F. Lu, M.K. Iyer, G. Parthasarathy, L.-C. Wang, and K.-T. Cheng K.C. Chen Department of ECE, Design Tehnology University of California at
More informationBasing Decisions on Sentences in Decision Diagrams
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence Basing Decisions on Sentences in Decision Diagrams Yexiang Xue Department of Computer Science Cornell University yexiang@cs.cornell.edu
More informationComparison of Alternative Equivalent Circuits of Induction Motor with Real Machine Data
Comparison of Alternative Equivalent Ciruits of Indution Motor with Real Mahine Data J. radna, J. auer, S. Fligl and V. Hlinovsky Abstrat The algorithms based on separated ontrol of the motor flux and
More informationCS 687 Jana Kosecka. Uncertainty, Bayesian Networks Chapter 13, Russell and Norvig Chapter 14,
CS 687 Jana Koseka Unertainty Bayesian Networks Chapter 13 Russell and Norvig Chapter 14 14.1-14.3 Outline Unertainty robability Syntax and Semantis Inferene Independene and Bayes' Rule Syntax Basi element:
More informationAlgebraic Methods. Motivation: Systems like this: v 1 v 2 v 3 v 4 = 1 v 1 v 2 v 3 v 4 = 0 v 2 v 4 = 0
Motivation: Systems like this: v v 2 v 3 v 4 = v v 2 v 3 v 4 = 0 v 2 v 4 = 0 are very difficult for CNF SAT solvers although they can be solved using simple algebraic manipulations Let c 0, c,...,c 2 n
More informationLOGIC PROPOSITIONAL REASONING
LOGIC PROPOSITIONAL REASONING WS 2017/2018 (342.208) Armin Biere Martina Seidl biere@jku.at martina.seidl@jku.at Institute for Formal Models and Verification Johannes Kepler Universität Linz Version 2018.1
More informationif t 1,...,t k Terms and P k is a k-ary predicate, then P k (t 1,...,t k ) Formulas (atomic formulas)
FOL Query Evaluation Giuseppe De Giacomo Università di Roma La Sapienza Corso di Seminari di Ingegneria del Software: Data and Service Integration Laurea Specialistica in Ingegneria Informatica Università
More information7 Max-Flow Problems. Business Computing and Operations Research 608
7 Max-Flow Problems Business Computing and Operations Researh 68 7. Max-Flow Problems In what follows, we onsider a somewhat modified problem onstellation Instead of osts of transmission, vetor now indiates
More informationChapter 8 Hypothesis Testing
Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationMAC Calculus II Summer All you need to know on partial fractions and more
MC -75-Calulus II Summer 00 ll you need to know on partial frations and more What are partial frations? following forms:.... where, α are onstants. Partial frations are frations of one of the + α, ( +
More informationHankel Optimal Model Order Reduction 1
Massahusetts Institute of Tehnology Department of Eletrial Engineering and Computer Siene 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Hankel Optimal Model Order Redution 1 This leture overs both
More informationPushdown Specifications
Orna Kupferman Hebrew University Pushdown Speifiations Nir Piterman Weizmann Institute of Siene une 9, 2002 Moshe Y Vardi Rie University Abstrat Traditionally, model heking is applied to finite-state systems
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationA Collection of Problems in Propositional Logic
A Collection of Problems in Propositional Logic Hans Kleine Büning SS 2016 Problem 1: SAT (respectively SAT) Instance: A propositional formula α (for SAT in CNF). Question: Is α satisfiable? The problems
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationFault Tolerant Variable Block Carry Skip Logic (VBCSL) using Parity Preserving Reversible Gates
Fault Tolerant Variable lok Carry Skip Logi (VCSL) using Parity Preserving Reversible Gates Md. Saiful Islam, M. M. Rahman*, Zerina egum, and M. Z. Hafiz Institute of Information Tehnology, University
More informationReliability Guaranteed Energy-Aware Frame-Based Task Set Execution Strategy for Hard Real-Time Systems
Reliability Guaranteed Energy-Aware Frame-Based ask Set Exeution Strategy for Hard Real-ime Systems Zheng Li a, Li Wang a, Shuhui Li a, Shangping Ren a, Gang Quan b a Illinois Institute of ehnology, Chiago,
More informationComplexity. Complexity Theory Lecture 3. Decidability and Complexity. Complexity Classes
Complexity Theory 1 Complexity Theory 2 Complexity Theory Lecture 3 Complexity For any function f : IN IN, we say that a language L is in TIME(f(n)) if there is a machine M = (Q, Σ, s, δ), such that: L
More informationInternational Journal of Electronics and Computer Science Engineering 817. Available Online at ISSN
International Journal of Eletronis and Computer Siene Engineering 817 Available Online at www.ijese.org ISSN- 2277-1956 A Duly Synhronized, Straightforward Approah For Realizing the General Charateristis
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematis A NEW ARRANGEMENT INEQUALITY MOHAMMAD JAVAHERI University of Oregon Department of Mathematis Fenton Hall, Eugene, OR 97403. EMail: javaheri@uoregon.edu
More informationLogic and Inferences
Artificial Intelligence Logic and Inferences Readings: Chapter 7 of Russell & Norvig. Artificial Intelligence p.1/34 Components of Propositional Logic Logic constants: True (1), and False (0) Propositional
More information22c:145 Artificial Intelligence
22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not
More informationLecture 2: Symbolic Model Checking With SAT
Lecture 2: Symbolic Model Checking With SAT Edmund M. Clarke, Jr. School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 (Joint work over several years with: A. Biere, A. Cimatti, Y.
More informationDetermination of the reaction order
5/7/07 A quote of the wee (or amel of the wee): Apply yourself. Get all the eduation you an, but then... do something. Don't just stand there, mae it happen. Lee Iaoa Physial Chemistry GTM/5 reation order
More informationCounting Idempotent Relations
Counting Idempotent Relations Beriht-Nr. 2008-15 Florian Kammüller ISSN 1436-9915 2 Abstrat This artile introdues and motivates idempotent relations. It summarizes haraterizations of idempotents and their
More informationPropositional Fragments for Knowledge Compilation and Quantified Boolean Formulae
1/15 Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae Sylvie Coste-Marquis Daniel Le Berre Florian Letombe Pierre Marquis CRIL, CNRS FRE 2499 Lens, Université d Artois,
More informationStatistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms
Eur. Phys. J. B, 55 53 ) THE EUROPEAN PHYSICAL JOURNAL B EDP Sienes Soietà Italiana di Fisia Springer-Verlag Statistial physis analysis of the omputational omplexity of solving random satisfiability problems
More informationSAT, NP, NP-Completeness
CS 473: Algorithms, Spring 2018 SAT, NP, NP-Completeness Lecture 22 April 13, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 57 Part I Reductions Continued Ruta (UIUC)
More informationGeneral Equilibrium. What happens to cause a reaction to come to equilibrium?
General Equilibrium Chemial Equilibrium Most hemial reations that are enountered are reversible. In other words, they go fairly easily in either the forward or reverse diretions. The thing to remember
More informationPROOFS IN PREDICATE LOGIC AND COMPLETENESS; WHAT DECIDABILITY MEANS HUTH AND RYAN 2.3, SUPPLEMENTARY NOTES 2
PROOFS IN PREDICATE LOGIC AND COMPLETENESS; WHAT DECIDABILITY MEANS HUTH AND RYAN 2.3, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 12 September, 2005 Some slides today new, some based on logic 2004 (Nils
More informationLecture 9: The Splitting Method for SAT
Lecture 9: The Splitting Method for SAT 1 Importance of SAT Cook-Levin Theorem: SAT is NP-complete. The reason why SAT is an important problem can be summarized as below: 1. A natural NP-Complete problem.
More informationFig Review of Granta-gravel
0 Conlusion 0. Sope We have introdued the new ritial state onept among older onepts of lassial soil mehanis, but it would be wrong to leave any impression at the end of this book that the new onept merely
More informationDatabase Theory VU , SS Ehrenfeucht-Fraïssé Games. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2018 7. Ehrenfeucht-Fraïssé Games Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Pichler 15
More informationSURFACE WAVES OF NON-RAYLEIGH TYPE
SURFACE WAVES OF NON-RAYLEIGH TYPE by SERGEY V. KUZNETSOV Institute for Problems in Mehanis Prosp. Vernadskogo, 0, Mosow, 75 Russia e-mail: sv@kuznetsov.msk.ru Abstrat. Existene of surfae waves of non-rayleigh
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More information7.1 Roots of a Polynomial
7.1 Roots of a Polynomial A. Purpose Given the oeffiients a i of a polynomial of degree n = NDEG > 0, a 1 z n + a 2 z n 1 +... + a n z + a n+1 with a 1 0, this subroutine omputes the NDEG roots of the
More informationDatabase Theory VU , SS Complexity of Query Evaluation. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2018 5. Complexity of Query Evaluation Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 17 April, 2018 Pichler
More informationMillennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion
Millennium Relativity Aeleration Composition he Relativisti Relationship between Aeleration and niform Motion Copyright 003 Joseph A. Rybzyk Abstrat he relativisti priniples developed throughout the six
More informationChapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013
Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of
More information1 Algebraic Methods. 1.1 Gröbner Bases Applied to SAT
1 Algebraic Methods In an algebraic system Boolean constraints are expressed as a system of algebraic equations or inequalities which has a solution if and only if the constraints are satisfiable. Equations
More informationSome examples of generated fuzzy implicators
Some examples of generated fuzzy impliators Dana Hliněná and Vladislav Biba Department of Mathematis, FEEC, Brno University of Tehnology Tehniká 8, 616 00 Brno, Czeh Rep. e-mail: hlinena@fee.vutbr.z, v
More informationLECTURE NOTES FOR , FALL 2004
LECTURE NOTES FOR 18.155, FALL 2004 83 12. Cone support and wavefront set In disussing the singular support of a tempered distibution above, notie that singsupp(u) = only implies that u C (R n ), not as
More informationProduct Policy in Markets with Word-of-Mouth Communication. Technical Appendix
rodut oliy in Markets with Word-of-Mouth Communiation Tehnial Appendix August 05 Miro-Model for Inreasing Awareness In the paper, we make the assumption that awareness is inreasing in ustomer type. I.e.,
More information