A Modular Representation of a Business Process Planner


 Erick Jared Joseph
 2 years ago
 Views:
Transcription
1 A Modular Representation of a Business Process Planner Shahab Tasharrofi and Evgenia Ternovska School of Computing Science Simon Fraser University Canada 1st International Workshop on Knowledgeintensive Business Processes
2 Motivating Example: Business Process Planner (BPP) Planner works in collaboration with service providers R S P1' P2' P3' Planner P R1 S1 R2 S2 R3 S3 Provider1 Provider2 Provider3 P1 P2 P3 Planner takes a set S of services and a set R of restrictions (such as service dependencies or deadlines) and generates plan P. Each Provider i takes a subset of services S i and their restrictions R i, generates a potential plan P i and returns it to Planner. Planner takes all these partial plans and, if not satisfied with them, reconsiders service allocations or providers. However, if satisfied, it outputs plan P by combining partial plans P i.
3 Motivating Example: Business Process Planner (BPP) Examples of BPP: Logistics Service Provider uses transportation management systems, contracted carriers, local post, fleet management, driver dispatch, warehouse services, ebusiness services etc. Manufacturer Supply Chain Management uses transportation, inventory spaces, services of third party logistics (3PL) providers, which themselves depend on services provided by smaller local companies Midsize Businesses Relying on External Web Services and Cloud Computing use data analysis services, storing, spreadsheet software (office suite), etc. All are clusters of interactive agents/modules (From Oracle s Global Adaptable Business Process Platforms)
4 Properties of BPP Each business entity, while interested to participate in the process, is not necessarily willing to share the information that has affected their decisions Each agent (planner, service provider) operates under incomplete information about other agents does not know internal languages and behaviour of other modules may have to deal with multiple plans generated by each external service provider deals with onthe fly changes from other modules
5 Our Goals Develop a framework that treats specification languages equally and independently of their internal semantics, and is able to handle incomplete information Our goal is not only to formalize, but to eventually develop a method for finding solutions to complex modular systems like the BPP
6 Challenges Computational Complexity: Computing individual plans is often NPcomplete (e.g. Travelling Salesman Problem in Logistics) the overall computational complexity can be quite high, efficient tools are needed So, for solving, we take inspiration in how solvers for combined systems such as Satisfiability Modulo Theory (SMT) are constructed Incomplete Information: a way of handling incomplete information is needed So, for representing, we should not assume unlimited access to complete axiomatizations of the business entities involved
7 First Step: Theoretical Framework We need a rigorous formalization to prove correctness verify properties of solutions (give convincing arguments) to develop solving techniques to adopt existing techniques from model theory, the semantics of logic programming, SAT, SMT solving etc. Need a formal approach since want languageindependence, use model theory start bottomup, from the semantic foundations use semantic foundations in the development of logics, reasoning methods and algorithms
8 Model Expansion Given logic L (specification/modelling language) Model Expansion (abbreviated MX) for L Given: φ in logic L and structure A for a part of vocab(φ) Construct: an expansion of A to satisfy φ Model Expansion: solution A { }} { { }} { (A; R1 A,... Rn A, E1 B,..., Em) B } {{ } B a useful abstraction, natural formalization for search problems = φ Structure A can be seen as input data, solution part can be seen as a builttoorder artifact or process plan (nonunique)
9 Model Expansion (Cntd.) MX underlies what is done in many specification languages for search problems Example: Graph 3coloring φ := x [R(x) B(x) G(x)] x [(R(x) B(x)) (R(x) G(x)) (B(x) G(x))] x y [E(x, y) ((R(x) R(y)) (B(x) B(y)) (G(x) G(y)))] σ φ = {E} ε φ = {R, G, B}
10 Modular Systems Now: extend the framework to represent multiple interactive modules Idea: Modular system = primitive modules + operators on modules Definition: Primitive Module M is a set of all (σ ε) structures B with σ the instance vocabulary and ε the expansion vocabulary. σ ε { }} { { }} { (A; R1 A,... Rn A, E1 B,..., Em) B } {{ } B σ is the input (can be empty) and ε the output Thus, a module is an MX task (for all possible inputs) A module can have a formula φ that axiomatizes that set of structures in some logic L, M = Mod(φ)
11 Example: Simple SMT Solver SAT A R L ILP L This modular system describes a simple SMT solver for the theory of Integer Linear Arithmetic. Two MX modules, SAT and ILP, work on different parts of a specification. The ILP module takes a set L of literals and a mapping M from atoms to linear arithmetic formulas. It returns two sets R and A. The SAT module takes R and A and a propositional formula F and returns set L of literals such that L makes F true. M F
12 Combining Modular Systems A modular system is a combination of primitive modules using the operators of: Projection: π τ (M) Composition: M 1 M 2 Union: M 1 M 2 Feedback: M[R = S], when R σ M (input of M) and S ε M (output of M) Similar to relational algebra, but with information flow A composed modular system also represents an MX task (a set of structures), just as an individual module
13 Example: Simple SMT Solver (Cntd) L SAT A R ILP F L Figure: Modular System Representation of an SMT Solver for the Theory of Integer Linear Arithmetic SMT := π {F,M,L} ((ILP SAT )[L = L ]) M
14 Business Process Planner (BPP) P1' P2' P3' R Planner S P R1 S1 R2 S2 R3 S3 Provider1 Provider2 Provider3 P1 P2 P3 Figure: Business Process Planner (BPP). Primitive modules boxes with solid borders. The compound module (dotted borders) is specified by the following algebraic expression: BPP := π {S,R,P} (Planner ((Provider 1 Provider 2 Provider 3 )[P 1 = P 1][P 2 = P 2][P 3 = P 3]))
15 Composable, Independent Modular Systems To define operators on modules formally, need the following definitions: Definition: based on [Järvisalo, Oikarinen, Janhunen, Niemelä, 2009] M is composable with M if ε M ε M = (outputs are distinct, no output interference) M is independent from M if σ M ε M = (output is not connected to input, no cyclic dependencies) The following definitions generalize and extend the initial development in [Järvisalo et al. 2009]
16 Detailed Definitions of Operations Projection(π τ (M)), B π τ (M) there exists B M s.t. B = B τ Composition(M 1 M 2, for M 1 composable with and independent from M 2 ) B (M 1 M 2 ) B vocab(m1 ) M 1 and B vocab(m2 ) M 2 Union(M 1 M 2 ), B (M 1 M 2 ) B vocab(m1 ) M 1 or B vocab(m2 ) M 2 Feedback(M[R = S], when R σ M and S ε M ), B M[R = S] B M and R B = S B
17 Properties of Modular Representations Module internals are invisible from the outside. Each agent can see only the inputs and outputs of other modules (black boxes) Modules communicate with each other through common vocabulary symbols Languages of other modules can be unknown to other modules. Such languages can even be old and no longer supported, as is common for legacy systems Multiple models (possible plans) are allowed Each module has hidden information and shared information
18 Bigger Picture: Expressive Power Why study expressive power: Capturing Property: Capture a complexity class Universal for that class (for example, FOMX captures NP ) Limited to a complexity class Efficiency guarantee (for example, polytime reducibility guarantee for NP) Theorem: Capturing NP The following are equivalent: K is in NP, K is the models of a modular system where all primitive modules M are σ M ε M deterministic, σ M total, σ M vocab(k)ε M antimonotone, and polytime solvable, K is the models of a modular system with polytime checkable primitive modules.
19 Solving Goal: Given a modular system and its inputs, want an algorithm that finds a solution to (or a model of) the given modular system Investigated solving algorithms in combined systems, SMT (DPLL(T)) algorithm, ASP+CP, ILP, etc. a general algorithm [Tasharrofi,Wu,T: WLP:2011] Some common principles. Can be applied to solving modular systems!
20 Solving SAT A R L ILP two kinds of propagation work interactively propositional satisfiability (SAT) and theory propagation L M F partial structures, add more information during computation oracles (similar to solvers/propagators used in SMT) structures or unstructured generic, for arbitrary theories in a specific logic modulespecific (can even be a human expert) in collaboration with process oracles, our algorithm constructs a process plan
21 Summary of Ideas A modeltheoretic approach: language independence Model Expansion: process and data integration? (input databases expanded to process plans) global structure of modular system artifact service container??? Computational methods used in the design of efficient SMT (and similar) solvers can be applied to the problem of interactive generation of a model of a modular system Consequences: shared data, hidden data, communication through common vocabulary SMTlike solving (interaction of modules)
22 Example: Business Process Planner (BPP) A plan for each item should: (1) start at the source and end at the destination: i Items (P(i) = c 0,, c n c 0 = s(i) c n = d(i)), (2) arrive at the destination sooner than their latest delivery time: i Items (P(i) = c 0,, c n at(i, n) t(i)), (3) pass through cities which are connected to each other: i Items (P(i) = c 0,, c n j [1, n] (connected(c j 1, c j )), (4) respect time constraints, i.e., be picked up at a city after they have arrived at that city: i Items (P(i) = c 0,, c n j [0, n] (pt(i, j) at(i, j))), (5) respect the distance between cities:...
23 Properties This is a structured process We say that a plan P is good for a set of services S and restrictions R if P does all services in S and satisfies all restrictions in R. Notation: Good(P, S, R). Definition [Intended Solutions] Structure B is an intended solution of BPP if: P B is good for S B and R B, i.e., B = Good(P, S, R), All atomic actions A of P B are doable by one of the n providers. PROPOSITION [Correctness] Structure B is in modular system BPP iff B is an intended solution of BPP.
24 Future Work design algorithms for solving modular systems, including methods to approximate solutions develop techniques for data management design embedded modular framework to deal with arithmetic and other external functions (our previous work is applicable) add preference handling look into combining general process planning with the situation calculus, IndiGolog, continuous planning
25 Thank you for your attention!
26 Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A modulebased framework for multilanguage constraint modeling. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Logic Programming and Nonmonotonic Reasoning, volume 5753 of Lecture Notes in Computer Science, pages Springer Berlin / Heidelberg, 2009.
CSC 373: Algorithm Design and Analysis Lecture 16
CSC 373: Algorithm Design and Analysis Lecture 16 Allan Borodin February 25, 2013 Some materials are from Stephen Cook s IIT talk and Keven Wayne s slides. 1 / 17 Announcements and Outline Announcements
More informationOne More Decidable Class of Finitely Ground Programs
One More Decidable Class of Finitely Ground Programs Yuliya Lierler and Vladimir Lifschitz Department of Computer Sciences, University of Texas at Austin {yuliya,vl}@cs.utexas.edu Abstract. When a logic
More informationRandom vs. StructureBased Testing of AnswerSet Programs: An Experimental Comparison
Random vs. StructureBased Testing of AnswerSet Programs: An Experimental Comparison Tomi Janhunen 1, Ilkka Niemelä 1, Johannes Oetsch 2, Jörg Pührer 2, and Hans Tompits 2 1 Aalto University, Department
More informationNPCompleteness I. Lecture 19. 19.1 Overview. 19.2 Introduction: Reduction and Expressiveness
Lecture 19 NPCompleteness I 19.1 Overview In the past few lectures we have looked at increasingly more expressive problems that we were able to solve using efficient algorithms. In this lecture we introduce
More informationIntroduction to computer science
Introduction to computer science Michael A. Nielsen University of Queensland Goals: 1. Introduce the notion of the computational complexity of a problem, and define the major computational complexity classes.
More informationLecture 7: NPComplete Problems
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NPComplete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit
More informationµz An Efficient Engine for Fixed points with Constraints
µz An Efficient Engine for Fixed points with Constraints Kryštof Hoder, Nikolaj Bjørner, and Leonardo de Moura Manchester University and Microsoft Research Abstract. The µz tool is a scalable, efficient
More informationIntroducing Formal Methods. Software Engineering and Formal Methods
Introducing Formal Methods Formal Methods for Software Specification and Analysis: An Overview 1 Software Engineering and Formal Methods Every Software engineering methodology is based on a recommended
More information[Refer Slide Time: 05:10]
Principles of Programming Languages Prof: S. Arun Kumar Department of Computer Science and Engineering Indian Institute of Technology Delhi Lecture no 7 Lecture Title: Syntactic Classes Welcome to lecture
More informationGameTime: A Toolkit for Timing Analysis of Software
GameTime: A Toolkit for Timing Analysis of Software Sanjit A. Seshia and Jonathan Kotker EECS Department, UC Berkeley {sseshia,jamhoot}@eecs.berkeley.edu Abstract. Timing analysis is a key step in the
More informationOfficial Math 112 Catalog Description
Official Math 112 Catalog Description Topics include properties of functions and graphs, linear and quadratic equations, polynomial functions, exponential and logarithmic functions with applications. A
More informationIntroduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Now that we have a basic understanding
More informationPage 1. CSCE 310J Data Structures & Algorithms. CSCE 310J Data Structures & Algorithms. P, NP, and NPComplete. PolynomialTime Algorithms
CSCE 310J Data Structures & Algorithms P, NP, and NPComplete Dr. Steve Goddard goddard@cse.unl.edu CSCE 310J Data Structures & Algorithms Giving credit where credit is due:» Most of the lecture notes
More informationApproximated Probabilistic Answer Set Programming
Approximated Probabilistic Answer Set Programming Department of Computer Science Universidade de São Paulo São Paulo, Brazil 2014 Toy Example 4 6 2 5 1 3 Limit the percentage of time the edge (1, 3) is
More informationThe Classes P and NP
The Classes P and NP We now shift gears slightly and restrict our attention to the examination of two families of problems which are very important to computer scientists. These families constitute the
More informationPerformance Level Descriptors Grade 6 Mathematics
Performance Level Descriptors Grade 6 Mathematics Multiplying and Dividing with Fractions 6.NS.12 Grade 6 Math : SubClaim A The student solves problems involving the Major Content for grade/course with
More informationCoNP and Function Problems
CoNP and Function Problems conp By definition, conp is the class of problems whose complement is in NP. NP is the class of problems that have succinct certificates. conp is therefore the class of problems
More informationBounded Treewidth in Knowledge Representation and Reasoning 1
Bounded Treewidth in Knowledge Representation and Reasoning 1 Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien Luminy, October 2010 1 Joint work with G.
More informationLecture 2: Query Containment
CS 838: Foundations of Data Management Spring 2016 Lecture 2: Query Containment Instructor: Paris Koutris 2016 In this lecture we will study when we can say that two conjunctive queries that are syntactically
More informationOutline. NPcompleteness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NPcompleteness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2pairs sum vs. general Subset Sum Reducing one problem to another Clique
More informationOn the Modeling and Verification of SecurityAware and ProcessAware Information Systems
On the Modeling and Verification of SecurityAware and ProcessAware Information Systems 29 August 2011 What are workflows to us? Plans or schedules that map users or resources to tasks Such mappings may
More informationRESEARCH STATEMENT. Guohua Liu
RESEARCH STATEMENT 1 Introduction My research is focused on computational inference that concerns effective problem solving via inference with data or knowledge. Constraint programming, mathematical programming,
More informationMathematics Curriculum Guide Precalculus 201516. Page 1 of 12
Mathematics Curriculum Guide Precalculus 201516 Page 1 of 12 Paramount Unified School District High School Math Curriculum Guides 2015 16 In 2015 16, PUSD will continue to implement the Standards by providing
More informationUPDATES OF LOGIC PROGRAMS
Computing and Informatics, Vol. 20, 2001,????, V 2006Nov6 UPDATES OF LOGIC PROGRAMS Ján Šefránek Department of Applied Informatics, Faculty of Mathematics, Physics and Informatics, Comenius University,
More informationFixedPoint Logics and Computation
1 FixedPoint Logics and Computation Symposium on the Unusual Effectiveness of Logic in Computer Science University of Cambridge 2 Mathematical Logic Mathematical logic seeks to formalise the process of
More informationCOMS4236: Introduction to Computational Complexity. Summer 2014
COMS4236: Introduction to Computational Complexity Summer 2014 Mihalis Yannakakis Lecture 17 Outline conp NP conp Factoring Total NP Search Problems Class conp Definition of NP is nonsymmetric with respect
More informationRigorous Software Development CSCIGA 3033009
Rigorous Software Development CSCIGA 3033009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
More informationTHE TURING DEGREES AND THEIR LACK OF LINEAR ORDER
THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.
More informationCS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15cs510se
More informationDiagonalization. Ahto Buldas. Lecture 3 of Complexity Theory October 8, 2009. Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach.
Diagonalization Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee Background One basic goal in complexity theory is to separate interesting complexity
More informationCARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE
CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify
More informationAutomated ModelBased Testing of Embedded RealTime Systems
Automated ModelBased Testing of Embedded RealTime Systems Jan Peleska jp@tzi.de University of Bremen Bieleschweig Workshop 7 20060505 Outline TechnologieZentrum Informatik Objectives Basic concepts
More information2.1 Complexity Classes
15859(M): Randomized Algorithms Lecturer: Shuchi Chawla Topic: Complexity classes, Identity checking Date: September 15, 2004 Scribe: Andrew Gilpin 2.1 Complexity Classes In this lecture we will look
More information11. APPROXIMATION ALGORITHMS
11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005
More informationP versus NP, and More
1 P versus NP, and More Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 If you have tried to solve a crossword puzzle, you know that it is much harder to solve it than to verify
More informationLogic in general. Inference rules and theorem proving
Logical Agents Knowledgebased agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledgebased agents Inference engine Knowledge base Domainindependent
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More informationNPCompleteness and Cook s Theorem
NPCompleteness and Cook s Theorem Lecture notes for COM3412 Logic and Computation 15th January 2002 1 NP decision problems The decision problem D L for a formal language L Σ is the computational task:
More information(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.
(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of firstorder logic will use the following symbols: variables connectives (,,,,
More informationWhy? A central concept in Computer Science. Algorithms are ubiquitous.
Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online
More informationFigure 4.0 CPMS Architecture
CHAPTER4 SYSTEM DESIGN System architecture of our project can be explained by using following diagram. Figure 4.0 CPMS Architecture Basically our system is divided in to two parts 1]. Web Role 2]. Worker
More informationStudents will understand 1. use numerical bases and the laws of exponents
Grade 8 Expressions and Equations Essential Questions: 1. How do you use patterns to understand mathematics and model situations? 2. What is algebra? 3. How are the horizontal and vertical axes related?
More informationCassandra. References:
Cassandra References: Becker, Moritz; Sewell, Peter. Cassandra: Flexible Trust Management, Applied to Electronic Health Records. 2004. Li, Ninghui; Mitchell, John. Datalog with Constraints: A Foundation
More informationThe Division Algorithm for Polynomials Handout Monday March 5, 2012
The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,
More informationCombining Static and Dynamic Impact Analysis for Largescale Enterprise Systems
Combining Static and Dynamic Impact Analysis for Largescale Enterprise Systems The 15th International Conference on ProductFocused Software Process Improvement, Helsinki, Finland. Wen Chen, Alan Wassyng,
More informationLecture 12. More algebra: Groups, semigroups, monoids, strings, concatenation.
V. Borschev and B. Partee, November 1, 2001 p. 1 Lecture 12. More algebra: Groups, semigroups, monoids, strings, concatenation. CONTENTS 1. Properties of operations and special elements...1 1.1. Properties
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationYou know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationFoundations of Query Languages
Foundations of Query Languages SS 2011 2. 2. Foundations of Query Languages Dr. Fang Wei Lehrstuhl für Datenbanken und Informationssysteme Universität Freiburg SS 2011 Dr. Fang Wei 22. Mai 2011 Seite 1
More informationNotes on NP Completeness
Notes on NP Completeness Rich Schwartz November 10, 2013 1 Overview Here are some notes which I wrote to try to understand what NP completeness means. Most of these notes are taken from Appendix B in Douglas
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. !approximation algorithm.
Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of
More informationMasconomet Regional High School Curriculum Guide
Masconomet Regional High School Curriculum Guide COURSE TITLE: Algebra 2 COURSE NUMBER: 1322 DEPARTMENT: Mathematics GRADE LEVEL(S) & PHASE: 10 12, CP LENGTH OF COURSE: Full Year Course Description: This
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationIntroduction to Algorithms. Part 3: P, NP Hard Problems
Introduction to Algorithms Part 3: P, NP Hard Problems 1) Polynomial Time: P and NP 2) NPCompleteness 3) Dealing with Hard Problems 4) Lower Bounds 5) Books c Wayne Goddard, Clemson University, 2004 Chapter
More informationLecture 1: Oracle Turing Machines
Computational Complexity Theory, Fall 2008 September 10 Lecture 1: Oracle Turing Machines Lecturer: Kristoffer Arnsfelt Hansen Scribe: Casper KejlbergRasmussen Oracle TM Definition 1 Let A Σ. Then a Oracle
More informationSets and functions. {x R : x > 0}.
Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationRemoving Partial Inconsistency in Valuation Based Systems*
Removing Partial Inconsistency in Valuation Based Systems* Luis M. de Campos and Serafín Moral Departamento de Ciencias de la Computación e I.A., Universidad de Granada, 18071 Granada, Spain This paper
More informationMAT2400 Analysis I. A brief introduction to proofs, sets, and functions
MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take
More informationON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationCertain Answers as Objects and Knowledge
Certain Answers as Objects and Knowledge Leonid Libkin School of Informatics, University of Edinburgh Abstract The standard way of answering queries over incomplete databases is to compute certain answers,
More informationApplications of Methods of Proof
CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The settheoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are
More informationALGEBRA I (Common Core)
The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION ALGEBRA I (Common Core) Wednesday, August 12, 2015 8:30 to 11:30 a.m. MODEL RESPONSE SET Table of Contents Question 25...................
More informationA Working Knowledge of Computational Complexity for an Optimizer
A Working Knowledge of Computational Complexity for an Optimizer ORF 363/COS 323 Instructor: Amir Ali Ahmadi TAs: Y. Chen, G. Hall, J. Ye Fall 2014 1 Why computational complexity? What is computational
More informationPowerTeaching i3: Algebra I Mathematics
PowerTeaching i3: Algebra I Mathematics Alignment to the Common Core State Standards for Mathematics Standards for Mathematical Practice and Standards for Mathematical Content for Algebra I Key Ideas and
More informationAnalysis of an Artificial Hormone System (Extended abstract)
c 2013. This is the author s version of the work. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purpose or for creating
More informationAlgebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 201213 school year.
This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra
More informationGenerating models of a matched formula with a polynomial delay
Generating models of a matched formula with a polynomial delay Petr Savicky Institute of Computer Science, Academy of Sciences of Czech Republic, Pod Vodárenskou Věží 2, 182 07 Praha 8, Czech Republic
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationP NP for the Reals with various Analytic Functions
P NP for the Reals with various Analytic Functions Mihai Prunescu Abstract We show that nondeterministic machines in the sense of [BSS] defined over wide classes of real analytic structures are more powerful
More informationOperations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture  36 Location Problems In this lecture, we continue the discussion
More informationThe Model Checker SPIN
The Model Checker SPIN Author: Gerard J. Holzmann Presented By: Maulik Patel Outline Introduction Structure Foundation Algorithms Memory management Example/Demo SPINIntroduction Introduction SPIN (Simple(
More informationSoftware Modeling and Verification
Software Modeling and Verification Alessandro Aldini DiSBeF  Sezione STI University of Urbino Carlo Bo Italy 34 February 2015 Algorithmic verification Correctness problem Is the software/hardware system
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More informationCyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
More informationPredicate Logic Review
Predicate Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane 1 Grammar A term is an individual constant or a variable. An individual constant is a lowercase letter from the beginning
More information(67902) Topics in Theory and Complexity Nov 2, 2006. Lecture 7
(67902) Topics in Theory and Complexity Nov 2, 2006 Lecturer: Irit Dinur Lecture 7 Scribe: Rani Lekach 1 Lecture overview This Lecture consists of two parts In the first part we will refresh the definition
More informationModule MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions
Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective
More informationLecture 2: Universality
CS 710: Complexity Theory 1/21/2010 Lecture 2: Universality Instructor: Dieter van Melkebeek Scribe: Tyson Williams In this lecture, we introduce the notion of a universal machine, develop efficient universal
More informationA NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES
A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES THEODORE A. SLAMAN AND ANDREA SORBI Abstract. We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: In fact, below
More informationModular Communication Infrastructure Design with Quality of Service
Modular Communication Infrastructure Design with Quality of Service Pawel Wojciechowski and Péter Urbán Distributed Systems Laboratory School of Computer and Communication Sciences Swiss Federal Institute
More information! Solve problem to optimality. ! Solve problem in polytime. ! Solve arbitrary instances of the problem. #approximation algorithm.
Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NPhard problem What should I do? A Theory says you're unlikely to find a polytime algorithm Must sacrifice one of three
More informationTheoretical Computer Science Bridging Course  Introduction / General Info. Summer Term 2016 Fabian Kuhn
Theoretical Computer Science Bridging Course  Introduction / General Info Summer Term 2016 Fabian Kuhn About the Course Topics Foundations of theoretical computer science Introduction to logic No lectures
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More information3.7 Complex Zeros; Fundamental Theorem of Algebra
SECTION.7 Complex Zeros; Fundamental Theorem of Algebra 2.7 Complex Zeros; Fundamental Theorem of Algebra PREPARING FOR THIS SECTION Before getting started, review the following: Complex Numbers (Appendix,
More informationNotes 11: List Decoding Folded ReedSolomon Codes
Introduction to Coding Theory CMU: Spring 2010 Notes 11: List Decoding Folded ReedSolomon Codes April 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami At the end of the previous notes,
More informationGeorgia Standards of Excellence 20152016 Mathematics
Georgia Standards of Excellence 20152016 Mathematics Standards GSE Coordinate Algebra K12 Mathematics Introduction Georgia Mathematics focuses on actively engaging the student in the development of mathematical
More informationGuessing Game: NPComplete?
Guessing Game: NPComplete? 1. LONGESTPATH: Given a graph G = (V, E), does there exists a simple path of length at least k edges? YES 2. SHORTESTPATH: Given a graph G = (V, E), does there exists a simple
More informationA Propositional Dynamic Logic for CCS Programs
A Propositional Dynamic Logic for CCS Programs Mario R. F. Benevides and L. Menasché Schechter {mario,luis}@cos.ufrj.br Abstract This work presents a Propositional Dynamic Logic in which the programs are
More informationComputing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms
Computing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms Jianmin Ji Fangzhen Lin JiaHuai You University of Science and Technology of China Hong Kong
More informationComplexity and Completeness of Finding Another Solution and Its Application to Puzzles
yato@is.s.utokyo.ac.jp seta@is.s.utokyo.ac.jp Π (ASP) Π x s x s ASP Ueda Nagao n nasp parsimonious ASP ASP NP Complexity and Completeness of Finding Another Solution and Its Application to Puzzles Takayuki
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationAlgebra 2 Notes AII.7 Functions: Review, Domain/Range. Function: Domain: Range:
Name: Date: Block: Functions: Review What is a.? Relation: Function: Domain: Range: Draw a graph of a : a) relation that is a function b) relation that is NOT a function Function Notation f(x): Names the
More informationTesting LTL Formula Translation into Büchi Automata
Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN02015 HUT, Finland
More informationNOTES ON CATEGORIES AND FUNCTORS
NOTES ON CATEGORIES AND FUNCTORS These notes collect basic definitions and facts about categories and functors that have been mentioned in the Homological Algebra course. For further reading about category
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationQuestions? Assignment. Techniques for Gathering Requirements. Gathering and Analysing Requirements
Questions? Assignment Why is proper project management important? What is goal of domain analysis? What is the difference between functional and non functional requirements? Why is it important for requirements
More information