On legal reasoning, legal informatics and visualization. Transforming the problem of impossibility to achieve several goals into a weighing problem

Size: px
Start display at page:

Download "On legal reasoning, legal informatics and visualization. Transforming the problem of impossibility to achieve several goals into a weighing problem"

Transcription

1 On legal reasoning, legal informatics and visualization Transforming the problem of impossibility to achieve several goals into a weighing problem Vytautas ČYRAS Vilnius University Faculty of Mathematics and Informatics Vilnius, Lithuania Vytautas.Cyras@mif.vu.lt Lecture slides

2 1. Legal reasoning. An example T. Bench-Capon, H. Prakken (2006) Justifying actions by accruing arguments. In: Computational Models of Argument Proceedings of COMMA 2006, pp IOS Press. Slides: 2

3 An example problem: legal punishment A judge must determine the best way to punish (pu) a criminal found guilty. He has three options: imprisonment (pr), a fine (fi) and community service (cs). Besides punishment there are three more goals at stake, deterring the general public (de), rehabilitating the offender (re) and protecting society from crime (pt). So pu will be the most important goal, but the method of punishment chosen (pr, fi or cs) will depend on other goals. Initial state ( ) Actions: 1. imprisonment (pr), pr fi cs 2. fine (fi) 3. community service (cs) Final state ( pu, de, pt, re ) Goals: 1. punishment (pu) main goal 2. deterrence (de) 3. rehabilitation (re) 4. protecting society (pt) pu re de pt 3

4 Causal knowledge 1. Imprisonment (pr) promotes both deterrence (de) [R4] and protection of society (pt) [R5], but demotes rehabilitation (re) [R6] of the offender. 2. Fine (fi) promotes deterrence (de) [R7] but has no effect on rehabilitation (re) or the protection of society (pt) since the offender would remain free. 3. Community service (cs) promotes rehabilitation (re) [R9] of the offender, but demotes deterrence (de) [R8] since this punishment is not feared. Causal rules (between actions and goals): R1: pr pu R2: fi pu R3: cs pu 3 actions: R4: pr de R5: pr pt R6: pr re imprisonment (pr) R5 R1 R4 R6 R7: fi de R8: cs de fine (fi) R7 R2 R8 R3 R9: cs re community service (cs) R9 4 goals: protection of society (pt) deterrence (de) punishment (pu) rehabilitation (re) 4

5 Evaluation of arguments for actions. Values of goals Judge s goal base G = { pu, de, pt, re } (more exactly, G = { D pu, D de, D pt, D re }, where D is a modality; standing for desire) A propositional modal logic is used All 4 goals cannot be achieved! See further Question: What is the best way to punish the offender? Answer: cs (see further) Reason: first, cs > pr, second, cs > fi Value (promoted, demoted) Score { pu, de, pt, re } v(pr + ) = ( {pu, de, pt}, {re} ) 3:1 (1, 1, 1, -1) v(fi + ) = ( {pu, de}, ) 2:0 (1, 1, 0, 0) v(cs + ) = ( {pu, re}, {de} ) 2:1 (1, -1, 0, 1) R1: pr pu R2: fi pu R3: cs pu R4: pr de R5: pr pt R6: pr re R7: fi de R8: cs de R9: cs re pr + fi + cs + 5

6 A sketch of reasoning for cs Step 1 pr + > 1 pr Reason: pu sways cs + > 2 cs Step 2: > 3 > 3 > 4 Extralogical choice: re is next to pu Hence re > 3 de + pt Step 3: > 4 Extralogical choice for rehabilitation: re de > 4 de pr + fi + cs + > 1 > 2 winner pr cs 6

7 Arguments on imprisonment Practical syllogism, originally see Aristotle 1. Agent P wishes to realise goal G. 2. If P performs action A, G will be realised. 3. Therefore, P should perform A. Both PPS and NPS are defeasible. D G A G D A Abduction positive (Positive practical syllogism, PPS) D G A G D A Abduction negative (Negative practical syllogism, NPS) Individual defeat l 1 D pr l 2 D pr l 3 D pr l 4 D pr pr pu D pu pr de D de pr pt D pt pr re D re R1 R4 R5 R6 7

8 Abduction and deduction Abduction From goal to facts Abductive reasoning Backward-chaining in Artificial Intelligence Goal R 3 R 1 R 2 R 4 Deduction From facts to goal Deductive reasoning Forward-chaining Facts D G A G D A Abduction positive A A G G modus ponens 8

