Heterogeneous Reasoning
|
|
- Stella Banks
- 5 years ago
- Views:
Transcription
1 Heterogeneous Reasoning Stanford University
2 The Openproof Project Developing software for logic education since 1984 Tarski s World The Language of First-order Logic Turing s World Hyperproof LPL: Fitch, Boole, Submit and the Grade Grinder Openbox and Playfair Kripke s World
3 Openproof Day Stanford January 2009 Logic Software from Openproof Project The Openproof Project John Etchemendy & Jon Barwise Albert Liu & Michael Murray Mark Greaves & Alan Bush Gerard Allwein & Richard Cox, Robert Dale, Nik Swoboda, Keith Stenning many graduate and undergraduate students: Mike Mellenthin, Tony Ricciardi, Adeline Wong, Aaron Kalb, Olalere Williams and Alex Romanczuk
4 Overview Formal proof: the sentential case Formal proof: the heterogeneous case Generalizing notions of proof The Openproof framework and Playfair
5 Overview Formal proof: the sentential case Formal proof: the heterogeneous case Generalizing notions of proof The Openproof framework and Playfair
6 Sentential Proof Arguments are presented in textual form Arguments can be translated from text into First-order logic (or some extension) First-order logic can be checked for validity, consequence etc; Arguments can therefore be validated.
7 Fitch Implemented environment for formal proof Information at a step (sentence) Support (information at previous steps.) Inference rule (justification for new information)
8 An Example Natural Deduction Proof
9 Fitch-Style Natural Deduction
10 Fitch-Style Natural Deduction A proof is a linear sequence of steps
11 Fitch-Style Natural Deduction A proof is a linear sequence of steps Steps may contain embedded proofs.
12 Fitch-Style Natural Deduction A proof is a linear sequence of steps Steps may contain embedded proofs. Each step working toward a specific (perhaps subsidiary) goal
13 Fitch-Style Natural Deduction
14 Fitch-Style Natural Deduction Structure gives us a unique collection of information available at each step
15 Fitch-Style Natural Deduction Structure gives us a unique collection of information available at each step Steps are justified by citation of information available at this point in the proof
16 Promotion Rules Sentential rule of proof by cases P Q Q ~P Q
17 Features of the model Global structure of reasoning. Reasoning is. (locally) linear and goal-directed, typically directed at a unique outcome (design, decision, plan) punctuated by reasoning about alternatives (hypothetical reasoning)
18 Assumptions of Sentential Logic Assumption that arguments are presented or are to be constructed textually. Or at least that however the information comes to you, it can be rendered textually. And that such rendering, if possible, does not impact the tractability of determining the validity of the argument.
19 Overview Formal proof: the sentential case Formal proof: the heterogeneous case Generalizing notions of proof The Openproof framework and Playfair
20 Outside the FOL Model Homeowner deciding whether to refinance mortgage (spreadsheet.) Driver planning a route to unfamiliar location (map). Chemist figuring out structure of a protein. Architect designing a home for a client (plan). Engineer designing an integrated circuit (wiring, timing) Graphic artist designing a brochure.
21 Some Features of These Examples Involve non-sentential representations of information, E.g., Maps, Venn diagrams, architectural plans Typically involve multiple representations working together (heterogeneous reasoning) Even some mathematical reasoning has this feature (E.g. set-theoretic reasoning with Venn diagrams).
22 Heterogeneous Reasoning Heterogeneous reasoning is the typical case Multiple sources of information Multiple representations Must work together
23 Does This Matter? We invent these representations for a reason: sentential representations are not working in some way. Representation is important: try dividing CXXIII by IX without converting to Arabic numerals.
24 Formal Heterogeneous Logic Goal: to construct formal logical system(s) for heterogeneous reasoning. We need to account for: logic of non-sentential representations, and interactions between the representations.
25 Hyperproof Implemented system for heterogeneous deduction. Sentential system: First-order logic. Diagrammatic system: Blocks world with abstraction. Heterogeneous inference rules: Observe, Apply. Heterogeneous Goals: Counterexamples, naming.
26 An Example Hyperproof
27 The Content of Reasoning If A then B C if and only if not D A unless not C
28 The Content of Reasoning If A then B C if and only if not D A unless not C Sentences express incremental information
29 The Content of Reasoning If A then B C if and only if not D Diagrams are incrementally modified A unless not C Sentences express incremental information
30 Promotion Rules Diagrammatic Merge rule
31 Overview Formal proof: the sentential case Formal proof: the heterogeneous case Generalizing notions of proof The Openproof framework and Playfair
32 Generalizations New representations: E.g. Venn diagrams. Homogeneous or heterogeneous reasoning Multiple (more than 2) representations in single proof Multiple instances of same representation: E.g, inference from one Venn diagram to another. Generalizing logical inference and justification.
33 Heterogeneity of Representation Traditionally: sentences Information may be represented in multiple forms (sentences but also maps, Venn diagrams, spreadsheets, etc;) Multiple instances of each representation may be used simultaneously. Support the use of new representations.
34 Heterogeneity of Rationales Traditionally: Deduction We may obtain new information also on the basis of abduction, cost, aesthetic reasoning,... or all of the above. Generalize the notion of inference rule.
35 Promotion Rules Generalizing Rationale Because, for example, this Is the cheapest design
36 Heterogeneity of Goals Traditionally: Consequence Goals: Vary in type and structure, often we choose among solutions meeting primary criteria (bridge is structurally sound) on the basis of secondary criteria (most cost-effective design). Support different analyses of proof
37 Heterogeneity of Goals
38 Overview Formal proof: the sentential case Formal proof: the heterogeneous case Generalizing notions of proof The Openproof framework and Playfair
39 Openproof A framework for assembling heterogeneous reasoning applications Component-based architecture Openproof manages the proof tree Components manage the content of the nodes in the tree.
40 What is a component? Representation (model): abstract representation of diagram Editor (view): user interface for creating and modifying representations. Engine (controller): collection of operations using the representation(s). May be developed independently.
41 Three Roles for Openproof for us to build heterogeneous reasoning environments for logic education for you to build heterogeneous reasoning environments for building real world applications.
42 Playfair Collection of Openproof components Aimed at teaching general heterogeneous reasoning techniques. Expose students to reasoning patterns/ strategies in multiple contexts (some very familiar) to promote transfer out of the classroom.
43 Playfair Representation Modules Venn/Euler diagrams: for set theory Position diagrams: SAT/GRE exams Hyperproof diagrams Attribute/Value tables Arbitrary drawings and text (in the future): network/state machine diagrams
44 Venn Diagrams
45 Position diagrams
46 Coincidence Grids
47 Rationale Capture Generalizing the notion of justification allows us to view documents as capturing rationales. Users can write text as the justification for a step Document records, and allows replaying of, reasoning. Building a document requires attention to the structure of the reasoning.
48 Architectural Design Maintain the structure of reasoning Justifications are free text, not verified. Example has only one (diagrammatic) representation.
49 Architectural Design
50 Graphic Design Maintain the structure of reasoning No justifications. Example has only one (diagrammatic) representation.
51 Graphic Design
52 Summary Heterogeneous reasoning is typical It is possible to formalize and implement logics for heterogeneous reasoning. The Openbox allows the construction of complex heterogeneous environments for a variety of representations. Reasoning does not have to be formal, or involve formally specified semantics to be useful.
53 Heterogeneous Reasoning Stanford University
SEARCH AND INFERENCE WITH DIAGRAMS
SEARCH AND INFERENCE WITH DIAGRAMS Michael Wollowski Rose-Hulman Institute of Technology 5500 Wabash Ave., Terre Haute, IN 47803 USA wollowski@rose-hulman.edu ABSTRACT We developed a process for presenting
More informationLogik für Informatiker Logic for computer scientists
Logik für Informatiker for computer scientists WiSe 2011/12 Overview Motivation Why is logic needed in computer science? The LPL book and software Scheinkriterien Why is logic needed in computer science?
More informationHANDBOOK OF LOGIC IN ARTIFICIAL INTELLIGENCE AND LOGIC PROGRAMMING
HANDBOOK OF LOGIC IN ARTIFICIAL INTELLIGENCE AND LOGIC PROGRAMMING Volume 5 Logic Programming Edited by DOV M. GABBAY and C. J. HOGGER Imperial College of Science, Technology and Medicine London and J.
More informationCurriculum for the Bachelor's Degree Programme in Software Development National section
Curriculum for the Bachelor's Degree Programme in Software Development National section Contents 1. Programme structure... 3 2. Core areas of study... 3 2.1 Large-scale system development... 3 2.2 Databases
More informationText/Instructional Material Title: Virginia Geometry. Publisher: McGraw Hill Companies School Education Group
Section I. Correlation with the Mathematics 2009 SOL and Curriculum Framework Rating G.1 G.2 G.3 G.4 G.5 G.6 G.7 G.8 G.9 G.10 G.11 G.12 G.13 G.14 Rating Section II. Additional Criteria: Instructional Planning
More informationeportfolio an overview Presented by Dr. Chareen Snelson Boise State University Department of Educational Technology
The eportfolio an overview Presented by Dr. Chareen Snelson Boise State University Department of Educational Technology http://edtech.boisestate.edu What is Covered in this Presentation? Several questions
More informationINTLOGS17 Test 1. Prof: S Bringsjord TA: Rini Palamittam NY
INTLOGS17 Test 1 Prof: S Bringsjord TA: Rini Palamittam 0306170626NY Immediate Action Items: Please now, before you do anything else, write down the following details on the Scantron sheets as well as
More informationIN A NUTSHELL : WHAT IS A VENN DIAGRAM?
For anyone who tries to Google anything today (August 4, 2014), you may notice that, according to Google, today is the 180 th birthday of the logician John Venn. Those who have taken a course in logic
More informationRichard Lander School Maths Key Stage 3
Richard Lander School Maths Key Stage 3 Richard Lander School is a maintained school which follows the National Curriculum at both Key Stage 3 and Key Stage 4. Purpose of study Mathematics is a creative
More informationCategory Theory in Ontology Research: Concrete Gain from an Abstract Approach
Category Theory in Ontology Research: Concrete Gain from an Abstract Approach Markus Krötzsch Pascal Hitzler Marc Ehrig York Sure Institute AIFB, University of Karlsruhe, Germany; {mak,hitzler,ehrig,sure}@aifb.uni-karlsruhe.de
More informationModule 1 Session 1 HS. Critical Areas for Traditional Geometry Page 1 of 6
Critical Areas for Traditional Geometry Page 1 of 6 There are six critical areas (units) for Traditional Geometry: Critical Area 1: Congruence, Proof, and Constructions In previous grades, students were
More informationCIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
More informationConsider a description of arithmetic. It includes two equations that define the structural types of digit and operator:
Syntax A programming language consists of syntax, semantics, and pragmatics. We formalize syntax first, because only syntactically correct programs have semantics. A syntax definition of a language lists
More informationKnowledge Sharing Among Heterogeneous Agents
Knowledge Sharing Among Heterogeneous Agents John F. Sowa VivoMind Research, LLC 29 July 2013 Facts of Life: Diversity and Heterogeneity Open-ended variety of systems connected to the Internet: The great
More informationReasoning With Diagrams Only
Reasoning With Diagrams Only From: AAAI Technical Report SS-92-02. Compilation copyright 1992, AAAI (www.aaai.org). All rights reserved. George W. Furnas Cognitive Science Research Group Bell Communications
More informationLogic and Computation
Logic and Computation From Conceptualization to Formalization Here's what we do when we build a formal model (or do a computation): 0. Identify a collection of objects/events in the real world. This is
More information3.4 Deduction and Evaluation: Tools Conditional-Equational Logic
3.4 Deduction and Evaluation: Tools 3.4.1 Conditional-Equational Logic The general definition of a formal specification from above was based on the existence of a precisely defined semantics for the syntax
More informationA Solidify Understanding Task
17 A Solidify Understanding Task We know that two triangles are congruent if all pairs of corresponding sides are congruent and all pairs of corresponding angles are congruent. We may wonder if knowing
More informationCourse Name: Computer Networks-1 Course Code: IT222
Course Name: Computer Networks-1 Course Code: IT222 I. Basic Course Information Major or minor element of program: General Department offering the course: Information Technology Department Academic level:
More informationA Visual and Interactive Automata Theory Course with JFLAP 4.0
A Visual and Interactive Automata Theory Course with JFLAP 4.0 Ryan Cavalcante Duke University Durham, NC 27708-0129 Thomas Finley Cornell University Ithaca, NY 14853-7501 Susan Rodger Duke University
More informationQualification Specification
BCS Level 2 Certificate in IT User Skills (ECDL Core) Version 2.0 March 2018 This is a United Kingdom government regulated qualification which is administered and approved by one or more of the following:
More information--- stands for the horizontal line.
Content Proofs on zoxiy Subproofs on zoxiy Constants in proofs with quantifiers Boxed constants on zoxiy Proofs on zoxiy When you start an exercise, you re already given the basic form of the proof, with
More informationWhat Is Computer Science? The Scientific Study of Computation. Expressing or Describing
What Is Computer Science? The Scientific Study of Computation CMPSCI 630: Programming Languages Introduction Spring 2009 (with thanks to Robert Harper) Expressing or Describing Automating Understanding
More informationEight units must be completed and passed to be awarded the Diploma.
Diploma of Computing Course Outline Campus Intake CRICOS Course Duration Teaching Methods Assessment Course Structure Units Melbourne Burwood Campus / Jakarta Campus, Indonesia March, June, October 022638B
More informationAll rights reserved. Reproduction of these materials for instructional purposes in public school classrooms in Virginia is permitted.
Geometry Copyright 2009 by the Virginia Department of Education P.O. Box 2120 Richmond, Virginia 23218-2120 http://www.doe.virginia.gov All rights reserved. Reproduction of these materials for instructional
More informationWhat if current foundations of mathematics are inconsistent? Vladimir Voevodsky September 25, 2010
What if current foundations of mathematics are inconsistent? Vladimir Voevodsky September 25, 2010 1 Goedel s second incompleteness theorem Theorem (Goedel) It is impossible to prove the consistency of
More informationLLparse and LRparse: Visual and Interactive Tools for Parsing
LLparse and LRparse: Visual and Interactive Tools for Parsing Stephen A. Blythe, Michael C. James, and Susan H. Rodger 1 Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180-3590
More informationLecture Notes on Binary Decision Diagrams
Lecture Notes on Binary Decision Diagrams 15-122: Principles of Imperative Computation William Lovas Notes by Frank Pfenning Lecture 25 April 21, 2011 1 Introduction In this lecture we revisit the important
More information! Use of formal notations. ! in software system descriptions. ! for a broad range of effects. ! and varying levels of use. !
What Are Formal Methods? David S. Rosenblum ICS 221 Winter 2001! Use of formal notations! first-order logic, state machines, etc.! in software system descriptions! system models, constraints, specifications,
More informationRational Number Operations on the Number Line
The Mathematics Enthusiast Volume 14 Number 1 Numbers 1, 2, & 3 Article 18 1-2017 Rational Number Operations on the Number Line Christopher Yakes Let us know how access to this document benefits you. Follow
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
More informationGouvernement du Québec Ministère de l Éducation, ISBN
Gouvernement du Québec Ministère de l Éducation, 2004 04-00814 ISBN 2-550-43544-3 Legal deposit Bibliothèque nationale du Québec, 2004 1. INTRODUCTION This Definition of the Domain for Summative Evaluation
More informationMIAMI-DADE COUNTY PUBLIC SCHOOLS District Pacing Guide GEOMETRY HONORS Course Code:
Topic V: Quadrilaterals Properties Pacing Date(s) Traditional 22 days 10/24/13-11/27/13 Block 11 days 10/24/13-11/27/13 COMMON CORE STATE STANDARD(S) & MATHEMATICAL PRACTICE (MP) NEXT GENERATION SUNSHINE
More informationGCE Music Technology 2017: Content Mapping Edexcel
GCE Music 2017: Content Mapping Edexcel Contents Information for current Edexcel centres 1 Mapping 2 GCE Music 2017: Content Mapping Edexcel Information for current Edexcel centres The information in
More informationType Systems COMP 311 Rice University Houston, Texas
Rice University Houston, Texas 1 Type Systems for Programming Language were invented by mathematicians before electronic computers were invented. What is a type? A meaningful subset of the set of the domain
More informationModule specification
Module specification 1. Factual information Module title TM105: Introduction to Programming Level 1 Module tutor TBA Credit value 15 points Module type Taught Notional learning hours 4 credit hours 2.
More informationDiploma Of Computing
Diploma Of Computing Course Outline Campus Intake CRICOS Course Duration Teaching Methods Assessment Course Structure Units Melbourne Burwood Campus / Jakarta Campus, Indonesia March, June, October 022638B
More informationReading 1 : Introduction
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti and Gautam Prakriya Reading 1 : Introduction Welcome to CS 240, an introduction to discrete mathematics. This reading
More informationPolytechnic University of Puerto Rico Department of Electrical & Computer Engineering and Computer Science (ECECS) Master in Electrical Engineering
Polytechnic University of Puerto Rico Department of Electrical & Computer Engineering and Computer Science (ECECS) Master in Electrical Engineering Course Syllabus Note : This is a major revision, the
More informationTurning Automata Theory into a Hands-on Course
Turning Automata Theory into a Hands-on Course Susan H. Rodger Bart Bressler Computer Science Computer Science Duke University Duke University Durham, NC 27708 Durham, NC 27708 rodger@cs.duke.edu Thomas
More informationThe Diagonal Lemma: An Informal Exposition
The Diagonal Lemma: An Informal Exposition Richard G Heck, Jr At the heart of Gödel s incompleteness theorem is the so-called diagonal lemma whose purpose is to allow us to construct self-referential sentences,
More informationEPORTFOLIOS: PURPOSE & COMPOSITION
EPORTFOLIOS: PURPOSE & COMPOSITION An eportfolio is a digital space that holds evidence of educational and/or professional achievements, as well as reflective writing about your experiences. A well-designed
More informationVerification of Selection and Heap Sort Using Locales
Verification of Selection and Heap Sort Using Locales Danijela Petrović September 19, 2015 Abstract Stepwise program refinement techniques can be used to simplify program verification. Programs are better
More informationUNIT 1 USING LOGIC. UPGRADE 8 Write a detailed report on how logic gates would be used to add up two nibbles using examples and explanations
UNIT 1 USING LOGIC Create a working example of a full adder logic gate circuit and test its operation with a series of bytes that need to be added. Report on the findings and limitations found Write a
More informationThe Intersection of Two Sets
Venn Diagrams There are times when it proves useful or desirable for us to represent sets and the relationships among them in a visual manner. This can be beneficial for a variety of reasons, among which
More informationSoftware Reliability and Reusability CS614
Software Reliability and Reusability CS614 Assiut University Faculty of Computers & Information Quality Assurance Unit Software Reliability and Reusability Course Specifications2011-2012 Relevant program
More informationA STRING SEARCH MARKETING APPLICATION USING MIT APP INVENTOR VISUAL PROGRAMMING
A STRING SEARCH MARKETING APPLICATION USING MIT APP INVENTOR VISUAL PROGRAMMING Jerry Chin Professor and Department Head CIS Department Missouri State University 901 S National Springfield, MO 65897 417-836-4131
More informationCTI Short Learning Programme in IT Enigneering
CTI Short Learning Programme in IT Enigneering Module Descriptions 2015 1 Short Learning Programme in IT Engineering (8 months full-time, 20 months part-time) Computer Literacy Knowing how to use a computer
More informationMathematics Appendix 1: Examples of formal written methods for addition, subtraction, multiplication and division
Mathematics Appendix 1: Examples of formal written methods for addition, subtraction, multiplication and division This appendix sets out some examples of formal written methods for all four operations
More informationA Theory of Parallel Computation The π-calculus
A Theory of Parallel Computation The π-calculus Background DFAs, NFAs, pushdown automata, Turing machines... All are mathematical entities that model computation. These abstract systems have concrete,
More informationContent Development for Distance Education in Advanced University Mathematics Using Mizar
Content Development for Distance Education in Advanced University Mathematics Using Mizar Takaya IDO 1, Hiroyuki OKAZAKI 1, Hiroshi YAMAZAKI 1, Pauline Naomi KAWAMOTO 1, Katsumi WASAKI 1, and Yasunari
More informationKnowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
More informationWisconsin. Model Academic Standards. for Mathematics
2004 correlated to the Wisconsin Model Academic Standards for Mathematics Grade 8 3/2003 2004 McDougal Littell Middle School Math, Course 1 2004 correlated to the Wisconsin Model Academic Standards for
More informationET285 Digital Electronics II [Onsite]
ET285 Digital Electronics II [Onsite] Course Description: This course continues the study of digital electronics. The focus in this course is on sequential logic. In lab, students construct, test and troubleshoot
More informationSection 1.4 Proving Conjectures: Deductive Reasoning
Section 1.4 Proving Conjectures: Deductive Reasoning May 9 10:15 AM 1 Definition: Proof: A mathematical argument showing that a statement is valid in all cases, or that no counterexample exists. Generalization:
More informationImplementing Euler/Venn Reasoning Systems
From: AAAI Technical Report FS-97-03 Compilation copyright 1997, AAAI (wwwaaaiorg) All rights reserved Implementing Euler/Venn Reasoning Systems Nikolaus G Swoboda Visual Inference Laboratory Indiana University
More information14.1 Encoding for different models of computation
Lecture 14 Decidable languages In the previous lecture we discussed some examples of encoding schemes, through which various objects can be represented by strings over a given alphabet. We will begin this
More informationChapter 2 & 3: Representations & Reasoning Systems (2.2)
Chapter 2 & 3: A Representation & Reasoning System & Using Definite Knowledge Representations & Reasoning Systems (RRS) (2.2) Simplifying Assumptions of the Initial RRS (2.3) Datalog (2.4) Semantics (2.5)
More informationITT Technical Institute. VC130P Digital Type and Image Manipulation Onsite Course SYLLABUS
ITT Technical Institute VC130P Digital Type and Image Manipulation Onsite Course SYLLABUS Credit hours: 4 Contact/Instructional hours: 66 (46 Theory Hours, 20 Lab Hours) Prerequisite(s) and/or Corequisite(s):
More informationITT Technical Institute. CS330 Database Design and Implementation Onsite Course SYLLABUS
ITT Technical Institute CS330 Database Design and Implementation Onsite Course SYLLABUS Credit hours: 4 Contact/Instructional hours: 50 (30 Theory Hours, 20 Lab Hours) Prerequisite(s) and/or Corequisite(s):
More informationComputer Networks (Redes de Computadores)
Computer Networks (Redes de Computadores) Bachelor Degree in Computer Engineering University of Alcalá Academic Year 2017/18 2 nd Year 2 nd Term TEACHING GUIDE Course name Computer Networks Code: 780017
More informationRube Goldberg Final Report Format
Rube Goldberg Final Report Format Group Assignment Your team is responsible for composing a single final report that describes in detail your Rube Goldberg machine. The audience of this report is the instructor
More informationModule 5X Independent Guided Study
MODULE DESCRIPTOR TITLE Principles of Typography SI MODULE CODE 31-4047 CREDITS 20 LEVEL 4 JACS CODE W210 SUBJECT GROUP Graphic Design DEPARTMET Visual & Performing Arts MODULE LEADER John Young MODULE
More informationEclipse Support for Using Eli and Teaching Programming Languages
Electronic Notes in Theoretical Computer Science 141 (2005) 189 194 www.elsevier.com/locate/entcs Eclipse Support for Using Eli and Teaching Programming Languages Anthony M. Sloane 1,2 Department of Computing
More informationVisualized Problems in the Teaching Topic "Derivative of a Function"
Non-Standard Forms of Teaching Mathematics and Physics: Experimental and Modeling Approach IPA HU-SRB/1203/221/024 Visualized Problems in the Teaching Topic "Derivative of a Function" Valentina Kostić,
More informationDESKTOP PUBLISHING OVERVIEW PURPOSE ELIGIBILITY TIME LIMITS ATTIRE
DESKTOP PUBLISHING OVERVIEW Participants produce a notebook containing a news release, a three (3)-column newsletter, and a poster. Each of these publications to attract students to the TSA organization.
More informationPropositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
More informationDigital Communication and Aesthetics,
Curriculum for the Elective Study at Bachelor Level in Digital Communication and Aesthetics, 2016 Corrected 2017 Amended 2018 Department of Media, Cognition and Communication Faculty of Humanities University
More informationDouglas County School District Sixth Grade Critical Content Checklist Math
Teacher: Year: The Nevada ematics Standards and Douglas County s ematics Critical Content connect the Process and Content Standards. The Process Standards describe the process in which students should
More informationAutomated Reasoning. Natural Deduction in First-Order Logic
Automated Reasoning Natural Deduction in First-Order Logic Jacques Fleuriot Automated Reasoning Lecture 4, page 1 Problem Consider the following problem: Every person has a heart. George Bush is a person.
More informationMORGANSTATEUNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING. EEGR510 Communications Networks Credits: 3 COURSE SYLLABUS
MORGANSTATEUNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING EEGR510 Communications Networks Credits: 3 COURSE SYLLABUS Instructor: Dr. Farzad Moazzami Office: SEB 334 Telephone No. 443-885-4204
More informationOperational Semantics 1 / 13
Operational Semantics 1 / 13 Outline What is semantics? Operational Semantics What is semantics? 2 / 13 What is the meaning of a program? Recall: aspects of a language syntax: the structure of its programs
More informationGeometry Critical Areas of Focus
Ohio s Learning Standards for Mathematics include descriptions of the Conceptual Categories. These descriptions have been used to develop critical areas for each of the courses in both the Traditional
More informationREPORT ON CANDIDATES WORK IN THE SECONDARY EDUCATION CERTIFICATE EXAMINATION JANUARY 2010 INFORMATION TECHNOLOGY TECHNICAL PROFICIENCY EXAMINATION
CARIBBEAN EXAMINATIONS COUNCIL HEADQUARTERS REPORT ON CANDIDATES WORK IN THE SECONDARY EDUCATION CERTIFICATE EXAMINATION JANUARY 2010 INFORMATION TECHNOLOGY TECHNICAL PROFICIENCY EXAMINATION Copyright
More informationCOURSE SPECIFICATION
Date of production of course specification: September 2015 Date of review of course specification: N/A Date of course approval/validation: TBC COURSE SPECIFICATION This specification provides a concise
More informationSecondary Mathematics Subject Knowledge Audit KS3/KS
Secondary Mathematics Subject Knowledge Audit KS3/KS4 2017-2018 Name Number KS3 Understand and use place value for decimals, measures and integers of any size Familiar with Competent to teach Planned,
More informationKS3 Progression Map: Number
KS3 Progression Map: Number This progression map expands upon the statements of subject content in the DfE document Mathematics programmes of study: Key Stage 3 published September 2013. Suggested allocation
More informationType raising, continuations, and classical logic
Type raising, continuations, and classical logic Philippe de Groote Inria-Lorraine Abstract. There is a striking analogy between type raising, as introduced by Montague (973), and the notion of continuation
More informationCurriculum for the main subject at Master s level in. IT and Cognition, The 2015 curriculum. Adjusted 2017 and 2018
Curriculum for the main subject at Master s level in IT and Cognition, The 2015 curriculum Adjusted 2017 and 2018 Department of Nordic Research Faculty of Humanities U i it f C h Contents Part 1. Authority,
More informationNew Jersey Core Curriculum Content Standards for Mathematics Grade 7 Alignment to Acellus
New Jersey Core Curriculum Content Standards for Mathematics http://www.nj.gov/education/aps/cccs/math/ Standard 4.1.7: Number And Numerical Operations A. Number Sense 1. Extend understanding of the number
More informationCurriculum Area: Maths Key Stage 3 Year: 8
Module 1 Number Curriculum Area: Maths Key Stage 3 TOPICS YEAR CURRICULUM HOW YOU CAN SUPPORT LEARNING AT HOME, EG. BOOKS, WEBSITES, FAMILY LEARNING THROUGH VISITS. Term 1: Number Operations understand
More informationPELLISSIPPI STATE TECHNICAL COMMUNITY COLLEGE MASTER SYLLABUS VIDEO EDITING VPT 1210
PELLISSIPPI STATE TECHNICAL COMMUNITY COLLEGE MASTER SYLLABUS VIDEO EDITING VPT 1210 Class Hours: 4.0 Credit Hours: 4.0 Laboratory Hours: 0 Date Revised: Spring 07 Catalog Course Description: The course
More informationThunks (continued) Olivier Danvy, John Hatcli. Department of Computing and Information Sciences. Kansas State University. Manhattan, Kansas 66506, USA
Thunks (continued) Olivier Danvy, John Hatcli Department of Computing and Information Sciences Kansas State University Manhattan, Kansas 66506, USA e-mail: (danvy, hatcli)@cis.ksu.edu Abstract: Call-by-name
More informationConstructive Coherent Translation of Propositional Logic
Constructive Coherent Translation of Propositional Logic JRFisher@cpp.edu (started: 2009, latest: January 18, 2016) Abstract Propositional theories are translated to coherent logic rules using what are
More informationCOURSE BROCHURE. ITIL - Intermediate SERVICE STRATEGY Training & Certification
COURSE BROCHURE ITIL - Intermediate SERVICE STRATEGY Training & Certification What is ITIL SS? The Service Strategy (SS) qualification is one of five ITIL Service Lifecycle modules and provides you with
More informationType Inference Systems. Type Judgments. Deriving a Type Judgment. Deriving a Judgment. Hypothetical Type Judgments CS412/CS413
Type Inference Systems CS412/CS413 Introduction to Compilers Tim Teitelbaum Type inference systems define types for all legal programs in a language Type inference systems are to type-checking: As regular
More informationThe semantics of a programming language is concerned with the meaning of programs, that is, how programs behave when executed on computers.
Semantics The semantics of a programming language is concerned with the meaning of programs, that is, how programs behave when executed on computers. The semantics of a programming language assigns a precise
More informationAn Evolution of Mathematical Tools
An Evolution of Mathematical Tools From Conceptualization to Formalization Here's what we do when we build a formal model (or do a computation): 0. Identify a collection of objects/events in the real world.
More information3D Graphics Programming Mira Costa High School - Class Syllabus,
3D Graphics Programming Mira Costa High School - Class Syllabus, 2009-2010 INSTRUCTOR: Mr. M. Williams COURSE GOALS and OBJECTIVES: 1 Learn the fundamentals of the Java language including data types and
More informationProgram Proposal for a Direct Converted Program. BS in COMPUTER SCIENCE
Program Proposal for a Direct Converted Program BS in COMPUTER SCIENCE Document Page number Curriculum Sheet p. 2 p. -year Roadmap p. p. 5 Two Year Course Schedule p. 6 (2018 2019 AY and 2019 2020 AY)
More informationCOURSE TITLE. Computer Programming C++ LENGTH. One Semester Grades DEPARTMENT. Computer Department Barbara O Donnell, Supervisor SCHOOL
COURSE TITLE Computer Programming C++ LENGTH One Semester Grades 10-12 DEPARTMENT Computer Department Barbara O Donnell, Supervisor SCHOOL Rutherford High School DATE Spring 2017 Computer Programming C++
More informationCOURSE SYLLABUS. Course Name NETWORK+ Course Number ITNW Y Lecture - Lab - Credit. NONE Prerequisite
Course Syllabus _ Page 1 COURSE SYLLABUS Course Name NETWORK+ Course Number ITNW 1358 46Y1 2-4 - 3 Lecture - Lab - Credit NONE Prerequisite This syllabus has been reviewed and is current on the date indicated.
More informationModule specification
Module specification 1. Factual information Module title TM260 Security, ethics and privacy in IT and Computing Level 2 Module tutor TBA Credit value 15 Module type Taught Notional learning hours 4 2.
More informationGEOMETRY Graded Course of Study
GEOMETRY Graded Course of Study Conceptual Category: Domain: Congruence Experiment with transformations in the plane. Understand congruence in terms of rigid motions. Prove geometric theorems both formally
More informationProgramming Abstractions in C++
Programming Abstractions in C++ C S 1 0 6 B Cynthia Lee 2 Today s Topics 1. INTRODUCTIONS 2. COURSE STRUCTURE AND PROCEDURES 3. WHAT IS THIS CLASS? WHAT DO WE MEAN BY ABSTRACTIONS? 4. INTRODUCE THE C++
More informationCPSC 2380 Data Structures and Algorithms
CPSC 2380 Data Structures and Algorithms Spring 2014 Department of Computer Science University of Arkansas at Little Rock 2801 South University Avenue Little Rock, Arkansas 72204-1099 Class Hours: Tuesday
More informationINCREMENTAL SOFTWARE CONSTRUCTION WITH REFINEMENT DIAGRAMS
INCREMENTAL SOFTWARE CONSTRUCTION WITH REFINEMENT DIAGRAMS Ralph-Johan Back Abo Akademi University July 6, 2006 Home page: www.abo.fi/~backrj Research / Current research / Incremental Software Construction
More informationAssessment for all units is ongoing and continuous consisting of tests, assignments and reports. Most units have a final two-hour examination.
Diploma of Computing Course Outline (T3, 2017) Campus Intake CRICOS Course Duration Teaching Methods Assessment Course Structure Units Melbourne Burwood Campus / Jakarta Campus, Indonesia March, June,
More informationCTI Short Learning Programme in Internet Development Specialist
CTI Short Learning Programme in Internet Development Specialist Module Descriptions 2015 1 Short Learning Programme in Internet Development Specialist (10 months full-time, 25 months part-time) Computer
More informationSOUTHERN UNIVERSITY AND A&M COLLEGE DEPARTMENT OF MATHEMATICS MATH 250 TOPICS IN GEOMETRY
SOUTHERN UNIVERSITY AND A&M COLLEGE DEPARTMENT OF MATHEMATICS MATH 250 TOPICS IN GEOMETRY I. DESCRIPTIVE INFORMATION A. Course Number: MATH 250 B. Course Title: TOPICS IN GEOMETRY C. Catalog Description:
More information