Learning Coni uiict ions of Horn Cla,uses
|
|
- Cameron Ross
- 5 years ago
- Views:
Transcription
1 Learning Coni uiict ions of Horn Cla,uses (extended abstract) Da.na Angluin* Computer Science Yale University New Haven, CT cs. y ale. edu Michael F razier Computer Science University of Illinois Urbana, Illinois uiuc. edu Leonard Pittt Computer Science University of Illinois Urbana, Illinois pitt@cs.uiuc.edu Abstract An algorithm is presented for learning the class of Boolean formulas that are expressible as conjunctions of Horn clauses. (A Horn clause is a disjunction of literals, all but at most one of which is a negated variable.) The algorithm uses equivalence queries and membership queries to produce a formula that is logically equivalent to the unknown formula to be learned. The amount of time used by the algorithm is polynomial in the number of variables and the number of clauses in the unknown formula. 1 The Problem A central question in the theory of concept learning is to determine those types of Boolean formulas that can be learned in polynomial time. To date, relatively few algorithms for learning restricted classes of Boolean formulas are known, although a number of learning algorithms have been given for other types of concepts (see, for example, many of the papers in [9, 131). Algorithms that have been given for learning restricted classes of Boolean formulas include algorithms for learning monomials (pure conjunctive concepts) [11, 141, internal disjunctive concepts [6], readonce formulas [4], monotone DNF formulas [2, 141, kcnf and kdnf formulas for constant k [5, 11, 151. These algorithms use a variety of different natural learning protocols. In this paper we extend this colledion of positive results by giving a polynomial-time algorithm that learns the class of Horn sentences using equzvalence and men1 bershzp queries. Supported by NSF Grant IRI-SilS975. +Supported by NSF Grant IRI-S8095iO and by the Department of Computer Science, University of Illinois at UrlJana- Cliampaign. Let V = vi,..., U, be a set of Boolean variables. A literal is either a variable vi or its negation -vi. A clause over variable set V is a disjunction of literals. A Horn clause is a clause in which at most one literal is unnegated. A Horn sentence is a conjunction of Horn clauses. The class of Horn sentences over variable set I/ is a proper subclass of the class of Boolean formulas over V. Let H, denote the target Horn sentence to be learned. The following protocol is used: The learning algorithm may propose as a hypothesis any Horn sentence H by making an equivalence query to an oracle. If H is logically equivalent to H, then the answer to the query is yes and the learning algorithm has succeeded in the inference task, and halts. Otherwise, the answer to the equivalence query is no, and the learning algorithm receives a counterexample - an assignment T : V + {true,fulse} that satisfies H, but does not satisfy H (a positive counterexample), or vice-versa (a negatzve counterexample). A membership query is any assignment 2 to the variables, and the answer to the membership query is yes if 2 satisfies the target formula H,, and no otherwise. The algorithm runs in time U(m3n4), making O(m2n2) equivalence queries and O(m2n) membership queries, where m is the number of clauses, and n is the number of variables of H,. In the full paper, by employing a carefully chosen representation for Horn sentences, these bounds are improved to O(m2n2), O(mn), and O( m2 n), respectively. It. is interesting to note that both types of queries are necessary for learning Horn sentences. Angluin [a] shows that membership queries alone are insufficient for polynomial-time learning, and, implicitly in [l], she proves that equivalence queries alone a.re also insufficient. The 00, or soft-o, notation is similar Lo the usual 00 1lotat.ioii except that 00 ignoi.es logarithmic factors. CH2925-6/90/0000/0186$01.00 Q 1990 IEEE 186
2 A similar result for learning monotone formulas in disjunctive normal form (DNF) has been given [2, 141 The dual of the class of Horn sentences is the class of almost monot,one DNF formulas - a disjunct of t,erms, where each t,erm is a conjunct of literals, at most one of which is negated. Since our algorithm is easily modified to handle the dual class, it extends the results in [2, 141 by allowing a small amount of nonmonotonicity. (In the conclusion we indicate why allowing more nonmonotonicity would yield a difficult problem.) Horn sentences are an interesting nontrivial subclass of CNF (dual: DNF) formulas, the learnability of which remains a central open problem for the distribution-independent ( PAC-learning ) model of Valiant [14]. The research presented here also improves the results in [3], where the class of Horn sentences is shown to be learnable by an algorithm that uses equivalence queries that return Horn clauses as counterexamples and derivation queries - a type of query that is significantly more powerful than a membership query. The relationships between our results and previous work are explained in more detail in the full paper. By modifying the algorithm presented here in a relatively straightforward way [a] we could obtain an algorithm that learns the class of Horn sentences using randomly generated examples as in the PAC-learning model, provided that the algorithm is additionally allowed to make membership queries. Similarly, the algorithm presented here could be used in an on-line setting in which the learning algorithm is to classify each of a succession of examples, and the algorithm is told whether its classification is correct or incorrect before receiving each next example. The resulting on-line algorithm makes membership queries (excluding the examples to be classified) but not equivalence queries, and is guaranteed to make at most a polynomial number of errors of classification regardless of the sequence of examples [2]. Note that because the problem of determining whether two Horn sentences are equivalent (and producing a counterexa.mple if they are not) is solvable in polynomial time, the oracle in our learning protocol could be replaced by a teacher with polynomially bounded computational resources. 2 Preliminaries It is often easier to discuss the sa tisfaction or falsification of a Horn clause when- that clause is represented as an implication. To expedite the discussion we will implicitly assume that all Horn clauses are represented as implications. This necessitates the introduction of two logical constants Definition 1 The logical constant true is represented by T and the logical constant false is represented by F. Next, we introduce notation that will enable us to dissect Horn clauses and discuss the relationships between them and examples. First, recall the identity zvvf=, -wi G vi) ~ z where, 3 is the logical connective for implication and E is a metasymbol in- dicating logical equivalence. Now, taking A:=l U; = T (the empty conjunction evaluates to true) and adopt- 0 ing the convention that we write Ai =, v, 3F when there are no unnegated variables in the Horn clause, we have the following definitions. Definition 2 Let H be any Horn sentence over V. An example is any assignment x : V 4 {true, false}. A positive (respectively, negative) example for H is an. assignment x such that H evaluates to true (respectively, false) when each variable v in H is replaced by 4.). Definition 3 Let x be an example; then true(x) is the set of variables assigned the value %we by x and false(x) is the set of variables assigned the value false by x. By convention, T E true(x) and F E false(z). Definition 4 Let C be a Horn clause. Then antecedent (C) is the set of variables that occur negated in C. If C contains an unnegated variable z, then consequent (C) is just z. Otherwise, C contains only negated variables and consequent(c) as F. We now describe the relationships that may exist between an example and a Horn clause. Definition 5 An example x is said to cover a Horn clause C if antecehent(c) c true(x). We say that x does not cover C if antecedent(c) true(x). The example x is said to violate the Horn clause C if x covers C and consequent(c) E false(x). Notice that if x violates C then x must cover C, but that the converse does not necessarily hold. It will be more convenient throughout the rest of the paper to consider a Horn sentence as a set of Horn clauses, representing the conjunction of the clauses. Our first observation is trivial, but it is helpful to state it. formally. Proposition 1 If x is a negatzve example for the Horn sentence I, then x violates some clause of H.
3 We next define the n operation for examples. Definition 6 Let x and s be two examples, then xns is defined to be the example z such that true(z) = true(x)ntrue(s). Note that this implies that fa/se(xns) is false (x)ufalse(s). Lemma 1 Let x and s be examples. If x violates C and s covers C, then xns violates C. Proof: Ifs covers C then antecedent(c) true(s). Also, if x violates C, then antecedent(c) C Irue(x) and consequent(c) E false(x). Thus antecedent(c) C true(s)n true(x) = true(snx) and consequent(c) E false(x) false(s)ufalse(x) = false(snx). Thus, snx violates C. 0 Corollary 1 Let x and s be ezamples. If x violates C and s violates C, then xns violates C. Proof: Apply lemma 1 after noting that ifs violates C then it also covers C. 0 Lemma 2 If x does not cover C, then for any example s, xns does not violate C. Proof: If antecedent(c) true(z) then aniecedent(c) true(x)ntrue(s) = true(xns). Thus Xns does not violate C. 0 Lemma 3 If xns violates C, then at least one of x and s violates C. 1 Set S to be the empty sequence /* s, denotes the 1-th element of S. */ 2 Set H to be the empty hypothesis 3 UNTIL equivalent( H) returns yes DO 4 BEGIN /* main loop */ 5 Let z be the counterexample returned by the equivalence query 6 IF 2 violates at least one clause of H 7 THEN /* x is a positive example */ 8 remove from H every clause that 3: violates 9 ELSE /* x is a negative example */ 10 BEGIN 11 FOR each s, in S such that trse(s,fir) is properly contained in true(s,) 12 BEGIN 13 query member(s,nz) 14 END ENDIF 20 IF any of these queries is answered no THEN let a be the least number such that member(s,nz) was answered no refine s, by replacing s, with s,nx ELSE add I as the last element in the sequence S Set H to be AsCS claases(s), where clauses(s) = {(/\vctrue(s) v)*z : z E farse(s)> 21 END 22 ENDIF 23 END /* main loop */ 24 Return H Figure 1: Algorithm for Learning Horn Sentences whenever a new negative counterexample x is obtained. There are two problems with this approach. The 3 The Algorithm Let H, be the target Horn sentence with respect to which equivalence and membership queries are answered. The algorithm is based on the following ideas. Every negative example x violates some clause C of H,. From x we would like to add the clause C to our current hypothesis, but we cannot exactly determine C from x alone. We know however that antecedenl(c) C true(x), and consequent(c) E false(x). Thus one approach would be to add to our current hypothesis H all elements of the set clauses(x) = {( A v)*z : i E fnlse(x)> u~ true(z ) of the elements of clauses(x) that is added is (A\vEtrue(z) v)jconsequent(c), where C is some clause of H, that x violates. This clause may be less restrictive than C because its antecedent may be more restrictive. Thus, the negative examples that fail to satisfy this clause may be only a small fraction of those that fail to satisfy C, and the clause added to H is only an approximation of C. Very many such approximations to the target clause C may be generated by the examples. This latter problem is dealt with by searching for a 2The clause (l\vetrue(r) v)*f is in the set c/auses(z), since by convention F E fa/se(x). This particular clause is meant to cover the case where the clause C that is violated by z cont.ains no unnegated variables. 188
4 set of negative examples with as few true variables as possible - these correspond to better approximations to cla.uses of H,. A new negative example is used to attempt to refine previously obtained negative examples by intersection - each such intersection, if it actually contains fewer true variables than the previously obtained negative example, is then tested to see whether it is negative (using a membership query.) If so, it is a candidate to refine the previously obtained negative example. The algorithm maintains a sequence S of negative examples. Each new negative counterexample is used to either refine one element of S, or is added to the end of S. In order to learn all of the clauses of H,, we would like the clauses induced by the (negative) examples in S to approximate distinct clauses of H,. This will happen if the examples in S violate distinct clauses of H,. Overzealous refinement may result in several examples in S violating the same clause of H,. To avoid this, whenever a new negative counterexample could be used to refine several examples in the sequence S, only the leftmost among these is refined. 4 Correctness and Running Time First observe that the algorithm terminates only if the hypothesis and the target Horn sentence H, are equivalent. Therefore, if the algorithm terminates, it is correct. To show termination in polynomial time we first prove a couple of technical lemmas. Lemma 4 For each execution of the main loop of line 3, the following holds. Suppose that in step 5 of the algorithm a negative example x is obtained such that for some clause C of H, and for some s; E S, x violates C and si covers C. Then there is some j 5 i such that in step 17 the algorithm will refine sj by replacing sj with sj nx. Proof: The proof is by induction on the number of iterations k of the main loop of line 3. If k = 1, then the lemma is vacuously true, since the sequence S is empty upon execution of step 5. Assume inductively that the lemma holds for iterations 1,2,..., I; - 1 of the main loop, and assume that during the k-th execution of the loop, at step 5 a negative example I is obtained such that for some clause C of H, and for some s; E S, x violates C and si covers C. Clearly, if in step 17 of t,he k-th iteration, the algorithm refines some sj where j < i, then we are done. Suppose that t,his does not happen. Now by lemma 1, we know tha.t sinx is a negative example. It only remains to be shown that frue(sinz) is properly contained in true(si), for then si will be refined in step 17. Observe that each time the sequence S is modified, step 20 of the algorithm discards the old hypothesis and constructs a new hypothesis H from the elements currently in S. Further observe that during each execution of the main loop of line 3, either S is modified (lines 9-21), or else a clause is removed from H (line 8). Let j < k be the last execution of the main loop of line 3 during which S was modified. Then, during the j-th iteration, line 20 was executed and was reconstructed from S. At this time a clause C = (AvEtrue(r,)~) jconsequent(c) was included in H, where C is the clause-that and si both violate. Now C logically implies C, so C could not have been removed in line 8 during iterations j + 1,..., k of the main loop. Since the equivalence query only returns examples in the symmetric difference between the hypothesis H and the target H,, a negative example obtained in line 5 satisfies every clause of H. By assumption, z violates C, thus consequent(c) E false(s). But now if Irue(si) true(z), then I would violate 2, a contradiction. Therefore, true(sinz) is properly contained in true(si). Thus the algorithm will replace s; by sin2 in line Lemma 5 Let S be a sequence of elements constructed for the target H, by the algorithm. Then 1. VkV(i < k)v(c E H,) if sk violates C then si does not cover C 2. dkv(i # k)v(c E H,) if Sk violates c, then si does not violate C. Proof: The proof is by induction. We will show that properties 1 and 2 are preserved under any modifications the algorithm makes to the sequence S. Initially the sequence is empty, so both properties hold vacuously. Now suppose that the properties hold for some sequence, and suppose that the algorithm modifies the sequence in response to seeing the negative example x. If the algorithm appends x to the sequence as, say, st, then suppose by way of contradiction that property 1 fails to hold. Inductively, the only way that property 1 could now fail to hold is if there is some i < t such that s, covers some clause C of H, that st violates. But this means s,nx violates C. This together with lemma 4 contradicts the fact that the algorithm did not replace sj by sjn2 for some j 5 i. Thus property 1 is preserved. Now suppose by way of contradiction that property 2 fails to hold. Inductively, the only way property 2 could now fail to hold is if there is some i < t such that 5, and st both violate some clause C of H,. Since s, 189
5 violates C it also covers C. Then, by lemma 4, some sj with j 5 i would have been refined instead of x = st being added to S, a contradiction. Thus property 2 is preserved. Now suppose that instead of appending x to the sequence, the algorithm replaces some sk with Sknz. Suppose by way of contradiction t.hat property 1 fails to hold. There are two possibilities, either there is some i < k such that si covers and sknx violates some particular clause C of H, or there is some i > k such that Sknz covers and si violates some particular clause C of H,. If the former case holds, then by lemma 3 either z violates c or sk violates c. If x violates c then (since s; covers C) by lemma 4 there must be some j 5 i-< k such that s, was refined instead of sk, a contradiction. On the other hand, if sk violates c, then the fact that si and sk both violate C contradicts the inductive assumption that property 2 held before the modification. Now consider the latter possibility, namely that there is some i > k such that sknz covers and s; violates some clause C of H,. Then by (the contrapositive of) lemma 2, sk covers C. Since si violates C and i > k, this contradicts the inductive assumption that property 1 held before the modification. Thus, property 1 is preserved. Finally, suppose that the algorithm replaces some sk with sknx and suppose by way of contradiction that property 2 no longer holds. If this is the case, then there is some i # k such that si and sknx both violate some particular clause C of H,. By lemma 2, sk covers c. Further, by lemma 3, at least one of then the sk and z must violate c. If sk violates c, inductive assumption that property 2 held before the modification is contradicted by the fact that si also violates C. On the other hand, suppose x violates C. If i > k, then the fact the sk covers C contradicts the inductive assumption that property 1 held before the modification. If i < IC, then lemma 4 and the fact that si violates (and hence covers) C contradicts the fact that the algorithm did not replace sj by sj nz for some j 5 i. Thus, property 2 is preserved. 0 Corollary 2 At no time do two distinct elements in S violate the same clause of H,. Proof: This is property 2 of lemma 5. Lemma 6 Every element of S violates at least one clause of H,. Proof: Each of the elements in S is a negative example, thus by proposition 1, each of t.he elements violates some clause of H,. 0 Lemma 7 If H, has m clavses, then at no time are there more than m elements an the sequence S. Proof: This follows immediately from the fact that each of the elements in S violates some clause of H, but no two elements violate the same clause of H,. 0 Finally, we have our theorem. Theorem 1 A Horn sentence consisting ofm clauses over n variables can be learned exactly in time 0(m3n4) using O(m2n2) equivalence queries and O(m2n) membership q~eries.~ Proof: The only changes to the sequence S during any run of the algorithm involve either appending a new element to S, or refining an existing element. Thus IS1 cannot decrease during any execution of the main loop of the algorithm. But lemma 7 shows that there are at most m elements of S a.t any time. Thus line 18 is executed at most m times. Now observe that whenever any element si of the sequence S is refined (line 17), the resulting new i-th element is s, n x, which, by line 11, must contain strictly fewer variables assigned the value true than si. This can happen at most n times for each element of S. Thus line 17 is executed at most nm times. Whenever the ELSE clause at line 9 is executed, either line 17 or 18 must be executed. It follows that lines 9-21 are executed at most nm + m = (n + 1)m times. Note that this bounds the total number of membership queries made by (n + l)m2. Next observe that for any element s of S, the cardinality of false(s) is at most n + 1 (recalling that F E false(s)). Thus the cardinality of clauses(s) is at most nfl. Therefore, the number of clauses in any hypothesis H constructed in line 15 is at most (n + 1)m. Now, since each positive counterexample obtained in line 5 necessarily causes at least one clause to be removed from H by line 8, the equivalence query can produce at most (n+ 1)m positive counterexamples be- tween modifications to S. Therefore, line 8 is executed at most (n + 1) times. Since each execution of line 3 that does not result in termination causes execution of line 8 or lines 9-21, the total number of executions of line 3 (and hence the total number of equivalence queries made) is at most (n + 1)2m2 + (n + 1)m + 1. To complete the proof we need only show that the time needed for each execution of the main loop is 6(n2m). Using the facts (above) that at any time during the execution of the algorithm IS1 5 m and (HI 5 (n f l)m, and that each element of N consists 3These bounds are improved in the fnll paper to d(m2n2) time, O(mn) ec~iiivalence queries, and O(m2n) membership queries.
6 of at most n + 1 variables (antecedent + consequent), it is easily verified that th_e time needed to execute either of steps 8 and 20 is O(n2m), and that these steps dominate the time to execute one itera.tion of the main loop. 0 5 Conclusions A polynomial-time algorithm for learning Horn sentences using equivalence and membership queries was presented. By the results of Angluin [l, 21 neither type of query alone is sufficient to allow exact learning in polynomial time. The algorithm may be used to obtain an algorithm for PAC-learning or polynomial prediction [8, 121 of Horn sentences from randomly generated examples, provided that membership queries are also available to the algorithm. If membership queries are not available, it is an open problem whether Horn sentences are PAC-learnable or polynomial-time predictable (from random examples alone.) By the reductions of Kearns, Li, Pitt, and Valiant [lo] PAC-learnability of Horn sentences would imply PAC-learnability of general CNF and DNF sentences, and similarly for polynomial predictability. It is also an open problem whether general CNF or DNF formulas are PAC-learnable or polynomially predictable on randomly generated examples when membership queries are available. For any k, let k-quasi- Horn be the class of CNF formulas where each clause contains at most k unnegated literals. Thus l-quasi- Horn is just the class of Horn sentences, and is learnable using equivalence and membership queries. We have shown using prediction-preserving reductions [12] that if our algorithm could be extended to learn the class of 2-quasi-Horn formulas using equivalence and membership queries then the general class of CNF formulas (and DNF formulas) would be polynomially predictable by an algorithm that uses membership queries and randomly generated examples. Finally, we are currently investigating the possibility of extending the algorithm here to handle restricted types of universally quantified Horn sentences (see the papers of Valiant [15] and Haussler [7] for related classes of formulas). This class is of significant interest due to its similarity to the language Prolog, and its use in logic programming and expert system design. References [l] D. Angluin. Negat,ive results for equivalence queries. Technical Rep or t YALE / D C S / RR- 648, Department of Computer Science, Yale University, September To appear, Machine Learning. A preliminary version appears in the Proceedings of the 1989 Workshop on Computationa.1 Learning Theory. D. Angluin. Queries and concept learning. Machine Learning, 2: , D. Angluin. Requests for hints that return no hints. Technical Report YALE/DCS/RR-647, Department of Computer Science, Yale University, D. Angluin, L. Hellerstein, and M. Karpinski. Learning read-once formulas with queries. Technical report, University of California at Berkeley, Report No. 89/528, (Also, International Computer Science Institute Technical Report TR ) A. Blumer, A. Ehrenfeucht, D. Haussler, and M; Warmuth. Learnability and the Vapnik- Chervonenkis dimension. J. ACM, 36(4): , October [GI D. Haussler. Quantifying inductive bias: AI learning algorithms and valiant,'^ learning framework. A rt zfic ia I Int e llig e n ce, ( 36) : , [7] D. Haussler. Learning conjunctive concepts in structural domains. Machine Learning, 4( 1):7-40, October [8] D. Haussler, N. Littlestone, and M. K. Warmuth. Predicting (0,l) functions on randomly drawn points. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages , Washington, D.C., October IEEE Computer Society Press. [9] D. Haussler and L. Pitt, editors. Proceedings of the 1988 Workshop on Computational Learning Theory. Morgan Kaufniann, San Mateo, CA, [lo] M. Kearns, M. Li, L. Pitt, and L. G. Valiant. On the learnability of Boolean formulae. In Proceedings of the 19th Annual ACMSymposium on Theory of Computing, New York, May ACM. [ll] N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2: , [12] L. Pitt and M. I(. Warmuth. Prediction preserving reducibility. Technical Report UCSC- CRL-88-26, Universit,y of California, Santa Cruz, 191
7 November Preliminary version appeared in Proceedings of the 3rd Annual IEEE Conference on Structure in Complexity Theory, pages 6049, June To appear in J. Comput. Sys. Sci. [14] L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11): , [I51 L. G. Valiant. Learning disjunctions of conjunctions. In Proceedings of the 9th International [13] R. L. Rivest,! D. Haussler, and M. K. Warmuth, Joint Conference on Artificial Intelligence, Vol. editors. Proceedings of the 1989 Workshop 011 I, pages , Los Angeles, California, August Computational Learning Theory. Morgan Kauf mann, San Mateo, CA, 1989.
Algorithms for Learning and Teaching. Sets of Vertices in Graphs. Patricia A. Evans and Michael R. Fellows. University of Victoria
Algorithms for Learning and Teaching Sets of Vertices in Graphs Patricia A. Evans and Michael R. Fellows Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada Lane H. Clark
More informationEfficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
NIPS 01 Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms oni Khardon Tufts University Medford, MA 02155 roni@eecs.tufts.edu Dan oth University of Illinois Urbana, IL 61801
More informationLearning Boolean Functions in an Infinite Attribute Space
Machine Learning, 9, 373-386 (1992) 1992 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Learning Boolean Functions in an Infinite Attribute Space AVRIM BLUM School of Computer Science,
More informationLearning Decision Lists
Machine Learning 2: 229 246, 1987 1987 Kluwer Academic Publishers, Boston - Manufactured in The Netherlands Learning Decision Lists RONALD L. RIVEST (RIVEST@THEORY.LCS.MIT.EDU) Laboratory for Computer
More informationEfficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms Roni Khardon Tufts University Medford, MA 02155 roni@eecs.tufts.edu Dan Roth University of Illinois Urbana, IL 61801 danr@cs.uiuc.edu
More informationSERGEI OBIEDKOV LEARNING HORN FORMULAS WITH QUERIES
SERGEI OBIEDKOV LEARNING HORN FORMULAS WITH QUERIES SUPERVISED LEARNING Input: a training set divided into (for example) two classes w.r.t. a certain target property. positive examples negative examples
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationSAT-CNF Is N P-complete
SAT-CNF Is N P-complete Rod Howell Kansas State University November 9, 2000 The purpose of this paper is to give a detailed presentation of an N P- completeness proof using the definition of N P given
More informationPrinciples of AI Planning. Principles of AI Planning. 7.1 How to obtain a heuristic. 7.2 Relaxed planning tasks. 7.1 How to obtain a heuristic
Principles of AI Planning June 8th, 2010 7. Planning as search: relaxed planning tasks Principles of AI Planning 7. Planning as search: relaxed planning tasks Malte Helmert and Bernhard Nebel 7.1 How to
More information9.1 Cook-Levin Theorem
CS787: Advanced Algorithms Scribe: Shijin Kong and David Malec Lecturer: Shuchi Chawla Topic: NP-Completeness, Approximation Algorithms Date: 10/1/2007 As we ve already seen in the preceding lecture, two
More information(a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are rational they can be written as the ratio of integers a 1
CS 70 Discrete Mathematics for CS Fall 2000 Wagner MT1 Sol Solutions to Midterm 1 1. (16 pts.) Theorems and proofs (a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are
More informationLearning with the Aid of an Oracle
' Learning with the Aid of an Oracle (1996; Bshouty, Cleve, Gavaldà, Kannan, Tamon) CHRISTINO TAMON, Computer Science, Clarkson University, http://www.clarkson.edu/ tino Exact Learning, Boolean Circuits,
More informationA proof-producing CSP solver: A proof supplement
A proof-producing CSP solver: A proof supplement Report IE/IS-2010-02 Michael Veksler Ofer Strichman mveksler@tx.technion.ac.il ofers@ie.technion.ac.il Technion Institute of Technology April 12, 2010 Abstract
More informationExact Algorithms Lecture 7: FPT Hardness and the ETH
Exact Algorithms Lecture 7: FPT Hardness and the ETH February 12, 2016 Lecturer: Michael Lampis 1 Reminder: FPT algorithms Definition 1. A parameterized problem is a function from (χ, k) {0, 1} N to {0,
More informationSTABILITY AND PARADOX IN ALGORITHMIC LOGIC
STABILITY AND PARADOX IN ALGORITHMIC LOGIC WAYNE AITKEN, JEFFREY A. BARRETT Abstract. Algorithmic logic is the logic of basic statements concerning algorithms and the algorithmic rules of deduction between
More informationConsistency and Set Intersection
Consistency and Set Intersection Yuanlin Zhang and Roland H.C. Yap National University of Singapore 3 Science Drive 2, Singapore {zhangyl,ryap}@comp.nus.edu.sg Abstract We propose a new framework to study
More informationByzantine Consensus in Directed Graphs
Byzantine Consensus in Directed Graphs Lewis Tseng 1,3, and Nitin Vaidya 2,3 1 Department of Computer Science, 2 Department of Electrical and Computer Engineering, and 3 Coordinated Science Laboratory
More informationExample of a Demonstration that a Problem is NP-Complete by reduction from CNF-SAT
20170926 CNF-SAT: CNF-SAT is a problem in NP, defined as follows: Let E be a Boolean expression with m clauses and n literals (literals = variables, possibly negated), in which - each clause contains only
More informationResolution (14A) Young W. Lim 6/14/14
Copyright (c) 2013-2014. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free
More information1. Suppose you are given a magic black box that somehow answers the following decision problem in polynomial time:
1. Suppose you are given a magic black box that somehow answers the following decision problem in polynomial time: Input: A CNF formula ϕ with n variables x 1, x 2,..., x n. Output: True if there is an
More informationSolution for Homework set 3
TTIC 300 and CMSC 37000 Algorithms Winter 07 Solution for Homework set 3 Question (0 points) We are given a directed graph G = (V, E), with two special vertices s and t, and non-negative integral capacities
More informationIntroduction. flni+ f[2p+plnn]
From: AAAI-91 Proceedings. Copyright 1991, AAAI (www.aaai.org). All rights reserved. ussein Almuallim and Thomas G. ietterich 303 Dearborn Hall Department of Computer Science Oregon State University Corvallis,
More informationThe Resolution Algorithm
The Resolution Algorithm Introduction In this lecture we introduce the Resolution algorithm for solving instances of the NP-complete CNF- SAT decision problem. Although the algorithm does not run in polynomial
More information== is a decent equivalence
Table of standard equiences 30/57 372 TABLES FOR PART I Propositional Logic Lecture 2 (Chapter 7) September 9, 2016 Equiences for connectives Commutativity: Associativity: P Q == Q P, (P Q) R == P (Q R),
More informationNP-Completeness of 3SAT, 1-IN-3SAT and MAX 2SAT
NP-Completeness of 3SAT, 1-IN-3SAT and MAX 2SAT 3SAT The 3SAT problem is the following. INSTANCE : Given a boolean expression E in conjunctive normal form (CNF) that is the conjunction of clauses, each
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
More informationLinear Time Unit Propagation, Horn-SAT and 2-SAT
Notes on Satisfiability-Based Problem Solving Linear Time Unit Propagation, Horn-SAT and 2-SAT David Mitchell mitchell@cs.sfu.ca September 25, 2013 This is a preliminary draft of these notes. Please do
More informationCS446: Machine Learning Fall Problem Set 4. Handed Out: October 17, 2013 Due: October 31 th, w T x i w
CS446: Machine Learning Fall 2013 Problem Set 4 Handed Out: October 17, 2013 Due: October 31 th, 2013 Feel free to talk to other members of the class in doing the homework. I am more concerned that you
More informationBoolean Functions (Formulas) and Propositional Logic
EECS 219C: Computer-Aided Verification Boolean Satisfiability Solving Part I: Basics Sanjit A. Seshia EECS, UC Berkeley Boolean Functions (Formulas) and Propositional Logic Variables: x 1, x 2, x 3,, x
More informationPaths, Flowers and Vertex Cover
Paths, Flowers and Vertex Cover Venkatesh Raman M. S. Ramanujan Saket Saurabh Abstract It is well known that in a bipartite (and more generally in a König) graph, the size of the minimum vertex cover is
More informationCS 395T Computational Learning Theory. Scribe: Wei Tang
CS 395T Computational Learning Theory Lecture 1: September 5th, 2007 Lecturer: Adam Klivans Scribe: Wei Tang 1.1 Introduction Many tasks from real application domain can be described as a process of learning.
More informationPROPOSITIONAL LOGIC (2)
PROPOSITIONAL LOGIC (2) based on Huth & Ruan Logic in Computer Science: Modelling and Reasoning about Systems Cambridge University Press, 2004 Russell & Norvig Artificial Intelligence: A Modern Approach
More informationEfficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries
Machine Learning, 37, 89 110 (1999) c 1999 Kluwer Academic Publishers. Manufactured in The Netherlands. Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries CARLOS
More informationAXIOMS FOR THE INTEGERS
AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,
More informationConstraint Acquisition
Constraint Acquisition Christian Bessiere University of Montpellier, France Frédéric Koriche University of Artois, France Nadjib Lazaar University of Montpellier, France Barry O Sullivan University College
More information2SAT Andreas Klappenecker
2SAT Andreas Klappenecker The Problem Can we make the following boolean formula true? ( x y) ( y z) (z y)! Terminology A boolean variable is a variable that can be assigned the values true (T) or false
More informationLearning Schema Mappings
Learning Schema Mappings Balder ten Cate UC Santa Cruz btencate@ucsc.edu Víctor Dalmau Universitat Pompeu Fabra victor.dalmau@upf.edu Phokion G. Kolaitis UC Santa Cruz & IBM Research Almaden kolaitis@cs.ucsc.edu
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationReductions and Satisfiability
Reductions and Satisfiability 1 Polynomial-Time Reductions reformulating problems reformulating a problem in polynomial time independent set and vertex cover reducing vertex cover to set cover 2 The Satisfiability
More informationFINAL EXAM SOLUTIONS
COMP/MATH 3804 Design and Analysis of Algorithms I Fall 2015 FINAL EXAM SOLUTIONS Question 1 (12%). Modify Euclid s algorithm as follows. function Newclid(a,b) if a
More informationFOUR EDGE-INDEPENDENT SPANNING TREES 1
FOUR EDGE-INDEPENDENT SPANNING TREES 1 Alexander Hoyer and Robin Thomas School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT We prove an ear-decomposition theorem
More information1.4 Normal Forms. We define conjunctions of formulas as follows: and analogously disjunctions: Literals and Clauses
1.4 Normal Forms We define conjunctions of formulas as follows: 0 i=1 F i =. 1 i=1 F i = F 1. n+1 i=1 F i = n i=1 F i F n+1. and analogously disjunctions: 0 i=1 F i =. 1 i=1 F i = F 1. n+1 i=1 F i = n
More informationAnswer Key #1 Phil 414 JL Shaheen Fall 2010
Answer Key #1 Phil 414 JL Shaheen Fall 2010 1. 1.42(a) B is equivalent to B, and so also to C, where C is a DNF formula equivalent to B. (By Prop 1.5, there is such a C.) Negated DNF meets de Morgan s
More informationarxiv: v2 [cs.cc] 29 Mar 2010
On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem. arxiv:1003.3704v2 [cs.cc] 29 Mar 2010 Peiyush Jain, Microsoft Corporation. June 28, 2018 Abstract In this paper we define a restricted
More informationCS 512, Spring 2017: Take-Home End-of-Term Examination
CS 512, Spring 2017: Take-Home End-of-Term Examination Out: Tuesday, 9 May 2017, 12:00 noon Due: Wednesday, 10 May 2017, by 11:59 am Turn in your solutions electronically, as a single PDF file, by placing
More informationMatching Theory. Figure 1: Is this graph bipartite?
Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to
More informationFoundations of AI. 9. Predicate Logic. Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution
Foundations of AI 9. Predicate Logic Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller 09/1 Contents Motivation
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationChecks and Balances - Constraint Solving without Surprises in Object-Constraint Programming Languages: Full Formal Development
Checks and Balances - Constraint Solving without Surprises in Object-Constraint Programming Languages: Full Formal Development Tim Felgentreff, Todd Millstein, Alan Borning and Robert Hirschfeld Viewpoints
More informationCharacterization of Boolean Topological Logics
Characterization of Boolean Topological Logics Short Form: Boolean Topological Logics Anthony R. Fressola Denison University Granville, OH 43023 University of Illinois Urbana-Champaign, IL USA 61801-61802
More informationDefinition: A context-free grammar (CFG) is a 4- tuple. variables = nonterminals, terminals, rules = productions,,
CMPSCI 601: Recall From Last Time Lecture 5 Definition: A context-free grammar (CFG) is a 4- tuple, variables = nonterminals, terminals, rules = productions,,, are all finite. 1 ( ) $ Pumping Lemma for
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationNP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.
CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT
More informationGreedy Algorithms 1. For large values of d, brute force search is not feasible because there are 2 d
Greedy Algorithms 1 Simple Knapsack Problem Greedy Algorithms form an important class of algorithmic techniques. We illustrate the idea by applying it to a simplified version of the Knapsack Problem. Informally,
More informationComplexity of unique list colorability
Complexity of unique list colorability Dániel Marx 1 Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest H-151, Hungary. Abstract Given a list
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationBipartite Roots of Graphs
Bipartite Roots of Graphs Lap Chi Lau Department of Computer Science University of Toronto Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only
More informationNP-Complete Reductions 2
x 1 x 1 x 2 x 2 x 3 x 3 x 4 x 4 12 22 32 CS 447 11 13 21 23 31 33 Algorithms NP-Complete Reductions 2 Prof. Gregory Provan Department of Computer Science University College Cork 1 Lecture Outline NP-Complete
More informationA Simplied NP-complete MAXSAT Problem. Abstract. It is shown that the MAX2SAT problem is NP-complete even if every variable
A Simplied NP-complete MAXSAT Problem Venkatesh Raman 1, B. Ravikumar 2 and S. Srinivasa Rao 1 1 The Institute of Mathematical Sciences, C. I. T. Campus, Chennai 600 113. India 2 Department of Computer
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationLeveraging Transitive Relations for Crowdsourced Joins*
Leveraging Transitive Relations for Crowdsourced Joins* Jiannan Wang #, Guoliang Li #, Tim Kraska, Michael J. Franklin, Jianhua Feng # # Department of Computer Science, Tsinghua University, Brown University,
More informationBinary Decision Diagrams
Logic and roof Hilary 2016 James Worrell Binary Decision Diagrams A propositional formula is determined up to logical equivalence by its truth table. If the formula has n variables then its truth table
More informationFUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC. Angel Garrido
Acta Universitatis Apulensis ISSN: 1582-5329 No. 22/2010 pp. 101-111 FUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC Angel Garrido Abstract. In this paper, we analyze the more adequate tools to solve many
More informationNotes for Recitation 8
6.04/8.06J Mathematics for Computer Science October 5, 00 Tom Leighton and Marten van Dijk Notes for Recitation 8 Build-up error Recall a graph is connected iff there is a path between every pair of its
More informationCUT VERTICES IN ZERO-DIVISOR GRAPHS OF FINITE COMMUTATIVE RINGS
CUT VERTICES IN ZERO-DIVISOR GRAPHS OF FINITE COMMUTATIVE RINGS M. AXTELL, N. BAETH, AND J. STICKLES Abstract. A cut vertex of a connected graph is a vertex whose removal would result in a graph having
More informationPolynomial SAT-Solver Algorithm Explanation
1 Polynomial SAT-Solver Algorithm Explanation by Matthias Mueller (a.k.a. Louis Coder) louis@louis-coder.com Explanation Version 1.0 - December 1, 2013 Abstract This document describes an algorithm that
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationSome Hardness Proofs
Some Hardness Proofs Magnus Lie Hetland January 2011 This is a very brief overview of some well-known hard (NP Hard and NP complete) problems, and the main ideas behind their hardness proofs. The document
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18 22.1 Introduction We spent the last two lectures proving that for certain problems, we can
More informationCombinatorial Optimization
Combinatorial Optimization Problem set 7: solutions. Formulate and solve an integer program for the following scenario. A trader of unusual objects is traveling with a caravan that begins in city A, proceeds
More informationMathematically Rigorous Software Design Review of mathematical prerequisites
Mathematically Rigorous Software Design 2002 September 27 Part 1: Boolean algebra 1. Define the Boolean functions and, or, not, implication ( ), equivalence ( ) and equals (=) by truth tables. 2. In an
More informationAn Eternal Domination Problem in Grids
Theory and Applications of Graphs Volume Issue 1 Article 2 2017 An Eternal Domination Problem in Grids William Klostermeyer University of North Florida, klostermeyer@hotmail.com Margaret-Ellen Messinger
More informationTable of Contents. Recognition of Facial Gestures... 1 Attila Fazekas
Table of Contents Recognition of Facial Gestures...................................... 1 Attila Fazekas II Recognition of Facial Gestures Attila Fazekas University of Debrecen, Institute of Informatics
More informationCSC Discrete Math I, Spring Sets
CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its
More informationTHREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.
THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of
More informationWinning Positions in Simplicial Nim
Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:
More informationJoint Entity Resolution
Joint Entity Resolution Steven Euijong Whang, Hector Garcia-Molina Computer Science Department, Stanford University 353 Serra Mall, Stanford, CA 94305, USA {swhang, hector}@cs.stanford.edu No Institute
More informationLearning Characteristic Structured Patterns in Rooted Planar Maps
Learning Characteristic Structured Patterns in Rooted Planar Maps Satoshi Kawamoto Yusuke Suzuki Takayoshi Shoudai Abstract Exting the concept of ordered graphs, we propose a new data structure to express
More informationConcept Learning (2) Aims. Introduction. t Previously we looked at concept learning in an arbitrary conjunctive representation
Acknowledgements Concept Learning (2) 14s1: COMP9417 Machine Learning and Data Mining School of Computer Science and Engineering, University of New South Wales Material derived from slides for the book
More informationCore Membership Computation for Succinct Representations of Coalitional Games
Core Membership Computation for Succinct Representations of Coalitional Games Xi Alice Gao May 11, 2009 Abstract In this paper, I compare and contrast two formal results on the computational complexity
More informationProgress Towards the Total Domination Game 3 4 -Conjecture
Progress Towards the Total Domination Game 3 4 -Conjecture 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006 South Africa
More informationSatisfiability Coding Lemma
! Satisfiability Coding Lemma Ramamohan Paturi, Pavel Pudlák, and Francis Zane Abstract We present and analyze two simple algorithms for finding satisfying assignments of -CNFs (Boolean formulae in conjunctive
More informationClustering with Interactive Feedback
Clustering with Interactive Feedback Maria-Florina Balcan and Avrim Blum Carnegie Mellon University Pittsburgh, PA 15213-3891 {ninamf,avrim}@cs.cmu.edu Abstract. In this paper, we initiate a theoretical
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationHere, we present efficient algorithms vertex- and edge-coloring graphs of the
SIAM J. ALG. DISC. METH. Vol. 7, No. 1, January 1986 (C) 1986 Society for Industrial and Applied Mathematics 016 EFFICIENT VERTEX- AND EDGE-COLORING OF OUTERPLANAR GRAPHS* ANDRZEJ PROSKUROWSKIf AND MACIEJ
More informationDischarging and reducible configurations
Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs
More informationAvoiding Fake Boundaries in Set Interval Computing
Journal of Uncertain Systems Vol.11, No.2, pp.137-148, 2017 Online at: www.jus.org.uk Avoiding Fake Boundaries in Set Interval Computing Anthony Welte 1, Luc Jaulin 1, Martine Ceberio 2, Vladik Kreinovich
More informationarxiv: v1 [cs.cc] 30 Jun 2017
Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs Erik D. Demaine Mikhail Rudoy arxiv:1706.10046v1 [cs.cc] 30 Jun 2017 Abstract In 2007, Arkin et al. [3] initiated
More informationOnline Appendix: A Stackelberg Game Model for Botnet Data Exfiltration
Online Appendix: A Stackelberg Game Model for Botnet Data Exfiltration June 29, 2017 We first provide Lemma 1 showing that the urban security problem presented in (Jain et al. 2011) (see the Related Work
More informationNP versus PSPACE. Frank Vega. To cite this version: HAL Id: hal https://hal.archives-ouvertes.fr/hal
NP versus PSPACE Frank Vega To cite this version: Frank Vega. NP versus PSPACE. Preprint submitted to Theoretical Computer Science 2015. 2015. HAL Id: hal-01196489 https://hal.archives-ouvertes.fr/hal-01196489
More informationDisjoint Support Decompositions
Chapter 4 Disjoint Support Decompositions We introduce now a new property of logic functions which will be useful to further improve the quality of parameterizations in symbolic simulation. In informal
More information[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics
400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {
More informationCSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
More informationCrossing Families. Abstract
Crossing Families Boris Aronov 1, Paul Erdős 2, Wayne Goddard 3, Daniel J. Kleitman 3, Michael Klugerman 3, János Pach 2,4, Leonard J. Schulman 3 Abstract Given a set of points in the plane, a crossing
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Technical Report UU-CS-2008-042 December 2008 Department of Information and Computing Sciences Utrecht
More information(QiuXin Hui) 7.2 Given the following, can you prove that the unicorn is mythical? How about magical? Horned? Decide what you think the right answer
(QiuXin Hui) 7.2 Given the following, can you prove that the unicorn is mythical? How about magical? Horned? Decide what you think the right answer is yourself, then show how to get the answer using both
More informationLearnable and Nonlearnable Visual Concepts
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCF, VOL 12. NO 5 MAY 1990 Learnable and Nonlearnable Visual Concepts 459 HAIM SHVAYTSER Abstract-Valiant s theory of the learnable is applied
More informationExercises Computational Complexity
Exercises Computational Complexity March 22, 2017 Exercises marked with a are more difficult. 1 Chapter 7, P and NP Exercise 1. Suppose some pancakes are stacked on a surface such that no two pancakes
More information