Stan Lovric CSc214 Fall 2002 Victorian Symbolic Logic John Swartz Victorian Symbolic Logic Paper by John Swartz Presentation by Stan Lovric.

Slides:

Advertisements

Similar presentations

Formal Methods and Testing Goal: software reliability Use software engineering methodologies to develop the code. Use formal methods during code development.

Advertisements

Translation-Based Compositional Reasoning for Software Systems Fei Xie and James C. Browne Robert P. Kurshan Cadence Design Systems.

Write a program step by step. Step 1: Problem definition. Given the coordinate of two points in 2-D space, compute and print their straight distance.

Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.

Chapter 2: Modularization

Session Objectives# 24 COULD code the solution for an algorithm

Principles of programming languages 3: Answers for exercises Isao Sasano Department of Information Science and Engineering.

Conformance Simulation Relation ( ) Let and be two automata over the same alphabet simulates () if there exists a simulation relation such that Note that.

Paper Title Your Name CMSC 838 Presentation. CMSC 838T – Presentation Motivation u Problem paper is trying to solve  Characteristics of problem  … u.

Software Process Improvement in Small Organizations A Case Study.

1 Introduction to Software Engineering Lecture 42 – Communication Skills.

Ch3: Software Engineering Principles 1 What is a principle?  Definition:  Goals of accounting principles:  Goals of software engineering principles?

Proof System HY-566. Proof layer Next layer of SW is logic and proof layers. – allow the user to state any logical principles, – computer can to infer.

Abstract Data Types (ADT)

1  1998 Morgan Kaufmann Publishers Lectures for 2nd Edition Note: these lectures are often supplemented with other materials and also problems from the.

CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Nondeterminism.

True/False. False True Subject May Go Here True / False ? Type correct answer here. Type incorrect answer here.

Describing Syntax and Semantics

PRE-PROGRAMMING PHASE

1 A Introduction to Data Structures and Algorithm Analysis Data Structures Asst. Professor Kiran Soni.

Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Software.

© Janice Regan, CMPT 128, Jan CMPT 128 Introduction to Computing Science for Engineering Students Creating a program.

Testing. Definition From the dictionary- the means by which the presence, quality, or genuineness of anything is determined; a means of trial. For software.

(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.

1 C++ Plus Data Structures Nell Dale Chapter 1 Software Engineering Principles Modified from the Slides made by Sylvia Sorkin, Community College of Baltimore.

Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.

Algorithms CS139 – Aug 30, Problem Solving Your roommate, who is taking CS139, is in a panic. He is worried that he might lose his financial aid.

C++ Programming Language Lecture 2 Problem Analysis and Solution Representation By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department.

1 L= { u u R where u  {a, b}* } Last class we designed a TM which accepts this language (that is, it halts if the input is in L and hangs or computes.

Deductive Reasoning Chapter 2 Lesson 4.

Equations Reducible to Quadratic

Basic problem solving CSC 111.

1. 2 Preface In the time since the 1986 edition of this book, the world of compiler design has changed significantly 3.

Do Now. Law of Syllogism ◦ We can draw a conclusion when we are given two true conditional statements. ◦ The conclusion of one statement is the hypothesis.

1 Announcements: There is no problem of the day today (handing in your assignment will be used to indicate attendance so please hand in a sheet with your.

Transforming Data by Calculation Author: Professor J.N. Oliveira Presentation by: Mohammadreza Vali zadeh.

The Hashemite University Computer Engineering Department

Format for Developing Problem Questions What is the relationship between ____________ and ____________? and ____________? Slide 2.1.

1 Overview of Programming Principles of Computers.

1 Arithmetic Where we've been: –Abstractions: Instruction Set Architecture Assembly Language and Machine Language What's up ahead: –Implementing the Architecture.

Introduction to Computer Programming using Fortran 77.

Introduction to Problem Solving Programming is a problem solving activity. When you write a program, you are actually writing an instruction for the computer.

CS223: Software Engineering Lecture 26: Software Testing.

Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.

1 Week 1 Introduction, Writing a Program, Building a System Software Engineering Fall Term 2015 Marymount University School of Business Administration.

Prolog CSC 481 Team Project Winter 2009 ES-Tools Team.

Chapter 5 Recursion as a Problem-Solving Technique

C++ Plus Data Structures

Conditional Statements

The most important work in Operating Systems

The most important work in Software Verification

Chapter 5 Decisions. Chapter 5 Decisions ssential uestion: How are Boolean expressions or operators used in everyday life?

A Test Case + Mock Class Generator for Coding Against Interfaces

3 Logic The Study of What’s True or False or Somewhere in Between.

Arithmetic Where we've been:

3.4 Computer systems Boolean logic Lesson 2.

Argument Lecture 5.

2-3 Deductive Reasoning Objectives:

IS 2935: Developing Secure Systems

Lab 07 – 3D Maze.

Drill: Tuesday, 10/18 2. Determine if the conditional “If x is a number then |x| > 0” is true. If false, give a counterexample. OBJ: SWBAT analyze.

CSC128 FUNDAMENTALS OF COMPUTER PROBLEM SOLVING

If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.

If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.

SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.

Presentation transcript:

Stan Lovric CSc214 Fall 2002 Victorian Symbolic Logic John Swartz Victorian Symbolic Logic Paper by John Swartz Presentation by Stan Lovric

Stan Lovric CSc214 Fall 2002 Victorian Symbolic Logic John Swartz Problem Definition CLIPS implementation of a syllogism proving system Based on “Symbolic logic” published by Lewis Carroll in The system solves two kinds of syllogisms. (1) given two premises and a conclusion, it checks the correctness of the conclusion and (2) given only two premises, it derives a conclusion if there is one. Syllogism: Some holidays are rainy. Rainy days are tiresome. Some holidays are tiresome.

Stan Lovric CSc214 Fall 2002 Victorian Symbolic Logic John Swartz Motivation Feasibility study of natural language processing system (NLP). Use layers of abstraction to implement a complex system. Begin with CLIPS as the lowest level of abstraction. To solve the problem, the software engineer must implement the intervening abstraction layers.

Stan Lovric CSc214 Fall 2002 Victorian Symbolic Logic John Swartz Program Output CLIPS> (run) input line value is: >>>> some holidays are rainy: rainy days are tiresome. some holidays are tiresome. The subject syllogism is true!!! and is of type >>> ([figureTwoA]) input line value is: >>>> no m' are x: some m' are y'. The subject syllogism implies the following conclusion >>> some x' are y' input line value is: >>>> all x are m: no y are m'. no y are x'. The subject syllogism is false!!! () input line value is: >>>> EOF Thus endeth the input file CLIPS> (exit)

Stan Lovric CSc214 Fall 2002 Victorian Symbolic Logic John Swartz Conclusion The author wanted to show a possible path to the general solution of the NLP problem. Interesting approach, but no information about the outcome of the effort.