9 Accruals on imprisonment. Then defeat Defeat > 1 : pu sways Accrual : pr + D pr pr D pr l 1 D pr l 2 D pr l 3 D pr l 4 D pr pr pu D pu pr de D de pr pt D pt pr re D re R1 R4 R5 R6 9

10 Accrual on fining Accrual : fi + D fi l 5 D fi l 6 D fi fi pu D pu fi de D de R2 R7 10

11 Accruals on community service Defeat > 2 : pu sways Accrual : cs + D cs cs D cs l 7 D cs l 8 D cs l 9 D cs cs pu D pu cs re D re cs de D de R3 R9 R8 11

12 The attack graph pr + > 1 pr Step 1. > 1 and > 2 Step 2. > 3 Value (promoted, demoted) v(pr + ) = ( {pu, de, pt}, {re} ) 3:1 v(cs + ) = ( {pu, re}, {de} ) 2:1 re > 3 de + pt More precisely, re de > 3 de + pt re proved above. fi + > 3 winner > 4 cs + > 2 cs Extralogical choice: re is next to pu Thus we (judge) make re the second most important goal Other choices, e.g. pro fine fi + are possible cs + D cs Defeat: > 3 pr + D pr l 7 D cs l 8 D cs l 1 D pr l 2 D pr l 3 D pr cs pu D pu cs re D re pr pu D pu pr de D de pr pt D pt R3 R9 R1 R4 R5 12

13 Step 3. Defeat > 4 We chose promoting rehabilitation re while demoting deterrence de over promoting deterrence de. Formally, re de > 4 de. Value (promoted, demoted) v(fi + ) = ( {pu, de}, ) 2:0 v(cs + ) = ( {pu, re}, {de} ) 2:1 re de > 4 de pr + fi + > 3 winner > 4 cs + > 1 > 2 pr Justification: given that we must punish, we choose to do so in a way which will aid rehabilitation. cs cs + D cs Defeat: > 4 fi + D fi l 7 D cs l 8 D cs l 5 D fi l 6 D fi cs pu D pu cs re D re fi pu D pu fi de D de R3 R9 R2 R7 13

14 Conclusions Limitations of this formalisation See Bench-Capon & Prakken of artificial intelligence in law formalising choice algorithmically undecidable problems NP-problems of mathematics 14

15 2. On the problem of infeasibility of achieving several goals 15

16 Example: drink vs. roll You have one coin and want to buy two items: drink roll of bread Initial state buydrink ( ) buyroll Final state ( drink, roll ) Buy one item for a coin. You cannot buy both items. One cannot eat it and keep it Impossible 16

17 Modeling with two rules 1) Rules: R1: coin drink & coin buydrink R2: coin roll & coin buyroll 2) Facts: coin Three alternative goals: 3) Goal: drink Path: R1 3) Goal: roll Path: R2 3) Goal: drink & roll Path: impossible coin R1 drink coin R2 roll 17

18 Geometrical explanation. Choice is extralogical Which action to choose: to buy a drink or alternatively a roll? (drink, 0) > (0, roll) or alternatively (drink, 0) < (0, roll)? No ordering of vectors, i.e. neither (1,0) > (0,1) nor (1,0) < (0,1) Formal logic cannot help here to make a choice Extralogical reasons have to be involved E.g., assign weight 2 to drink and 1 to roll. You are thirsty and prefer drink In other circumstances you might prefer roll roll (0,1) 0 1 roll (0,1) Impossible (1,1) (1,0) drink (2,1) Reasoning with the distance to the goal Distance from drink: (2,1) (2,0) = (0,1) = 1 Distance from roll: (2,1) (0,1) = (2,0) = 2 Smaller distance to goal, 1, is preferred to 2. Therefore drink wins 0 drink (2,0) 0 2 winner 18

19 The landscape metaphor in meansends analysis The end justifies the means (Der Zweck heiligt das Mittel). Kant s imperative: Who is willing the end, must be willing the means (Wer den Zweck will, muss das Mittel wollen). evaluation m weak = (0,1) positive 1 m right = (1,1) negative 0 0 false 1 true m wrong = (1,0) bringsabouttheend 3 means m wrong, m weak and m right 19

20 Thank you 20

