Quantified Boolean Formulas: Complexity and Expressiveness
|
|
- Giles Hamilton
- 6 years ago
- Views:
Transcription
1 Dagstuhl SAT Interactions 2012 Quantified Boolean Formulas: Complexity and Expressiveness Uwe Bubeck University of Paderborn
2 Outline Introduction Free Variables and Equivalence Complexity Expressiveness Conclusion Uwe Bubeck QBF: Complexity and Expressiveness 2
3 Section 1 Introduction
4 Quantified Boolean Formulas 1/2 QBF extends propositional logic by allowing universal and existential quantifiers over propositional variables. Inductive definition: 1. Every propositional formula is a QBF. 2. If Φ is a QBF then xφ and yφ are also QBFs. 3. If Φ 1 and Φ 2 are QBFs then Φ 1, Φ 1 Φ 2 and Φ 1 Φ 2 are also QBFs. Uwe Bubeck QBF: Complexity and Expressiveness 4
5 Quantified Boolean Formulas 2/2 In a closed QBF, every variable is quantified. Semantics definition for closed QBF: y Φ y is true if and only if Φ y/0 is true or Φ y/1 is true. x Φ x is true if and only if Φ x/0 is true and Φ x/1 is true. A closed QBF is either true or false. Uwe Bubeck QBF: Complexity and Expressiveness 5
6 Prenexing Closed QBFs Φ and Ψ are logically equivalent (Φ Ψ) they are satisfiability equivalent they both evaluate to the same truth value. Every QBF can be transformed in linear time into a logically equivalent prenex formula Q 1 v 1 Q k v k φ by: 1. renaming quantified variables, 2. transformation into negation normal form (NNF), 3. moving quantifiers to the front by maxiscoping: Qv Φ Ψ Qv (Φ Ψ) for {, } and Q,. Uwe Bubeck QBF: Complexity and Expressiveness 6
7 Tree Models: Definition A closed prenex QBF Q 1 v 1 Q k v k φ is true if and only if there exists a tree such that: [Samulowitz et. al., 2006] 1. Each inner node is labeled with a variable v i, 1 i k, its outgoing edges are labeled with v i = 0 or v i = Inner nodes labeled with v i have two children if and only if Q i =, and one child otherwise. 3. For each path from root to leaf labeled with (v i1,, v i j ), we have 1 i 1 < < i j k (i.e. order as in the prefix). 4. On each path from root to leaf, the edge labels are a satisfying assignment to the propositional matrix φ. Uwe Bubeck QBF: Complexity and Expressiveness 7
8 Tree Models: Definition A closed prenex QBF Q 1 v 1 Q k v k φ is true if and only if there exists a tree such that: [Samulowitz et. al., 2006] 1. Each inner node is labeled with a variable v i, 1 i k, its outgoing edges are labeled with v i = 0 or v i = Inner nodes labeled with v i have two children if and only if Q i =, and one child otherwise. 3. For each path from root to leaf labeled with (v i1,, v i j ), we have 1 i 1 < < i j k (i.e. order as in the prefix). 4. On each path from root to leaf, the edge labels are a satisfying assignment to the propositional matrix φ. Uwe Bubeck QBF: Complexity and Expressiveness 8
9 Tree Models: Example Example: x 1 y 1 x 2 y 2 x 1 y 2 x 1 y 2 y 1 x 2 x 1 x 1 = 0 x 1 = 1 y 1 y 1 y 1 =? y 1 =? x 2 x 2 = 0 x 2 = 1 x 2 = 0 x 2 = 1 x 2 y 2 y 2 y 2 y 2 y 2 =? y 2 =? y 2 =? y 2 =? Uwe Bubeck QBF: Complexity and Expressiveness 9
10 Tree Models: Example Example: x 1 y 1 x 2 y 2 x 1 y 2 x 1 y 2 y 1 x 2 x 1 x 1 = 0 x 1 = 1 y 1 y 1 y 1 = 1 y 1 =? x 2 x 2 = 0 x 2 = 1 x 2 = 0 x 2 = 1 x 2 y 2 y 2 y 2 y 2 y 2 =? y 2 =? y 2 =? y 2 =? Uwe Bubeck QBF: Complexity and Expressiveness 10
11 Tree Models: Example Example: x 1 y 1 x 2 y 2 x 1 y 2 x 1 y 2 y 1 x 2 x 1 x 1 = 0 x 1 = 1 y 1 y 1 y 1 = 1 y 1 =? x 2 x 2 = 0 x 2 = 1 x 2 = 0 x 2 = 1 x 2 y 2 y 2 y 2 y 2 y 2 = 0 y 2 = 0 y 2 =? y 2 =? Uwe Bubeck QBF: Complexity and Expressiveness 11
12 Tree Models: Example Example: x 1 y 1 x 2 y 2 x 1 y 2 x 1 y 2 y 1 x 2 x 1 x 1 = 0 x 1 = 1 y 1 y 1 y 1 = 1 y 1 = 1 x 2 x 2 = 0 x 2 = 1 x 2 = 0 x 2 = 1 x 2 y 2 y 2 y 2 y 2 y 2 = 0 y 2 = 0 y 2 = 1 y 2 = 1 Uwe Bubeck QBF: Complexity and Expressiveness 12
13 Tree Models: Example Example: x 1 y 1 x 2 y 2 x 1 y 2 x 1 y 2 y 1 x 2 x 1 x 1 = 0 x 1 = 1 y 1 y 1 y 1 = 1 y 1 = 1 y 2 y 2 y 2 = 0 y 2 = 1 Universal Reduction Uwe Bubeck QBF: Complexity and Expressiveness 13
14 Tree Models: Generalization The requirement that variables must appear in the same order as in the prefix (rule 3) can be further relaxed: by grouping similar quantifiers into quantifier blocks. v 1 v n1 v n1 +1 v n2 v n2 +1 v n3 φ S 1 S 2 S 3 by considering variable dependency schemes. Uwe Bubeck QBF: Complexity and Expressiveness 14
15 Dependency Schemes 1/2 Consider the following formula: x y 1 u y 2 y 3 [ x u y 3 y 1 y 3 y 1 y 3 u y 3 ( y 1 y 2 )] Which variables must be above y 2 in the tree without altering the truth value of the formula? In general: dependency decision problem is PSPACE-complete. [Samer / Szeider, 2007] Uwe Bubeck QBF: Complexity and Expressiveness 15
16 Dependency Schemes 2/2 x y 1 u y 2 y 3 [ x u y 3 y 1 y 3 y 1 y 3 u y 3 ( y 1 y 2 )] One simple heuristic: recovering non-prenex structure: x y 1 [[ u y 3 x u y 3 y 1 y 3 y 1 y 3 u y 3 ] [ y 2 y 1 y 2 ]] Identified informally by [Biere, 2004], Formalized in [Samer / Szeider, 2007], [Bubeck / Kleine Büning, 2007], Currently tightest scheme by [van Gelder, 2011]. Still no practicable algorithm for computing tight schemes! Uwe Bubeck QBF: Complexity and Expressiveness 16
17 Section 2 Free Variables and Equivalence
18 Semantics of Free Variables 1/2 A focus of this talk is to allow free variables. Notation: Φ z 1,, z n for formula Φ with free variables z 1,, z n. QBF* is the class of quantified Boolean formulas with free variables. The valuation of a QBF* depends on the values of the free variables: Φ z 1,, z n t: z 1,, z n QBF is satisfied by a truth assignment 0,1 if and only if Φ t(z 1 ),, t(z n ) Φ[z 1 /t z 1,, z n /t z n ] is true. Uwe Bubeck QBF: Complexity and Expressiveness 18
19 Semantics of Free Variables 2/2 Example: Φ a, b, c, d : = y a y b y y c d Then Φ 0,1,0,1 Φ 0,1,0,0 etc. = y 0 y 1 y ( y 0 1) is true, = y 0 y 1 y ( y 0 0) is false, y a y b y y c d is true if and only if a c d b c d is true. Every QBF* is equivalent to a propositional formula. Uwe Bubeck QBF: Complexity and Expressiveness 19
20 Logical Equivalence Propositional or quantified Boolean formulas α and β with (free) variables z 1,, z n are logically equivalent, written as α z 1,, z n β(z 1,, z n ), if and only if α t(z 1 ),, t(z n ) = β(t(z 1 ),, t(z n )) for each truth assignment t to z 1,, z n. Quantified variables are not directly considered for logical equivalence. They can be seen as local within the respective formula. Uwe Bubeck QBF: Complexity and Expressiveness 20
21 Satisfiability Equivalence a c d b c d y a y b y y c d Without quantifier: a c d b c d a y b y y c d Problem: a = b = 1, c = d = 0, y = 1 satisfies left, but not right side. Relaxation: satisfiability equivalence a c d b c d SAT a y b y y c d Existence of a satisfying assignment for one side implies there is some satisfying assignment for the other side. Uwe Bubeck QBF: Complexity and Expressiveness 21
22 Equivalence and Rewriting For propositional formulas α, β, γ, it holds that β γ α α β/γ. Parts of a formula can be replaced with logically equivalent formulas. But: β SAT γ α SAT α β/γ. Satisfiability equivalence is sometimes too weak. Uwe Bubeck QBF: Complexity and Expressiveness 22
23 Section 3 Complexity
24 QBF* Complexity 1/2 Well known: the decision problem for QBF and the satisfiability problem for QBF* are PSPACE-complete. [Meyer / Stockmeyer, 1973] QBF* consequence and equivalence problems are also PSPACE-complete. QDNF* remains PSPACE-complete. Some verification problems are also PSPACE-complete: Propositional LTL satisfiability [Sistla / Clarke, 1985] Symbolic reachability in sequential circuits [Savitch, 1970] Uwe Bubeck QBF: Complexity and Expressiveness 24
25 QBF* Complexity 2/2 Typical approaches to reduce the complexity: Restriction of the matrix to special classes of propositional formulas Bounding of quantifier alternations in the prefix: φ φ k quantifier blocks, outermost existential: k quantifier blocks, outermost universal: prefix type Σ k prefix type Π k Uwe Bubeck QBF: Complexity and Expressiveness 25
26 Polynomial-time Hierarchy Well-known relationship with polynomial-time hierarchy: For fixed k 1, the satisfiability problem for QBF* with prefix type Σ k is Σ P k -complete, and Π P k -complete for prefix type Π k. [Stockmeyer, 1976] P Σ k+1 NP Σ k P P, Π k+1 Δ 0 P Σ 0 P Π 0 P P P P co Σ k+1, Δ k+1 P Σ k P Uwe Bubeck QBF: Complexity and Expressiveness 26
27 Schaefer s Dichotomy Theorem Consider a quantified constraint expression Q 1 y 1 Q n y n f 1 x 1,1,, x 1,m1 f k x k,1,, x k,mk with Q 1,, Q n {, }, Boolean functions f 1,, f k C and arguments x i,j y 1,, y n {0,1}. Dichotomy Theorem: Let C be a finite set of constraints. If C is Horn, anti-horn, bijunctive / Krom (equiv. to 2-CNF) or affine (equiv. to XOR-CNF) then QSAT c C is in P. Otherwise, QSAT c C is PSPACE-complete. [Schaefer, 1978], [Dalmau, 1997] [Creignou / Khanna et al., 2001] Uwe Bubeck QBF: Complexity and Expressiveness 27
28 QHORN* and Q2-CNF* QHORN* is the class of QCNF* formulas with at most one positive literal per clause. QHORN* satisfiability is decidable in quadratic time O( Φ ), where is the number of universal variables and Φ the formula length. Algorithm: by unit propagation [Flögel et al. 1995] or by universal expansion [Bubeck / Kleine Büning, 2008] Q2-CNF* satisfiability is decidable in linear time. Algorithm: by strongly connected components [Aspvall et al., 1979] Uwe Bubeck QBF: Complexity and Expressiveness 28
29 Section 4 Expressiveness
30 Other Representations We can also define logical equivalence with other representations of Boolean functions: a c d b a c d b c d y a y b y y c d For each assignment to a, b, c, d, all three representations evaluate to the same truth value. Uwe Bubeck QBF: Complexity and Expressiveness 30
31 Quantified Encodings 1/2 Main Theme: How compact are encodings in QBF* (or subclasses) versus other logically equivalent representations? Encoding Techniques: 1. Abbreviate exact repetitions by existential variables: A B C D A B C E A B C F y y A B C y D y E y F Simple implication if term occurs only in one polarity: y y A B C y D y E y F (quantified versions of [Tseitin, 1970] and [Plaisted, 1986]) Uwe Bubeck QBF: Complexity and Expressiveness 31
32 Quantified Encodings 2/2 2. Compress conjunctions of renamings / instantiations by universal variables: φ A 1, B 1 φ A 2, B 2 φ A 3, B 3 u v u A i v B i i=1 3 φ u, v [Dershowitz et al., 2005], [Meyer/Stockmeyer, 1973] 3. Iterative Squaring (Extension of 2.): Φ x 0, x n = x 1 x n 1 φ x 0, x 1 φ x 1, x 2 φ x n 1, x n Encoding: Φ n x 0, x n y Φ n/2 x 0, y Φ n/2 y, x n y u v u x 0 v y u y v x n Φ n/2 u, v [Meyer/Stockmeyer, 1973] Uwe Bubeck QBF: Complexity and Expressiveness 32
33 Nested Instantiations 1/3 Instantiations might also be nested: A 1 A 2 A 1 A 2 B 1 B 2 B 1 B 2 is of the form ψ(φ A 1, A 2, φ B 1, B 2 ). Other example: Parity of n Boolean variables f 0 p 1, p 2 p 1 p 2 p 1 p 2 f 1 p 1, p 2, p 3, p 4 f 0 f 0 p 1, p 2, f 0 p 3, p 4 f 2 p 1,, p 16 f 1 (f 1 p 1,, p 4,, f 1 p 13,, p 16 ) log 2 log 2 n + 1 definitions of size O(n). Uwe Bubeck QBF: Complexity and Expressiveness 33
34 Nested Instantiations 2/3 General Definition: A Nested Boolean Function (NBF) is a sequence of functions D f k = (f 0,, f k ) with initial functions f 0,, f t defined by f i (x i ) α i (x i ) for a propositional formula α i over x i (x i,1,, x i,n i) compound functions f t+1,, f k of the form f i x i f j0 (f j1 (x i 1 ),, f jr (x i r )) with previously defined functions f j0,, f jr and matching tuples x i i 1,, x r over variables from x i or Boolean constants. [Bubeck / Kleine Büning, 2012], [Cook / Soltys, 1999] Uwe Bubeck QBF: Complexity and Expressiveness 34
35 Nested Instantiations 3/3 By clever combination of previously presented encoding techniques, every NBF can be transformed in linear time into a logically equivalent prenex QBF*. [Bubeck / Kleine Büning, 2012] The inverse direction is very simple by simulating quantifier expansion, but length increases slightly to O( v Φ ) for a QBF* Φ with v quantified variables. Application: Configuration Problems ( Talk by Hans) Future Work: Solvers, interesting NBF subclasses Uwe Bubeck QBF: Complexity and Expressiveness 35
36 Circuits and Existential Quantifiers There is a close connection between fan-out in Boolean circuits and existential quantification: 1. Transformation from circuit to formula a c d b y 1 y 8 y 1 y 2 y 3 y 4 a y 1 c y 2 d y 3 b y 4 y 5 y 2 y 3 y 5 y 1 y 5 y 6 y 6 y 7 y 5 y 4 y 7 y 6 y 7 y 8 y 8 y 8 [Bauer / Brand et al., 1973] [Anderaa / Börger, 1981] Uwe Bubeck QBF: Complexity and Expressiveness 36
37 Circuits and Existential Quantifiers There is a close connection between fan-out in Boolean circuits and existential quantification: 1. Transformation from circuit to formula a c d b y 1 y 8 y 1 y 2 y 3 y 4 a y 1 c y 2 d y 3 b y 4 y 5 y 2 y 3 y 5 y 1 y 5 y 6 y 6 y 7 y 5 y 4 y 7 y 6 y 8 ) ( y 7 y 8 y 8 y 8 y a y b y y c d Uwe Bubeck QBF: Complexity and Expressiveness 37
38 The Class HORN b The previous linear transformation produces existentially quantified formulas in CNF with at most one positive bound variable per clause (i.e. the bound variables respect the Horn property). We call such formulas HORN b. General: for QK QCNF, QK b is the class of formulas Φ z 1,, z n = Q 1 v 1 Q m v m i φ i b (v 1,, v m ) φ i f (z 1,, z n ) where Q 1 v 1 Q m v m i φ b i (v 1,, v m ) is a formula in QK, and φ f i (z 1,, z n ) an arbitrary clause over free variables. Uwe Bubeck QBF: Complexity and Expressiveness 38
39 Circuits and Existential Quantifiers 2. Transformation from formula to circuit Any HORN b formula can be transformed in polynomial time into a logically equivalent Boolean circuit. [Anderaa / Börger, 1981] [Kleine Büning / Zhao / Bubeck, 2009] HORN b and circuits have similar expressiveness. Uwe Bubeck QBF: Complexity and Expressiveness 39
40 HORN b vs Propositional Formulas There are HORN b (even HORN*) formulas for which there is no logically equivalent propositional CNF of polynomial length. [Kleine Büning / Lettmann, 1999] Is a polynomial-length transformation from HORN b to arbitrary propositional formulas possible? Equivalent: Are circuits with unrestricted fan-out more expressive than with fan-out 1? Uwe Bubeck QBF: Complexity and Expressiveness 40
41 HORN b vs QHORN b Can the expressive power of HORN b be enhanced by universal quantification? Not significantly. For every Φ QHORN b with universal quantifiers, there exists a logically equivalent HORN b formula of quadratic length O( Φ ) which can be computed also in time O( Φ ). [Bubeck, 2010] That means QHORN b satisfiability is NP-complete. Uwe Bubeck QBF: Complexity and Expressiveness 41
42 Minimal Falsity and Quantification A closed QCNF formula is minimal false (MF) iff it is false and removing an arbitrary clause makes it true. Example: x y 0 y 1 y 0 z 0 y 0 z 1 y 0 z 2 y 1 z 3 x z 4 Bound parts: x y 0 y 1 (y 0 ) ( y 0 ) ( y 0 ) (y 1 ) (x) MF subformulas: 1. y 0 (y 0 ) ( y 0 ) 2. y 0 (y 0 ) ( y o ) 3. x (x) Uwe Bubeck QBF: Complexity and Expressiveness 42
43 Minimal Falsity and Quantification x y 0 y 1 y 0 z 0 y 0 z 1 y 0 z 2 y 1 z 3 x z 4 Bound parts: x y 0 y 1 (y 0 ) ( y 0 ) ( y 0 ) (y 1 ) (x) MF subformulas: 1. y 0 (y 0 ) ( y 0 ) 2. y 0 (y 0 ) ( y o ) 3. x (x) Corresponding bound parts: 1. z 0, z 1 2. z 0, z 2 3. z 4 For each MF subformula, one of the corresponding free parts must be satisfied. So the formula is equivalent to z 0 z 1 z 0 z 2 z 4. Uwe Bubeck QBF: Complexity and Expressiveness 43
44 Minimal Falsity and Quantification MF subformulas of the bound parts determine the role of the free parts in QCNF* formulas: Q φ i b φ i f φ i1 f φ ir f 1 i q Q φ b i φ b 1 i r MF [Bubeck / Kleine Büning, 2010] How do restrictions on the structure of the MF skeleton influence the expressiveness? all MF subformulas of the bound parts Uwe Bubeck QBF: Complexity and Expressiveness 44
45 Section 5 Conclusion
46 Conclusion Free variables are nothing to be afraid of. Compared to propositional logic, there is a very rich set of QBF* subclasses. How do these subclasses differ in expressiveness? Is there a hierarchy PROP < poly len HORN b < poly len CNF* < poly len CNF*...? How are these classes related to other representations, e.g. circuits? Uwe Bubeck QBF: Complexity and Expressiveness 46
47 References 1/6 S. Anderaa and E. Börger. The Equivalence of Horn and Network Complexity for Boolean Functions B. Aspvall, M. Plass and R. Tarjan. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas M. Bauer, D. Brand, M. Fischer, A. Meyer and M. Paterson. A Note on Disjunctive Form Tautologies A. Biere. Resolve and Expand U. Bubeck. Model-Based Transformations for Quantified Boolean Formulas Uwe Bubeck QBF: Complexity and Expressiveness 51
48 References 2/6 U. Bubeck and H. Kleine Büning. Bounded Universal Expansion for Preprocessing QBF U. Bubeck and H. Kleine Büning. Models and Quantifier Elimination for Quantified Horn Formulas U. Bubeck and H. Kleine Büning. The Power of Auxiliary Variables for Propositional and Quantified Boolean Formulas U. Bubeck and H. Kleine Büning. Encoding Nested Boolean Functions as Quantified Boolean Formulas S. Cook and M. Soltys. Boolean Programs and Quantified Propositional Proof Systems Uwe Bubeck QBF: Complexity and Expressiveness 52
49 References 3/6 N. Creignou, S. Khanna and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems V. Dalmau Some Dichotomy Theorems on Constant-free Boolean Formulas N. Dershowitz, Z. Hanna and J. Katz. Bounded Model Checking with QBF U. Egly, M. Seidl, H. Tompits, S. Woltran and M. Zolda. Comparing Different Prenexing Strategies for Quantified Boolean Formulas A. Flögel, M. Karpinski and H. Kleine Büning. Resolution for Quantified Boolean Formulas Uwe Bubeck QBF: Complexity and Expressiveness 53
50 References 4/6 H. Kleine Büning and U. Bubeck. Theory of Quantified Boolean Formulas H. Kleine Büning and T. Lettmann. Propositional Logic: Deduction and Algorithms H. Kleine Büning, X. Zhao and U. Bubeck. Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits A. Meyer and L. Stockmeyer. Word Problems Requiring Exponential Time D. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation Uwe Bubeck QBF: Complexity and Expressiveness 54
51 References 5/6 M. Samer and S. Szeider. Backdoor Sets of Quantified Boolean Formulas H. Samulowitz, J. Davies, F. Bacchus. Preprocessing QBF W. Savitch. Relationships Between Nondeterministic and Deterministic Tape Complexities T. Schaefer. The Complexity of Satisfiability Problems A. Sistla and E. Clarke. The Complexity of Propositional Linear Time Logics Uwe Bubeck QBF: Complexity and Expressiveness 55
52 References 6/6 L. Stockmeyer. The Polynomial-Time Hierarchy G. Tseitin. On the Complexity of Derivation in Propositional Calculus A. van Gelder. Variable Independence and Resolution Paths Uwe Bubeck QBF: Complexity and Expressiveness 56
A New 3-CNF Transformation by Parallel-Serial Graphs 1
A New 3-CNF Transformation by Parallel-Serial Graphs 1 Uwe Bubeck, Hans Kleine Büning University of Paderborn, Computer Science Institute, 33098 Paderborn, Germany Abstract For propositional formulas we
More informationReasoning with Quantified Boolean Formulas
Reasoning with Quantified Boolean Formulas Martina Seidl Institute for Formal Models and Verification Johannes Kepler University Linz 1 What are QBF? Quantified Boolean formulas (QBF) are formulas of propositional
More informationPreprocessing QBF: Failed Literals and Quantified Blocked Clause Elimination
Preprocessing QBF: Failed Literals and Quantified Blocked Clause Elimination Florian Lonsing (joint work with Armin Biere and Martina Seidl) Institute for Formal Models and Verification (FMV) Johannes
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 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 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 informationProof Complexity of Quantified Boolean Formulas
Proof Complexity of Quantified Boolean Formulas Olaf Beyersdorff School of Computing, University of Leeds Olaf Beyersdorff Proof Complexity of Quantified Boolean Formulas 1 / 39 Proof complexity (in one
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 informationClause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Journal of Artificial Intelligence Research 1 (1993) 1-15 Submitted 6/91; published 9/91 Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas Enrico Giunchiglia Massimo
More informationPart 1: Propositional Logic
Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax
More informationWorst-Case Upper Bound for (1, 2)-QSAT
Worst-Case Upper Bound for (1, 2)-QSAT Minghao Yin Department of Computer, Northeast Normal University, Changchun, China, 130117 ymh@nenu.edu.cn Abstract. The rigorous theoretical analysis of the algorithm
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 informationDependency Schemes in QBF Calculi: Semantics and Soundness
Dependency Schemes in QBF Calculi: Semantics and Soundness Olaf Beyersdorff and Joshua Blinkhorn School of Computing, University of Leeds, UK {O.Beyersdorff,scjlb}@leeds.ac.uk Abstract. We study the parametrisation
More informationTutorial 1: Modern SMT Solvers and Verification
University of Illinois at Urbana-Champaign Tutorial 1: Modern SMT Solvers and Verification Sayan Mitra Electrical & Computer Engineering Coordinated Science Laboratory University of Illinois at Urbana
More informationPropositional Fragments for Knowledge Compilation and Quantified Boolean Formulae
Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae Sylvie Coste-Marquis and Daniel Le Berre and Florian Letombe and Pierre Marquis CRIL/CNRS, Université d Artois, F-62307
More informationModel-Based Transformations for Quantified Boolean Formulas
Model-Based Transformations for Quantified Boolean Formulas Uwe Bubeck Dissertation in Computer Science submitted to the Faculty of Electrical Engineering, Computer Science and Mathematics University of
More informationCSE 555 HW 5 SAMPLE SOLUTION. Question 1.
CSE 555 HW 5 SAMPLE SOLUTION Question 1. Show that if L is PSPACE-complete, then L is NP-hard. Show that the converse is not true. If L is PSPACE-complete, then for all A PSPACE, A P L. We know SAT PSPACE
More informationNormal Forms of Propositional Logic
Normal Forms of Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 12, 2017 Bow-Yaw Wang (Academia Sinica) Normal Forms of Propositional Logic September
More informationBounded-width QBF is PSPACE-complete
Bounded-width QBF is PSPACE-complete Albert Atserias Universitat Politècnica de Catalunya Barcelona, Spain atserias@lsi.upc.edu Sergi Oliva Universitat Politècnica de Catalunya Barcelona, Spain oliva@lsi.upc.edu
More informationSolvers for the Problem of Boolean Satisfiability (SAT) Will Klieber Aug 31, 2011
Solvers for the Problem of Boolean Satisfiability (SAT) Will Klieber 15-414 Aug 31, 2011 Why study SAT solvers? Many problems reduce to SAT. Formal verification CAD, VLSI Optimization AI, planning, automated
More information1 PSPACE-Completeness
CS 6743 Lecture 14 1 Fall 2007 1 PSPACE-Completeness Recall the NP-complete problem SAT: Is a given Boolean formula φ(x 1,..., x n ) satisfiable? The same question can be stated equivalently as: Is the
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 informationSubclasses of Quantied Boolean Formulas. Andreas Flogel. University of Duisburg Duisburg 1. Marek Karpinski. University of Bonn.
Subclasses of Quantied Boolean Formulas Andreas Flogel Department of Computer Science University of Duisburg 4100 Duisburg 1 Mare Karpinsi Department of Computer Science University of Bonn 5300 Bonn 1
More informationCompendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
Electronic Colloquium on Computational Complexity, Report No. 143 (2014) Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy Ronald de Haan, Stefan Szeider Institute of Information
More informationThe Calculus of Computation: Decision Procedures with Applications to Verification. Part I: FOUNDATIONS. by Aaron Bradley Zohar Manna
The Calculus of Computation: Decision Procedures with Applications to Verification Part I: FOUNDATIONS by Aaron Bradley Zohar Manna 1. Propositional Logic(PL) Springer 2007 1-1 1-2 Propositional Logic(PL)
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 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 informationPropositional Logic. Methods & Tools for Software Engineering (MTSE) Fall Prof. Arie Gurfinkel
Propositional Logic Methods & Tools for Software Engineering (MTSE) Fall 2017 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/
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 informationCS156: The Calculus of Computation
CS156: The Calculus of Computation Zohar Manna Winter 2010 It is reasonable to hope that the relationship between computation and mathematical logic will be as fruitful in the next century as that between
More informationResolution on Quantified Generalized Clause-sets
Journal on Satisfiability, Boolean Modeling and Computation 7 (2010) 17-34 Resolution on Quantified Generalized Clause-sets Jiwei Jin Xishun Zhao Institute of Logic and Cognition, Sun Yat-sen University,
More informationIncremental QBF Solving by DepQBF
Incremental QBF Solving by DepQBF Florian Lonsing and Uwe Egly Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group http://www.kr.tuwien.ac.at/ Abstract. The logic
More informationBounded Universal Expansion for Preprocessing QBF
SAT 2007 Bounded Universal Expansion for Preprocessing QBF Uwe Bubeck and Hans Kleine Büning International Graduate School Dynamic Intelligent Systems, University of Paderborn 30.5.2007 Outline Introduction
More informationCS 512, Spring 2017, Handout 10 Propositional Logic: Conjunctive Normal Forms, Disjunctive Normal Forms, Horn Formulas, and other special forms
CS 512, Spring 2017, Handout 10 Propositional Logic: Conjunctive Normal Forms, Disjunctive Normal Forms, Horn Formulas, and other special forms Assaf Kfoury 5 February 2017 Assaf Kfoury, CS 512, Spring
More informationPropositional logic. Programming and Modal Logic
Propositional logic Programming and Modal Logic 2006-2007 4 Contents Syntax of propositional logic Semantics of propositional logic Semantic entailment Natural deduction proof system Soundness and completeness
More informationThe Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees
The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees Karsten Lehmann a, Rafael Peñaloza b a Optimisation Research Group, NICTA Artificial Intelligence Group, Australian National
More informationPROPOSITIONAL LOGIC. VL Logik: WS 2018/19
PROPOSITIONAL LOGIC VL Logik: WS 2018/19 (Version 2018.2) Martina Seidl (martina.seidl@jku.at), Armin Biere (biere@jku.at) Institut für Formale Modelle und Verifikation BOX Game: Rules 1. The game board
More informationSolving QBF with Combined Conjunctive and Disjunctive Normal Form
Solving QBF with Combined Conjunctive and Disjunctive Normal Form Lintao Zhang Microsoft Research Silicon Valley Lab 65 La Avenida, Mountain View, CA 94043, USA lintaoz@microsoft.com Abstract Similar to
More informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
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 informationAutomated Program Verification and Testing 15414/15614 Fall 2016 Lecture 2: Propositional Logic
Automated Program Verification and Testing 15414/15614 Fall 2016 Lecture 2: Propositional Logic Matt Fredrikson mfredrik@cs.cmu.edu October 17, 2016 Matt Fredrikson Propositional Logic 1 / 33 Propositional
More informationPropositional and Predicate Logic - V
Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus
More informationFormal Verification Methods 1: Propositional Logic
Formal Verification Methods 1: Propositional Logic John Harrison Intel Corporation Course overview Propositional logic A resurgence of interest Logic and circuits Normal forms The Davis-Putnam procedure
More informationCOMP219: Artificial Intelligence. Lecture 20: Propositional Reasoning
COMP219: Artificial Intelligence Lecture 20: Propositional Reasoning 1 Overview Last time Logic for KR in general; Propositional Logic; Natural Deduction Today Entailment, satisfiability and validity Normal
More informationShamir s Theorem. Johannes Mittmann. Technische Universität München (TUM)
IP = PSPACE Shamir s Theorem Johannes Mittmann Technische Universität München (TUM) 4 th Joint Advanced Student School (JASS) St. Petersburg, April 2 12, 2006 Course 1: Proofs and Computers Johannes Mittmann
More informationAn Alternative Representation for QBF
An Alternative Representation for QBF Anja Remshagen 1 and Klaus Truemper 2 1 Department of Computer Science, University of West Georgia, Carrollton, Georgia, USA 2 Department of Computer Science, University
More information2.5.2 Basic CNF/DNF Transformation
2.5. NORMAL FORMS 39 On the other hand, checking the unsatisfiability of CNF formulas or the validity of DNF formulas is conp-complete. For any propositional formula φ there is an equivalent formula in
More informationPropositional logic. Programming and Modal Logic
Propositional logic Programming and Modal Logic 2006-2007 4 Contents Syntax of propositional logic Semantics of propositional logic Semantic entailment Natural deduction proof system Soundness and completeness
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 informationNon-Deterministic Time
Non-Deterministic Time Master Informatique 2016 1 Non-Deterministic Time Complexity Classes Reminder on DTM vs NDTM [Turing 1936] (q 0, x 0 ) (q 1, x 1 ) Deterministic (q n, x n ) Non-Deterministic (q
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationLecture 8: Complete Problems for Other Complexity Classes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 8: Complete Problems for Other Complexity Classes David Mix Barrington and Alexis Maciel
More informationComplexity results for Quantified Boolean Formulae based on complete propositional languages
Journal on Satisfiability, Boolean Modeling and Computation 1 (2006) 61 88 Complexity results for Quantified Boolean Formulae based on complete propositional languages Sylvie Coste-Marquis Daniel Le Berre
More informationValidating QBF Invalidity in HOL4
Interactive Theorem Proving (ITP) 14 July, 2010 Quantified Boolean Formulae Quantified Boolean Formulae Motivation System Overview Related Work QBF = propositional logic + quantifiers over Boolean variables
More informationA PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving
Preprint from 33th AAAI Conference on Artificial Intelligence (AAAI-19), January 2019, Honolulu, USA A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving Christoph Scholl,1
More informationBoolean Propagation Based on Literals for Quantified Boolean Formulae
Boolean Propagation Based on Literals for Quantified Boolean Formulae Igor Stéphan 1 Abstract. This paper proposes a new set of propagation rules for quantified Boolean formulae based on literals and generated
More informationLecture 8. MINDNF = {(φ, k) φ is a CNF expression and DNF expression ψ s.t. ψ k and ψ is equivalent to φ}
6.841 Advanced Complexity Theory February 28, 2005 Lecture 8 Lecturer: Madhu Sudan Scribe: Arnab Bhattacharyya 1 A New Theme In the past few lectures, we have concentrated on non-uniform types of computation
More informationPropositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel
Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/
More information3 Propositional Logic
3 Propositional Logic 3.1 Syntax 3.2 Semantics 3.3 Equivalence and Normal Forms 3.4 Proof Procedures 3.5 Properties Propositional Logic (25th October 2007) 1 3.1 Syntax Definition 3.0 An alphabet Σ consists
More informationPart 1: Propositional Logic
Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax
More informationComplexity Theory. Knowledge Representation and Reasoning. November 2, 2005
Complexity Theory Knowledge Representation and Reasoning November 2, 2005 (Knowledge Representation and Reasoning) Complexity Theory November 2, 2005 1 / 22 Outline Motivation Reminder: Basic Notions Algorithms
More informationPropositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.
Propositional Logic Winter 2012 Propositional Logic: Section 1.1 Proposition A proposition is a declarative sentence that is either true or false. Which ones of the following sentences are propositions?
More informationTowards an Optimal CNF Encoding of Boolean Cardinality Constraints
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints (Technical Report) Carsten Sinz Symbolic Computation Group, WSI for Computer Science University of Tübingen, 72076 Tübingen, Germany sinz@informatik.uni-tuebingen.de
More informationIntroduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010
Introduction to Artificial Intelligence Propositional Logic & SAT Solving UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Today Representation in Propositional Logic Semantics & Deduction
More informationNon-CNF QBF Solving with QCIR
Non-CNF QBF Solving with QCIR Charles Jordan Graduate School of Information Science and Technology Hokkaido University Will Klieber Software Engineering Institute Carnegie Mellon University Martina Seidl
More informationFast DQBF Refutation
Fast DQBF Refutation Bernd Finkbeiner and Leander Tentrup Saarland University Abstract. Dependency Quantified Boolean Formulas (DQBF) extend QBF with Henkin quantifiers, which allow for non-linear dependencies
More informationLinear-time Temporal Logic
Linear-time Temporal Logic Pedro Cabalar Department of Computer Science University of Corunna, SPAIN cabalar@udc.es 2015/2016 P. Cabalar ( Department Linear oftemporal Computer Logic Science University
More informationTecniche di Verifica. Introduction to Propositional Logic
Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called
More informationIntroduction to Solving Combinatorial Problems with SAT
Introduction to Solving Combinatorial Problems with SAT Javier Larrosa December 19, 2014 Overview of the session Review of Propositional Logic The Conjunctive Normal Form (CNF) Modeling and solving combinatorial
More informationPropositional and First Order Reasoning
Propositional and First Order Reasoning Terminology Propositional variable: boolean variable (p) Literal: propositional variable or its negation p p Clause: disjunction of literals q \/ p \/ r given by
More informationCSE507. Introduction. Computer-Aided Reasoning for Software. Emina Torlak courses.cs.washington.edu/courses/cse507/17wi/
Computer-Aided Reasoning for Software CSE507 courses.cs.washington.edu/courses/cse507/17wi/ Introduction Emina Torlak emina@cs.washington.edu Today What is this course about? Course logistics Review of
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 31. Propositional Logic: DPLL Algorithm Malte Helmert and Gabriele Röger University of Basel April 24, 2017 Propositional Logic: Overview Chapter overview: propositional
More informationConjunctive Normal Form and SAT
Notes on Satisfiability-Based Problem Solving Conjunctive Normal Form and SAT David Mitchell mitchell@cs.sfu.ca October 4, 2015 These notes are a preliminary draft. Please use freely, but do not re-distribute
More informationLecture 11: Proofs, Games, and Alternation
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 11: Proofs, Games, and Alternation David Mix Barrington and Alexis Maciel July 31, 2000
More informationα-formulas β-formulas
α-formulas Logic: Compendium http://www.ida.liu.se/ TDDD88/ Andrzej Szalas IDA, University of Linköping October 25, 2017 Rule α α 1 α 2 ( ) A 1 A 1 ( ) A 1 A 2 A 1 A 2 ( ) (A 1 A 2 ) A 1 A 2 ( ) (A 1 A
More informationPropositional logic. First order logic. Alexander Clark. Autumn 2014
Propositional logic First order logic Alexander Clark Autumn 2014 Formal Logic Logical arguments are valid because of their form. Formal languages are devised to express exactly that relevant form and
More informationThis is an author-deposited version published in : Eprints ID : 16897
Open Archive TOULOUSE Archive Ouverte (OATAO) OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. This is an author-deposited
More informationDetecting Backdoor Sets with Respect to Horn and Binary Clauses
Detecting Backdoor Sets with Respect to Horn and Binary Clauses Naomi Nishimura 1,, Prabhakar Ragde 1,, and Stefan Szeider 2, 1 School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L
More informationGeneralizations of Matched CNF Formulas
Generalizations of Matched CNF Formulas Stefan Szeider (szeider@cs.toronto.edu) Department of Computer Science, University of Toronto, M5S 3G4 Toronto, Ontario, Canada Abstract. A CNF formula is called
More informationPropositional and Predicate Logic. jean/gbooks/logic.html
CMSC 630 February 10, 2009 1 Propositional and Predicate Logic Sources J. Gallier. Logic for Computer Science, John Wiley and Sons, Hoboken NJ, 1986. 2003 revised edition available on line at http://www.cis.upenn.edu/
More informationProving QBF-Hardness in Bounded Model Checking for Incomplete Designs
Proving QBF-Hardness in Bounded Model Checking for Incomplete Designs Christian Miller and Christoph Scholl and Bernd Becker Institute of Computer Science University of Freiburg, Germany millerc scholl
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More informationExercises 1 - Solutions
Exercises 1 - Solutions SAV 2013 1 PL validity For each of the following propositional logic formulae determine whether it is valid or not. If it is valid prove it, otherwise give a counterexample. Note
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationIntro to Theory of Computation
Intro to Theory of Computation LECTURE 25 Last time Class NP Today Polynomial-time reductions Adam Smith; Sofya Raskhodnikova 4/18/2016 L25.1 The classes P and NP P is the class of languages decidable
More informationAnnouncements. Friday Four Square! Problem Set 8 due right now. Problem Set 9 out, due next Friday at 2:15PM. Did you lose a phone in my office?
N P NP Completeness Announcements Friday Four Square! Today at 4:15PM, outside Gates. Problem Set 8 due right now. Problem Set 9 out, due next Friday at 2:15PM. Explore P, NP, and their connection. Did
More informationLogic: First Order Logic
Logic: First Order Logic Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More informationChapter 3 Deterministic planning
Chapter 3 Deterministic planning In this chapter we describe a number of algorithms for solving the historically most important and most basic type of planning problem. Two rather strong simplifying assumptions
More informationECE473 Lecture 15: Propositional Logic
ECE473 Lecture 15: Propositional Logic Jeffrey Mark Siskind School of Electrical and Computer Engineering Spring 2018 Siskind (Purdue ECE) ECE473 Lecture 15: Propositional Logic Spring 2018 1 / 23 What
More informationNP-Completeness Part II
NP-Completeness Part II Please evaluate this course on Axess. Your comments really do make a difference. Announcements Problem Set 8 due tomorrow at 12:50PM sharp with one late day. Problem Set 9 out,
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 informationCS156: The Calculus of Computation Zohar Manna Autumn 2008
Page 3 of 52 Page 4 of 52 CS156: The Calculus of Computation Zohar Manna Autumn 2008 Lecturer: Zohar Manna (manna@cs.stanford.edu) Office Hours: MW 12:30-1:00 at Gates 481 TAs: Boyu Wang (wangboyu@stanford.edu)
More informationPropositional and Predicate Logic - II
Propositional and Predicate Logic - II Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - II WS 2016/2017 1 / 16 Basic syntax Language Propositional logic
More information6.841/18.405J: Advanced Complexity Wednesday, February 12, Lecture Lecture 3
6.841/18.405J: Advanced Complexity Wednesday, February 12, 2003 Lecture Lecture 3 Instructor: Madhu Sudan Scribe: Bobby Kleinberg 1 The language MinDNF At the end of the last lecture, we introduced the
More informationLecture 2 Propositional Logic & SAT
CS 5110/6110 Rigorous System Design Spring 2017 Jan-17 Lecture 2 Propositional Logic & SAT Zvonimir Rakamarić University of Utah Announcements Homework 1 will be posted soon Propositional logic: Chapter
More informationCSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker
CSCE 222 Discrete Structures for Computing Propositional Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Propositions A proposition is a declarative sentence that is either true or false
More informationLecture 22: PSPACE
6.045 Lecture 22: PSPACE 1 VOTE VOTE VOTE For your favorite course on automata and complexity Please complete the online subject evaluation for 6.045 2 Final Exam Information Who: You On What: Everything
More informationRepresenting Policies for Quantified Boolean Formulas
Representing Policies for Quantified Boolean Formulas Sylvie Coste-Marquis CRIL Univ. d Artois, Lens, France Hélène Fargier and Jérôme Lang IRIT Univ. Paul Sabatier, Toulouse, France Daniel Le Berre and
More information