A LANDSCAPE OF LEGAL TELEOLOGY : FORMALIZATION THROUGH VISUALIZATION

A LANDSCAPE OF LEGAL TELEOLOGY : FORMALIZATION THROUGH VISUALIZATION A LANDSCAPE OF LEGAL TELEOLOGY : FORMALIZATION THROUGH VISUALIZATION Vytautas Cyras Vilnius University, Faculty of Mathematics and Informatics, Naugarduko 24, Vilnius, Lithuania, vytautas.cyras@mif.vu.lt

More information

Formalising a legal opinion on a legislative proposal in the ASPIC + framework

Formalising a legal opinion on a legislative proposal in the ASPIC + framework Formalising a legal opinion on a legislative proposal in the ASPIC + framework Henry Prakken Department of Information and Computing Sciences, University of Utrecht and Faculty of Law, University of Groningen,

More information

Towards an integrated theory of causal scenarios and evidential arguments

Towards an integrated theory of causal scenarios and evidential arguments Towards an integrated theory of causal scenarios and evidential arguments Floris BEX Department of Information and Computing Sciences, Utrecht University Abstract. The process of proof is one of inference

More information

Combining Modes of Reasoning: an Application of Abstract Argumentation

Combining Modes of Reasoning: an Application of Abstract Argumentation Combining Modes of Reasoning: an Application of Abstract Argumentation Henry Prakken Department of Information and Computing Sciences, Faculty of Science, Utrecht University & Faculty of Law, University

More information

Argumentation-Based Models of Agent Reasoning and Communication

Argumentation-Based Models of Agent Reasoning and Communication Argumentation-Based Models of Agent Reasoning and Communication Sanjay Modgil Department of Informatics, King s College London Outline Logic and Argumentation - Dung s Theory of Argumentation - The Added

More information

DEDUCTIVE REASONING Propositional Logic

DEDUCTIVE REASONING Propositional Logic 7 DEDUCTIVE REASONING Propositional Logic Chapter Objectives Connectives and Truth Values You will be able to understand the purpose and uses of propositional logic. understand the meaning, symbols, and

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment

More information

Propositional Logic Arguments (5A) Young W. Lim 2/23/17

Propositional Logic Arguments (5A) Young W. Lim 2/23/17 Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

More information

Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers

Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers 1. When is an inference rule {a1, a2,.., an} c sound? (b) a. When ((a1 a2 an) c) is a tautology b. When ((a1

More information

ESSENCE 2014: Argumentation-Based Models of Agent Reasoning and Communication

ESSENCE 2014: Argumentation-Based Models of Agent Reasoning and Communication ESSENCE 2014: Argumentation-Based Models of Agent Reasoning and Communication Sanjay Modgil Department of Informatics, King s College London Outline Logic, Argumentation and Reasoning - Dung s Theory of

More information

Propositional Logic Arguments (5A) Young W. Lim 11/30/16

Propositional Logic Arguments (5A) Young W. Lim 11/30/16 Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

More information

A Study of Accrual of Arguments, with Applications to Evidential Reasoning

A Study of Accrual of Arguments, with Applications to Evidential Reasoning A Study of Accrual of Arguments, with Applications to Evidential Reasoning Henry Prakken Institute of Information and Computing Sciences, Utrecht University Faculty of Law, University of Groningen The

More information

Logical forms and substitution instances. Philosophy and Logic Unit 2, Section 2.1

Logical forms and substitution instances. Philosophy and Logic Unit 2, Section 2.1 Logical forms and substitution instances Philosophy and Logic Unit 2, Section 2.1 Avoiding impossibility A valid deductive argument is an argument with a valid logical form. An argument has a valid logical

More information

Adam Blank Spring 2017 CSE 311. Foundations of Computing I

Adam Blank Spring 2017 CSE 311. Foundations of Computing I Adam Blank Spring 2017 CSE 311 Foundations of Computing I Pre-Lecture Problem Suppose that p, and p (q r) are true. Is q true? Can you prove it with equivalences? CSE 311: Foundations of Computing Lecture

More information

Abstract Dialectical Frameworks

Abstract Dialectical Frameworks Abstract Dialectical Frameworks Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de joint work with Stefan Woltran G. Brewka (Leipzig) KR 2010 1 / 18 Outline

More information

Dialectical Frameworks: Argumentation Beyond Dung

Dialectical Frameworks: Argumentation Beyond Dung Dialectical Frameworks: Argumentation Beyond Dung Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de joint work with Stefan Woltran G. Brewka (Leipzig) NMR

More information

Propositional Logic: Bottom-Up Proofs

Propositional Logic: Bottom-Up Proofs Propositional Logic: Bottom-Up Proofs CPSC 322 Logic 3 Textbook 5.2 Propositional Logic: Bottom-Up Proofs CPSC 322 Logic 3, Slide 1 Lecture Overview 1 Recap 2 Bottom-Up Proofs 3 Soundness of Bottom-Up

More information

6. Conditional derivations

6. Conditional derivations 6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes (1588-1679) gives an important argument for government. Hobbes begins by claiming that

More information

Argumentation and rules with exceptions

Argumentation and rules with exceptions Argumentation and rules with exceptions Bart VERHEIJ Artificial Intelligence, University of Groningen Abstract. Models of argumentation often take a given set of rules or conditionals as a starting point.

More information

Argumentation among Agents

Argumentation among Agents Argumentation among Agents Iyad Rahwan 1 Masdar Institute of Science & Technology, UAE 2 University of Edinburgh, UK 3 Massachusetts Institute of Technology, USA I. Rahwan. Argumentation among Agents.

More information

CSCI 5582 Artificial Intelligence. Today 9/28. Knowledge Representation. Lecture 9

CSCI 5582 Artificial Intelligence. Today 9/28. Knowledge Representation. Lecture 9 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin Today 9/28 Review propositional logic Reasoning with Models Break More reasoning Knowledge Representation A knowledge representation is a formal scheme

More information

Proof strategies, or, a manual of logical style

Proof strategies, or, a manual of logical style Proof strategies, or, a manual of logical style Dr Holmes September 27, 2017 This is yet another version of the manual of logical style I have been working on for many years This semester, instead of posting

More information

CMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013

CMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction

More information

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement

More information

TDT70: Uncertainty in Artificial Intelligence. Chapter 1 and 2

TDT70: Uncertainty in Artificial Intelligence. Chapter 1 and 2 TDT70: Uncertainty in Artificial Intelligence Chapter 1 and 2 Fundamentals of probability theory The sample space is the set of possible outcomes of an experiment. A subset of a sample space is called

More information

Computational Intelligence Lecture 13:Fuzzy Logic

Computational Intelligence Lecture 13:Fuzzy Logic Computational Intelligence Lecture 13:Fuzzy Logic Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2011 arzaneh Abdollahi Computational Intelligence Lecture

More information

Artificial Intelligence Chapter 7: Logical Agents

Artificial Intelligence Chapter 7: Logical Agents Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents

More information

PROPOSITIONAL CALCULUS

PROPOSITIONAL CALCULUS PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and

More information

Nonmonotonic Tools for Argumentation

Nonmonotonic Tools for Argumentation Nonmonotonic Tools for Argumentation Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de joint work with Stefan Woltran G. Brewka (Leipzig) CILC 2010 1 / 38

More information

What Is an Ontology?

What Is an Ontology? What Is an Ontology? Vytautas ČYRAS Vilnius University Faculty of Mathematics and Informatics Vilnius, Lithuania Vytautas.Cyras@mif.vu.lt http://www.mif.vu.lt/~cyras/ Based on: N. Guarino, D. Oberle, S.

More information

A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery

A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery (Extended Abstract) Jingde Cheng Department of Computer Science and Communication Engineering Kyushu University, 6-10-1 Hakozaki,

More information

Introduction to Structural Argumentation

Introduction to Structural Argumentation Introduction to Structural Argumentation Anthony Hunter Department of Computer Science, University College London, UK July 8, 2014 1 / 28 Approaches to structured argumentation Some frameworks for structured

More information

How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.

How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey. Major results: (wrt propositional logic) How to reason correctly. How to reason efficiently. How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague,

More information

Ch 3.2: Direct proofs

Ch 3.2: Direct proofs Math 299 Lectures 8 and 9: Chapter 3 0. Ch3.1 A trivial proof and a vacuous proof (Reading assignment) 1. Ch3.2 Direct proofs 2. Ch3.3 Proof by contrapositive 3. Ch3.4 Proof by cases 4. Ch3.5 Proof evaluations

More information

Complete Extensions in Argumentation Coincide with Three-Valued Stable Models in Logic Programming

Complete Extensions in Argumentation Coincide with Three-Valued Stable Models in Logic Programming Complete Extensions in Argumentation Coincide with Three-Valued Stable Models in Logic Programming Martin Caminada a Yining Wu a a University of Luxembourg Abstract In this paper, we prove the correspondence

More information

Propositional Logic Arguments (5A) Young W. Lim 11/8/16

Propositional Logic Arguments (5A) Young W. Lim 11/8/16 Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

More information

Introduction to Structured Argumentation

Introduction to Structured Argumentation Introduction to Structured Argumentation Anthony Hunter Department of Computer Science, University College London, UK April 15, 2016 1 / 42 Computational models of argument Abstract argumentation Structured

More information

Knowledge-based and Expert Systems - 1. Knowledge-based and Expert Systems - 2. Knowledge-based and Expert Systems - 4

Knowledge-based and Expert Systems - 1. Knowledge-based and Expert Systems - 2. Knowledge-based and Expert Systems - 4 Knowledge-based and Expert Systems - 1 Knowledge-based and Expert Systems - 2 Expert systems (ES) provide expert quality advice, diagnosis or recommendations. ES solve real problems which normally would

More information

PSU MATH RELAYS LOGIC & SET THEORY 2017

PSU MATH RELAYS LOGIC & SET THEORY 2017 PSU MATH RELAYS LOGIC & SET THEORY 2017 MULTIPLE CHOICE. There are 40 questions. Select the letter of the most appropriate answer and SHADE in the corresponding region of the answer sheet. If the correct

More information

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares

More information

Warm-Up Problem. Write a Resolution Proof for. Res 1/32

Warm-Up Problem. Write a Resolution Proof for. Res 1/32 Warm-Up Problem Write a Resolution Proof for Res 1/32 A second Rule Sometimes throughout we need to also make simplifications: You can do this in line without explicitly mentioning it (just pretend you

More information

Guest Speaker. CS 416 Artificial Intelligence. First-order logic. Diagnostic Rules. Causal Rules. Causal Rules. Page 1

Guest Speaker. CS 416 Artificial Intelligence. First-order logic. Diagnostic Rules. Causal Rules. Causal Rules. Page 1 Page 1 Guest Speaker CS 416 Artificial Intelligence Lecture 13 First-Order Logic Chapter 8 Topics in Optimal Control, Minimax Control, and Game Theory March 28 th, 2 p.m. OLS 005 Onesimo Hernandez-Lerma

More information

Inference and Proofs (1.6 & 1.7)

Inference and Proofs (1.6 & 1.7) EECS 203 Spring 2016 Lecture 4 Page 1 of 9 Introductory problem: Inference and Proofs (1.6 & 1.7) As is commonly the case in mathematics, it is often best to start with some definitions. An argument for

More information

Knowledge Based Systems: Logic and Deduction

Knowledge Based Systems: Logic and Deduction Knowledge Based Systems: Logic and Deduction Course: CS40002 Instructor: Dr. Pallab Dasgupta Department of Computer Science & Engineering Indian Institute of Technology Kharagpur Knowledge and Reasoning

More information

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.

More information

Manual of Logical Style (fresh version 2018)

Manual of Logical Style (fresh version 2018) Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that

More information

CS280, Spring 2004: Final

CS280, Spring 2004: Final CS280, Spring 2004: Final 1. [4 points] Which of the following relations on {0, 1, 2, 3} is an equivalence relation. (If it is, explain why. If it isn t, explain why not.) Just saying Yes or No with no

More information

INTRODUCTION. Tomoya Sato. Department of Philosophy University of California, San Diego. Phil120: Symbolic Logic Summer 2014

INTRODUCTION. Tomoya Sato. Department of Philosophy University of California, San Diego. Phil120: Symbolic Logic Summer 2014 INTRODUCTION Tomoya Sato Department of Philosophy University of California, San Diego Phil120: Symbolic Logic Summer 2014 TOMOYA SATO LECTURE 1: INTRODUCTION 1 / 51 WHAT IS LOGIC? LOGIC Logic is the study

More information

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................

More information

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement

More information

Handout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte

Handout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a

More information

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #1: Logic & Proofs. Applied Discrete Mathematics Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should

More information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 1028 M: Discrete Mathematics for Engineers EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 12 Using the laws

More information

Maximal ideal recursive semantics for defeasible argumentation

Maximal ideal recursive semantics for defeasible argumentation Maximal ideal recursive semantics for defeasible argumentation Teresa Alsinet 1, Ramón Béjar 1, Lluis Godo 2, and Francesc Guitart 1 1 Department of Computer Science University of Lleida Jaume II, 69 251

More information

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate

More information

Inverting Proof Systems for Secrecy under OWA

Inverting Proof Systems for Secrecy under OWA Inverting Proof Systems for Secrecy under OWA Giora Slutzki Department of Computer Science Iowa State University Ames, Iowa 50010 slutzki@cs.iastate.edu May 9th, 2010 Jointly with Jia Tao and Vasant Honavar

More information

Computational Logic Lecture 3. Logical Entailment. Michael Genesereth Autumn Logical Reasoning

Computational Logic Lecture 3. Logical Entailment. Michael Genesereth Autumn Logical Reasoning Computational Logic Lecture 3 Logical Entailment Michael Genesereth Autumn 2010 Logical Reasoning Logical Reasoning relates premises and conclusion does not say whether conclusion is true in general says

More information

CSCI-495 Artificial Intelligence. Lecture 17

CSCI-495 Artificial Intelligence. Lecture 17 CSCI-495 Artificial Intelligence Lecture 17 Tractable Inference: Horn Logic Resolution in general can be exponential in space and time For tractable inference we need a smaller logic Real-world KBs often

More information

Propositional Resolution

Propositional Resolution Computational Logic Lecture 4 Propositional Resolution Michael Genesereth Spring 2005 Stanford University Modified by Charles Ling and TA, for CS2209 Use with permission Propositional Resolution Propositional

More information

Burdens of Proof in Monological Argumentation

Burdens of Proof in Monological Argumentation Legal Knowledge and Information Systems (Jurix 2010) R. Winkels (ed) IOS Press, 2010 1 Burdens of Proof in Monological Argumentation Guido GOVERNATORI a,1 Giovanni SARTOR b a NICTA, Queensland Research

More information

Algebra 1. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots.

Algebra 1. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots. A1.1.1 Compare real number expressions. A1.1.2 Simplify square

More information

Chapter 1: The Logic of Compound Statements. January 7, 2008

Chapter 1: The Logic of Compound Statements. January 7, 2008 Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive

More information

Logic in Computer Science. Frank Wolter

Logic in Computer Science. Frank Wolter Logic in Computer Science Frank Wolter Meta Information Slides, exercises, and other relevant information are available at: http://www.liv.ac.uk/~frank/teaching/comp118/comp118.html The module has 18 lectures.

More information

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional) Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional

More information

Characterization of Semantics for Argument Systems

Characterization of Semantics for Argument Systems Characterization of Semantics for Argument Systems Philippe Besnard and Sylvie Doutre IRIT Université Paul Sabatier 118, route de Narbonne 31062 Toulouse Cedex 4 France besnard, doutre}@irit.fr Abstract

More information

Language of Propositional Logic

Language of Propositional Logic Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called

More information

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the

More information

22c:145 Artificial Intelligence

22c:145 Artificial Intelligence 22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not

More information

Part Six: Reasoning Defeasibly About the World

Part Six: Reasoning Defeasibly About the World Part Six: Reasoning Defeasibly About the World Our in building a defeasible reasoner was to have an inference-engine for a rational agent capable of getting around in the real world. This requires it to

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0. For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.

More information

Violated Obligations in a Defeasible Deontic Logic 1

Violated Obligations in a Defeasible Deontic Logic 1 Violated Obligations in a Defeasible Deontic Logic 1 Leendert W.N. van der Torre 2 Abstract. Deontic logic is characterized by the distinction between the actual and the ideal. In this article we discuss

More information

Strategic Argumentation under Grounded Semantics is NP-Complete

Strategic Argumentation under Grounded Semantics is NP-Complete Strategic Argumentation under Grounded Semantics is NP-Complete Guido Governatori 1, Michael J. Maher 2, Francesco Olivieri 3, Antonino Rotolo 4 and Simone Scannnapieco 3 1 NICTA Queensland, Australia

More information

Artificial Intelligence. Propositional logic

Artificial Intelligence. Propositional logic Artificial Intelligence Propositional logic Propositional Logic: Syntax Syntax of propositional logic defines allowable sentences Atomic sentences consists of a single proposition symbol Each symbol stands

More information

COMP 2600: Formal Methods for Software Engineeing

COMP 2600: Formal Methods for Software Engineeing COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

Instructor: Sudeepa Roy

Instructor: Sudeepa Roy CompSci 590.6 Understanding Data: Theory and Applications Lecture 15 Causality in AI Instructor: Sudeepa Roy Email: sudeepa@cs.duke.edu 1 Today s Reading 1. Causes and Explanations: A Structural- Model

More information

Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.

Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday. Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due

More information

Predicate Logic. Andreas Klappenecker

Predicate Logic. Andreas Klappenecker Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.

More information

CS 730/830: Intro AI. 2 handouts: slides, asst 5. Wheeler Ruml (UNH) Lecture 10, CS / 19. What is KR? Prop. Logic. Reasoning

CS 730/830: Intro AI. 2 handouts: slides, asst 5. Wheeler Ruml (UNH) Lecture 10, CS / 19. What is KR? Prop. Logic. Reasoning CS 730/830: Intro AI 2 handouts: slides, asst 5 Wheeler Ruml (UNH) Lecture 10, CS 730 1 / 19 History of Logic Advice Taker The PSSH Introduction to Knowledge Representation and Wheeler Ruml (UNH) Lecture

More information

Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs

Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Computer Science cpsc322, Lecture 20 (Textbook Chpt 5.1.2-5.2.2 ) June, 6, 2017 CPSC 322, Lecture 20 Slide 1 Lecture Overview

More information

From Arguments to Constraints on a Bayesian Network

From Arguments to Constraints on a Bayesian Network From Arguments to Constraints on a Bayesian Network Floris BEX a, Silja RENOOIJ a a Information and Computing Sciences, Utrecht University, The Netherlands Abstract. In this paper, we propose a way to

More information

cis32-ai lecture # 18 mon-3-apr-2006

cis32-ai lecture # 18 mon-3-apr-2006 cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem

More information

PHI Propositional Logic Lecture 2. Truth Tables

PHI Propositional Logic Lecture 2. Truth Tables PHI 103 - Propositional Logic Lecture 2 ruth ables ruth ables Part 1 - ruth unctions for Logical Operators ruth unction - the truth-value of any compound proposition determined solely by the truth-value

More information

Predicate Logic & Quantification

Predicate Logic & Quantification Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In

More information

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Why Learning Logic? Logic. Propositional Logic. Compound Propositions Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional

More information

Formal Logic. Critical Thinking

Formal Logic. Critical Thinking ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,

More information

On the Complexity of the Reflected Logic of Proofs

On the Complexity of the Reflected Logic of Proofs On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,

More information

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural

More information

Propositional Logic Arguments (5A) Young W. Lim 11/29/16

Propositional Logic Arguments (5A) Young W. Lim 11/29/16 Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

More information

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

Discrete Structures of Computer Science Propositional Logic III Rules of Inference Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic

More information

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving

More information

First Order Logic Arguments (5A) Young W. Lim 2/24/17

First Order Logic Arguments (5A) Young W. Lim 2/24/17 First Order Logic (5A) Young W. Lim Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

More information

6. Logical Inference

6. Logical Inference Artificial Intelligence 6. Logical Inference Prof. Bojana Dalbelo Bašić Assoc. Prof. Jan Šnajder University of Zagreb Faculty of Electrical Engineering and Computing Academic Year 2016/2017 Creative Commons

More information

CS:4420 Artificial Intelligence

CS:4420 Artificial Intelligence CS:4420 Artificial Intelligence Spring 2018 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed by Stuart

More information

Relevant Logic. Daniel Bonevac. March 20, 2013

Relevant Logic. Daniel Bonevac. March 20, 2013 March 20, 2013 The earliest attempts to devise a relevance logic that avoided the problem of explosion centered on the conditional. FDE, however, has no conditional operator, or a very weak one. If we

More information

A Quick Lesson on Negation

A Quick Lesson on Negation A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which

More information

CS 520: Introduction to Artificial Intelligence. Review

CS 520: Introduction to Artificial Intelligence. Review CS 520: Introduction to Artificial Intelligence Prof. Louis Steinberg : First-order Logic Proof Algorithms 1 Review Representing a Domain in FOL A domain is a portion of the world about which we wish to

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information