Seminar Topic Assignment

Size: px
Start display at page:

Download "Seminar Topic Assignment"

Transcription

1 Knowledge-based Systems Group 184/3 WS 2017/18 Seminar Topic Assignment Institut für Informationssysteme Arbeitsbereich Wissensbasierte Systeme

2 Seminar Topics Seminars: Seminar in Theoretical Computer Science Seminar in Artificial Intelligence Seminar in Logic Seminar in Knowledge Representation and Reasoning Seminar in Cryptography Topics for master seminars: Refutation Calculi (Tompits) Quantum Logic: Basics and Proof Theory (Tompits) Natural Language Processing Cognitive Psychology and its Implications (Tompits) History of Logic (Tompits, Eiter) Data and Knowledge Processing (Eiter) Artificial Intelligence (Eiter) Cryptography (Egly) Solvers and Proof Systems for QBFs (Egly) Digital Transformation and AI (Egly) 1/15

3 Refutation Calculi 1. T. Skura. Refutation systems in propositional logic. Handbook of Philosophical Logic, J. Lukasiewicz. Aristotle s Syllogistic from the Standpoint of Modern Formal Logic A. Tamminga. Logics of rejection: two systems of natural deduction. Logique & Analyse, U. Wybraniec-Skardowska and J. Waldmajer. On pairs of dual consequence operations. Logica Universalis, T. Skura. A refutation theory. Logica Universalis, V. Goranko. Refutation systems in modal logic. Studia Logica, R. Dutkiewicz. The method of axiomatic rejection for the intuitionistic propositional calculus. Studia Logica, P. Bonatti, N. Olivetti. Sequent calculi for propositional nonmonotonic logics. ACM Transactions on Computational Logic, /15

4 Quantum Logic: Basics and Proof Theory M. L. Dalla Chiara and R. Giuntini. Quantum Logics. Handbook of Philosophical Logic Vol. 6, H. Nishimura. Gentzen Methods in Quantum Logic. Handbook of Quantum Logic and Quantum Structures, Natural Deduction System for Quantum Logic. In: P. Gibbins, Particles and Paradoxes, Cambridge University Press, N. Kamide. Proof Theory of Paraconsistent Quantum Logic. Journal of Philosophical Logic, /15

5 Natural Language Processing N. Indurkhya and F. J. Damerau, editors. Handbook of Natural Language Processing, Second Edition, From the Contents: 1. Semantic Analysis 2. Natural Language Generation 3. Corpus Creation 4. Part-of-Speech Tagging 5. Word Sense Disambiguation 6. An Overview of Modern Speech Recognition 7. Question Answering 8. Information Extraction 9. Report Generation 10. Ontology Construction 4/15

6 Cognitive Psychology and its Implications John R. Anderson: Cognitive Psychology and its Implications, Seventh Edition, 2009 From the Contents: 1. Perception 2. Attention and Performance 3. Mental Imagery 4. Representation of Knowledge 5. Human Memory 6. Problem Solving 7. Expertise 8. Reasoning 9. Judgement and Decision Making 10. Language Structure 11. Language Comprehension 12. Individual Differences in Cognition 5/15

7 History of Logic Additional topics not covered in the VO History of Logic. Topics: 1. Stoic and Megarian logic 2. Albert von Sachsen 3. Gottfried Wilhelm Leibniz ( ): Works about modal logic 4. Augustus de Morgan ( ) 5. George Boole ( ): Analysis of Clarke and Spinoza s ontological arguments (from The Laws of Thought ) 6. Charles Sanders Peirce ( ): Existential Graphs 7. The logic of Stanis law Leśniewski ( ) 8. Rudolf Carnap ( ): Abriss der Logistik, Meaning and Necessity: A Study in Semantics and Modal Logic, /15

8 History of Logic (II) Logicomix 7/15

9 History of Logic (II) Gödel and Carnap in Vienna, Tarski in Vienna 8/15

10 Data and Knowledge Processing Streaming Data stream query languages (CQEL, csparql, LARS, etalis,... ) complex event processing (ETALIS,... ) stream reasoning benchmarking applications Workshops on Stream Reasoning: TU Vienna, Nov 9-10, 2015, ISWC/Kobe, Oct 17, 2016 /Vienna Oct 22, 2017 TU Berlin Dec 8, 2016; Uni Zurich, Jan 2018 Theory, systems, applications 9/15

11 Data and Knowledge Processing Temporal Logics for Stream Reasoning linear time logic temporal equilibrium logic temporal description logics Reasoning about actions planning using ASP agent policies 10/15

12 Data and Knowledge Processing Answer Set Programming with external source access dlvhex system, triple(x, Y, Z) url(file), &rdf [File](X, Y, Z). // import RDF triples clingo, clingcon ASP + X, X = SMT, Description Logics, Constraint Solving,... Theory, systems, applications ASP with Uncertainty Markov Logic extensions Probabilistic ASP... incremental ASP evaluation 11/15

13 Artificial Intelligence Breakthroughs in AI Liberatus Alpha-Go... AI & Cognitive Science: can machines be conscious? AI Challenges: AngryBirds Allen AI Science Challenge Winograd Scheme Challenge... 12/15

14 Cryptography Modern hash functions like Blake, Grøstl, Keccak,... : Foundations and algorithms Blockchains Theory and applications 13/15

15 Solvers and Proof Systems for QBFs QBF solving more and more important for practical application (e.g., synthesis) What QBF solvers are available, what is their performance? Papers Janota, Marques-Silva: Solving QBF by clause selection, IJCAI 2015 Rabe, Tentrup: CAQE: A certifing QBF solver, FMCAD 2015 Tu et al.: QELL: QBF reasoning with extended clause learning and levelized SAT solving, SAT /15

16 Digital Transformation and AI Martin Ford: Rise of the Robots: Technology and the Threat of a Jobless Future, Basic Books, 2015 (paperback 2016) The Jobless Future Is A Myth (Steve Denning, Forbes) [link] 15/15

On Axiomatic Rejection for the Description Logic ALC

On Axiomatic Rejection for the Description Logic ALC On Axiomatic Rejection for the Description Logic ALC Hans Tompits Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Joint work with Gerald Berger Context The

More information

Gentzen-type Refutation Systems for Three-Valued Logics

Gentzen-type Refutation Systems for Three-Valued Logics Gentzen-type Refutation Systems for Three-Valued Logics Johannes Oetsch and Hans Tompits Technische Universität Wien, Institut für Informationssysteme 184/3, Favoritenstraße 9-11, A-1040 Vienna, Austria

More information

On Refutation Rules. Tomasz Skura. 1. Introduction. Logica Universalis

On Refutation Rules. Tomasz Skura. 1. Introduction. Logica Universalis Log. Univers. 5 (2011), 249 254 c 2011 The Author(s). This article is published with open access at Springerlink.com 1661-8297/11/020249-6, published online October 2, 2011 DOI 10.1007/s11787-011-0035-4

More information

Logic as The Calculus of Computer Science

Logic as The Calculus of Computer Science 1 Ottobre, 2007 1 Università di Napoli Federico II What is a Logic? A Logic is a formalism with a sintax a semantics an inference mechanism for reasoning Historical Diagram The First Age of Logic: Symbolic

More information

Refutability and Post Completeness

Refutability and Post Completeness Refutability and Post Completeness TOMASZ SKURA Abstract The goal of this paper is to give a necessary and sufficient condition for a multiple-conclusion consequence relation to be Post complete by using

More information

Pei Wang( 王培 ) Temple University, Philadelphia, USA

Pei Wang( 王培 ) Temple University, Philadelphia, USA Pei Wang( 王培 ) Temple University, Philadelphia, USA Artificial General Intelligence (AGI): a small research community in AI that believes Intelligence is a general-purpose capability Intelligence should

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics Yi Li Software School Fudan University March 13, 2017 Yi Li (Fudan University) Discrete Mathematics March 13, 2017 1 / 1 Review of Lattice Ideal Special Lattice Boolean Algebra Yi

More information

Socratic Proofs for Some Temporal Logics RESEARCH REPORT

Socratic Proofs for Some Temporal Logics RESEARCH REPORT Section of Logic and Cognitive Science Institute of Psychology Adam Mickiewicz University in Poznań Mariusz Urbański Socratic Proofs for Some Temporal Logics RESEARCH REPORT Szamarzewskiego 89, 60-589

More information

Sequent calculi of quantum logic with strict implication

Sequent calculi of quantum logic with strict implication CTFM 2015 9/7 Sequent calculi of quantum logic with strict implication Tokyo Institute of Technology Graduate School of Information Science and Engineering Tomoaki Kawano About quantum logic Sequent calculi

More information

ON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS

ON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS Takao Inoué ON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS 1. Introduction It is well-known that Gentzen s sequent calculus LK enjoys the so-called subformula property: that is, a proof

More information

Nonclassical logics (Nichtklassische Logiken)

Nonclassical logics (Nichtklassische Logiken) Nonclassical logics (Nichtklassische Logiken) VU 185.249 (lecture + exercises) http://www.logic.at/lvas/ncl/ Chris Fermüller Technische Universität Wien www.logic.at/people/chrisf/ chrisf@logic.at Winter

More information

The Legacy of Hilbert, Gödel, Gentzen and Turing

The Legacy of Hilbert, Gödel, Gentzen and Turing The Legacy of Hilbert, Gödel, Gentzen and Turing Amílcar Sernadas Departamento de Matemática - Instituto Superior Técnico Security and Quantum Information Group - Instituto de Telecomunicações TULisbon

More information

Tableau vs. Sequent Calculi for Minimal Entailment

Tableau vs. Sequent Calculi for Minimal Entailment Electronic Colloquium on Computational Complexity, Report No. 32 (2014) Tableau vs. Sequent Calculi for Minimal Entailment Olaf Beyersdorff and Leroy Chew School of Computing, University of Leeds, UK Abstract.

More information

A Journey through the Possible Worlds of Modal Logic Lecture 1: Introduction to modal logics

A Journey through the Possible Worlds of Modal Logic Lecture 1: Introduction to modal logics A Journey through the Possible Worlds of Modal Logic Lecture 1: Introduction to modal logics Valentin Goranko Department of Philosophy, Stockholm University ESSLLI 2016, Bolzano, August 22, 2016 Outline

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

Modal logics: an introduction

Modal logics: an introduction Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and

More information

On Urquhart s C Logic

On Urquhart s C Logic On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced

More information

On the duality of proofs and countermodels in labelled sequent calculi

On the duality of proofs and countermodels in labelled sequent calculi On the duality of proofs and countermodels in labelled sequent calculi Sara Negri Department of Philosophy PL 24, Unioninkatu 40 B 00014 University of Helsinki, Finland sara.negri@helsinki.fi The duality

More information

1. A motivation for algebraic approaches to logics

1. A motivation for algebraic approaches to logics Andrzej W. Jankowski AN ALGEBRAIC APPROACH TO LOGICS IN RESEARCH WORK OF HELENA RASIOWA AND CECYLIA RAUSZER 1. A motivation for algebraic approaches to logics To realize the importance of the research

More information

Gödel in class. Achim Feldmeier Brno - Oct 2010

Gödel in class. Achim Feldmeier Brno - Oct 2010 Gödel in class Achim Feldmeier Brno - Oct 2010 Philosophy lost key competence to specialized disciplines: right life (happyness, morals) Christianity science and technology Natural Sciences social issues

More information

I N F S Y S R E S E A R C H R E P O R T

I N F S Y S R E S E A R C H R E P O R T I N F S Y S R E S E A R C H R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ABTEILUNG WISSENSBASIERTE SYSTEME STRUCTURE-BASED CAUSES AND EXPLANATIONS IN THE INDEPENDENT CHOICE LOGIC Alberto Finzi and Thomas

More information

School of EECS Washington State University. Artificial Intelligence

School of EECS Washington State University. Artificial Intelligence School of EECS Washington State University 1 } Webpage: www.eecs.wsu.edu/~holder/courses/ai } Email (holder@wsu.edu) } Blackboard Learn (learn.wsu.edu) } mywsu (my.wsu.edu) 2 Readings: Chapter 1 3 } John

More information

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics

More information

Machine Learning for Interpretation of Spatial Natural Language in terms of QSR

Machine Learning for Interpretation of Spatial Natural Language in terms of QSR Machine Learning for Interpretation of Spatial Natural Language in terms of QSR Parisa Kordjamshidi 1, Joana Hois 2, Martijn van Otterlo 1, and Marie-Francine Moens 1 1 Katholieke Universiteit Leuven,

More information

Propositional Logic Language

Propositional Logic Language Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite

More information

PUBLICATIONS OF CECYLIA RAUSZER

PUBLICATIONS OF CECYLIA RAUSZER PUBLICATIONS OF CECYLIA RAUSZER [CR1] Representation theorem for semi-boolean algebras I, Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 19(1971), 881 887. [CR2] Representation theorem for semi-boolean

More information

Artificial Intelligence - TU Clausthal June On Consistency Handling Inconsistency Paraconsistent Logic - Many-Valued Logic

Artificial Intelligence - TU Clausthal June On Consistency Handling Inconsistency Paraconsistent Logic - Many-Valued Logic 1 Artificial Intelligence - TU Clausthal - 18-19 June 2013 On Consistency Handling Inconsistency Paraconsistent Logic - Many-Valued Logic Jørgen Villadsen Associate Professor in Algorithms, Logic and Graphs

More information

LOGIC PROPOSITIONAL REASONING

LOGIC PROPOSITIONAL REASONING LOGIC PROPOSITIONAL REASONING WS 2017/2018 (342.208) Armin Biere Martina Seidl biere@jku.at martina.seidl@jku.at Institute for Formal Models and Verification Johannes Kepler Universität Linz Version 2018.1

More information

A NEW FOUR-VALUED APPROACH TO MODAL LOGIC JEAN-YVES BEZIAU. In this paper we present several systems of modal logic based on four-valued

A NEW FOUR-VALUED APPROACH TO MODAL LOGIC JEAN-YVES BEZIAU. In this paper we present several systems of modal logic based on four-valued Logique & Analyse 213 (2011), x x A NEW FOUR-VALUED APPROACH TO MODAL LOGIC JEAN-YVES BEZIAU Abstract In this paper several systems of modal logic based on four-valued matrices are presented. We start

More information

Propositions as Types

Propositions as Types Propositions as Types Martin Pfeifhofer & Felix Schett May 25, 2016 Contents 1 Introduction 2 2 Content 3 2.1 Getting Started............................ 3 2.2 Effective Computability And The Various Definitions.......

More information

Dependency Schemes in QBF Calculi: Semantics and Soundness

Dependency Schemes in QBF Calculi: Semantics and Soundness Dependency Schemes in QBF Calculi: Semantics and Soundness Olaf Beyersdorff and Joshua Blinkhorn School of Computing, University of Leeds, UK {O.Beyersdorff,scjlb}@leeds.ac.uk Abstract. We study the parametrisation

More information

On Pairs of Dual Consequence Operations

On Pairs of Dual Consequence Operations Log. Univers. 5 (2011), 177 203 c 2011 The Author(s). This article is published with open access at Springerlink.com 1661-8297/11/020177-27, published online June 15, 2011 DOI 10.1007/s11787-011-0030-9

More information

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation Turing Computation /0/ Models of Computation, Turing Machines, and the Limits of Turing Computation Bruce MacLennan Models A model is a tool intended to address a class of questions about some domain of

More information

The Degree of Commitment to the Initial Analysis Predicts the Cost of Reanalysis: Evidence from Japanese Garden-Path Sentences

The Degree of Commitment to the Initial Analysis Predicts the Cost of Reanalysis: Evidence from Japanese Garden-Path Sentences P3-26 The Degree of Commitment to the Initial Analysis Predicts the Cost of Reanalysis: Evidence from Japanese Garden-Path Sentences Chie Nakamura, Manabu Arai Keio University, University of Tokyo, JSPS

More information

Piotr Kulicki The Use of Axiomatic Rejection

Piotr Kulicki The Use of Axiomatic Rejection Piotr Kulicki The Use of Axiomatic Rejection 1. Introduction The central point of logic is an entailment relation, which in different contexts is expressed as an implication in a system, syntactic derivability

More information

Can Machines Learn Logics?

Can Machines Learn Logics? Can Machines Learn Logics? Chiaki Sakama 1 and Katsumi Inoue 2 1 Department of Computer and Communication Sciences Wakayama University, Sakaedani, Wakayama 640-8510, Japan sakama@sys.wakayama-u.ac.jp 2

More information

Rejection in Łukasiewicz s and Słupecki s Sense

Rejection in Łukasiewicz s and Słupecki s Sense Rejection in Łukasiewicz s and Słupecki s Sense Urszula Wybraniec-Skardowska Abstract. The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz

More information

1. Algebra H-B-M-S- <A, 0, 1,,,,,, >

1. Algebra H-B-M-S- <A, 0, 1,,,,,, > Bulletin of the Section of Logic Volume 17:3/4 (1988), pp. 127 133 reedition 2005 [original edition, pp. 127 137] Alexander S. Karpenko ALGEBRAIC STRUCTURE OF THE TRUTH-VALUES FOR L ω This paper is an

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

From Bi-facial Truth to Bi-facial Proofs

From Bi-facial Truth to Bi-facial Proofs S. Wintein R. A. Muskens From Bi-facial Truth to Bi-facial Proofs Abstract. In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological

More information

Computer Science and Logic A Match Made in Heaven

Computer Science and Logic A Match Made in Heaven A Match Made in Heaven Luca Aceto Reykjavik University Reykjavik, 3 April 2009 Thanks to Moshe Vardi from whom I have drawn inspiration (read stolen ideas ) for this presentation. Why This Talk Today?

More information

Lecture 1: Logical Foundations

Lecture 1: Logical Foundations Lecture 1: Logical Foundations Zak Kincaid January 13, 2016 Logics have two components: syntax and semantics Syntax: defines the well-formed phrases of the language. given by a formal grammar. Typically

More information

Non-Analytic Tableaux for Chellas s Conditional Logic CK and Lewis s Logic of Counterfactuals VC

Non-Analytic Tableaux for Chellas s Conditional Logic CK and Lewis s Logic of Counterfactuals VC Australasian Journal of Logic Non-Analytic Tableaux for Chellas s Conditional Logic CK and Lewis s Logic of Counterfactuals VC Richard Zach Abstract Priest has provided a simple tableau calculus for Chellas

More information

RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED LOGIC

RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED LOGIC Bulletin of the Section of Logic Volume 10/4 (1981), pp. 185 190 reedition 2009 [original edition, pp. 185 191] Newton C. A. da Costa Elias H. Alves RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED

More information

Preduction: A Common Form of Induction and Analogy

Preduction: A Common Form of Induction and Analogy Preduction: A Common Form of Induction and Analogy Jun Arima Fujitsu Laboratories Ltd., Fujitsu Kyushu R&D center, 2-2-Momochihama, Sawara-ku,Fukuoka-shi 814, Japan. Abstract Deduction, induction, and

More information

Price: $25 (incl. T-Shirt, morning tea and lunch) Visit:

Price: $25 (incl. T-Shirt, morning tea and lunch) Visit: Three days of interesting talks & workshops from industry experts across Australia Explore new computing topics Network with students & employers in Brisbane Price: $25 (incl. T-Shirt, morning tea and

More information

A META-LOGIC OF INFERENCE RULES: SYNTAX

A META-LOGIC OF INFERENCE RULES: SYNTAX Logic and Logical Philosophy Volume 24 (2015), 313 337 DOI: 10.12775/LLP.2015.007 Alex Citkin A META-LOGIC OF INFERENCE RULES: SYNTAX Abstract. This work was intended to be an attempt to introduce the

More information

Formal Logic and Deduction Systems

Formal Logic and Deduction Systems Formal Logic and Deduction Systems Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) Formal Logic and Deduction Systems MFES

More information

Meaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have

Meaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have INTENSIONAL AND MODAL LOGIC Meaning and Reference Why do we consider extensions to the standard logical language(s)? Requirements of knowledge representation / domain modelling Intensional expressions:

More information

ON PURE REFUTATION FORMULATIONS OF SENTENTIAL LOGICS

ON PURE REFUTATION FORMULATIONS OF SENTENTIAL LOGICS Bulletin of the Section of Logic Volume 19/3 (1990), pp. 102 107 reedition 2005 [original edition, pp. 102 107] Tomasz Skura ON PURE REFUTATION FORMULATIONS OF SENTENTIAL LOGICS In [1] J. Lukasiewicz introduced

More information

Equivalence for the G 3-stable models semantics

Equivalence for the G 3-stable models semantics Equivalence for the G -stable models semantics José Luis Carballido 1, Mauricio Osorio 2, and José Ramón Arrazola 1 1 Benemérita Universidad Autóma de Puebla, Mathematics Department, Puebla, México carballido,

More information

A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC

A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC Bulletin of the Section of Logic Volume 41:3/4 (2012), pp. 149 153 Zdzis law Dywan A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC Abstract We will propose a new axiomatization of four-valued Lukasiewicz

More information

Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs

Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs Joohyung Lee and Ravi Palla School of Computing and Informatics Arizona State University, Tempe, AZ, USA {joolee,

More information

Decision Procedures for Satisfiability and Validity in Propositional Logic

Decision Procedures for Satisfiability and Validity in Propositional Logic Decision Procedures for Satisfiability and Validity in Propositional Logic Meghdad Ghari Institute for Research in Fundamental Sciences (IPM) School of Mathematics-Isfahan Branch Logic Group http://math.ipm.ac.ir/isfahan/logic-group.htm

More information

Propositional Logic: Evaluating the Formulas

Propositional Logic: Evaluating the Formulas Institute for Formal Models and Verification Johannes Kepler University Linz VL Logik (LVA-Nr. 342208) Winter Semester 2015/2016 Propositional Logic: Evaluating the Formulas Version 2015.2 Armin Biere

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

185.A09 Advanced Mathematical Logic

185.A09 Advanced Mathematical Logic 185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted

More information

CHAPTER 11. Introduction to Intuitionistic Logic

CHAPTER 11. Introduction to Intuitionistic Logic CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated

More information

Lecture Notes for MATH Mathematical Logic 1

Lecture Notes for MATH Mathematical Logic 1 Lecture Notes for MATH2040 - Mathematical Logic 1 Michael Rathjen School of Mathematics University of Leeds Autumn 2009 Chapter 0. Introduction Maybe not all areas of human endeavour, but certainly the

More information

Temporal Difference Learning & Policy Iteration

Temporal Difference Learning & Policy Iteration Temporal Difference Learning & Policy Iteration Advanced Topics in Reinforcement Learning Seminar WS 15/16 ±0 ±0 +1 by Tobias Joppen 03.11.2015 Fachbereich Informatik Knowledge Engineering Group Prof.

More information

Tableau Systems for Logics of Formal Inconsistency

Tableau Systems for Logics of Formal Inconsistency Tableau Systems for Logics of Formal Inconsistency Walter A. Carnielli Centre for Logic and Epistemology, and Department of Philosophy State University of Campinas CLE/Unicamp, Campinas, Brazil João Marcos

More information

Integrated Commonsense Reasoning and Learning Using Non-axiomatic Logic. Pei Wang Temple University Philadelphia, USA

Integrated Commonsense Reasoning and Learning Using Non-axiomatic Logic. Pei Wang Temple University Philadelphia, USA Integrated Commonsense Reasoning and Learning Using Non-axiomatic Logic Pei Wang Temple University Philadelphia, USA Intelligence as a Whole Mainstream AI treats Intelligence as a collection of problem-specific

More information

On Conflicts and Strategies in QBF

On Conflicts and Strategies in QBF Nikolaj Bjørner 1, Mikoláš Janota 2 and William Klieber 3 1 Microsoft Research, Redmond, USA 2 Microsoft Research, Cambridge, UK 3 CERT/SEI, Carnegie Mellon University Abstract QBF solving techniques can

More information

A natural sequent calculus for Lewis logic of counterfactuals

A natural sequent calculus for Lewis logic of counterfactuals A natural sequent calculus for Lewis logic of counterfactuals Nicola Olivetti 1 and Gian Luca Pozzato 2 1 Dip. Informatica - Universitá di Torino - Italy gianluca.pozzato@unito.it 2 Aix Marseille Univ.

More information

On the Complexity of Input/Output Logic

On the Complexity of Input/Output Logic On the Complexity of Input/Output Logic Xin Sun 1 and Diego Agustín Ambrossio 12 1 Faculty of Science, Technology and Communication, University of Luxembourg, Luxembourg xin.sun@uni.lu 2 Interdisciplinary

More information

Embedding logics into product logic. Abstract. We construct a faithful interpretation of Lukasiewicz's logic in the product logic (both

Embedding logics into product logic. Abstract. We construct a faithful interpretation of Lukasiewicz's logic in the product logic (both 1 Embedding logics into product logic Matthias Baaz Petr Hajek Jan Krajcek y David Svejda Abstract We construct a faithful interpretation of Lukasiewicz's logic in the product logic (both propositional

More information

Modeling User s Cognitive Dynamics in Information Access and Retrieval using Quantum Probability (ESR-6)

Modeling User s Cognitive Dynamics in Information Access and Retrieval using Quantum Probability (ESR-6) Modeling User s Cognitive Dynamics in Information Access and Retrieval using Quantum Probability (ESR-6) SAGAR UPRETY THE OPEN UNIVERSITY, UK QUARTZ Mid-term Review Meeting, Padova, Italy, 07/12/2018 Self-Introduction

More information

Extending DPLL-Based QBF Solvers to Handle Free Variables

Extending DPLL-Based QBF Solvers to Handle Free Variables Extending DPLL-Based QBF Solvers to Handle Free Variables Will Klieber, Mikoláš Janota, Joao Marques-Silva, Edmund Clarke July 9, 2013 1 Open QBF Closed QBF: All variables quantified; answer is True or

More information

Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.

Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19. Intelligent Agents First Order Logic Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University last change: 19. Mai 2015 U. Schmid (CogSys) Intelligent Agents last change: 19. Mai 2015

More information

Overview, cont. Overview, cont. Logistics. Optional Reference #1. Optional Reference #2. Workload and Grading

Overview, cont. Overview, cont. Logistics. Optional Reference #1. Optional Reference #2. Workload and Grading Course staff CS389L: Automated Logical Reasoning Lecture 1: ntroduction and Review of Basics şıl Dillig nstructor: şil Dillig E-mail: isil@cs.utexas.edu Office hours: Thursday after class until 6:30 pm

More information

Labelled Calculi for Łukasiewicz Logics

Labelled Calculi for Łukasiewicz Logics Labelled Calculi for Łukasiewicz Logics D. Galmiche and Y. Salhi LORIA UHP Nancy 1 Campus Scientifique, BP 239 54 506 Vandœuvre-lès-Nancy, France Abstract. In this paper, we define new decision procedures

More information

Model Theory of Modal Logic Lecture 1: A brief introduction to modal logic. Valentin Goranko Technical University of Denmark

Model Theory of Modal Logic Lecture 1: A brief introduction to modal logic. Valentin Goranko Technical University of Denmark Model Theory of Modal Logic Lecture 1: A brief introduction to modal logic Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, 25 January, 2010

More information

Developing Modal Tableaux and Resolution Methods via First-Order Resolution

Developing Modal Tableaux and Resolution Methods via First-Order Resolution Developing Modal Tableaux and Resolution Methods via First-Order Resolution Renate Schmidt University of Manchester Reference: Advances in Modal Logic, Vol. 6 (2006) Modal logic: Background Established

More information

Two-Valued Logic Programs

Two-Valued Logic Programs Two-Valued Logic Programs Vladimir Lifschitz University of Texas at Austin, USA Abstract We define a nonmonotonic formalism that shares some features with three other systems of nonmonotonic reasoning

More information

Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription

Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikoláš Janota 1, Radu Grigore 2, and Joao Marques-Silva 3 1 INESC-ID, Lisbon, Portugal 2 Queen Mary, University

More information

Preface to the First Edition. xxvii 0.1 Set-theoretic Notation xxvii 0.2 Proof by Induction xxix 0.3 Equivalence Relations and Equivalence Classes xxx

Preface to the First Edition. xxvii 0.1 Set-theoretic Notation xxvii 0.2 Proof by Induction xxix 0.3 Equivalence Relations and Equivalence Classes xxx Table of Preface to the First Edition Preface to the Second Edition page xvii xxi Mathematical Prolegomenon xxvii 0.1 Set-theoretic Notation xxvii 0.2 Proof by Induction xxix 0.3 Equivalence Relations

More information

Proof-Theoretic Analysis of the Quantified Argument Calculus

Proof-Theoretic Analysis of the Quantified Argument Calculus Proof-Theoretic Analysis of the Quantified Argument Calculus Edi Pavlovic Central European University, Budapest #IstandwithCEU PhDs in Logic IX May 2-4 2017, RUB Edi Pavlovic (CEU) Proof-Theoretic Analysis

More information

ON THE AXIOMATIC SYSTEMS OF SYNTACTICALLY-CATEGORIAL LANGUAGES

ON THE AXIOMATIC SYSTEMS OF SYNTACTICALLY-CATEGORIAL LANGUAGES Bulletin of the Section of Logic Volume 13/4 (1984), pp. 241 249 reedition 2008 [original edition, pp. 241 251] Urszula Wybraniec-Skardowska ON THE AXIOMATIC SYSTEMS OF SYNTACTICALLY-CATEGORIAL LANGUAGES

More information

COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning

COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms

More information

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

Automata Theory. Definition. Computational Complexity Theory. Computability Theory Outline THEORY OF COMPUTATION CS363, SJTU What is Theory of Computation? History of Computation Branches and Development Xiaofeng Gao Dept. of Computer Science Shanghai Jiao Tong University 2 The Essential

More information

Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask

Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Set 6: Knowledge Representation: The Propositional Calculus Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Outline Representing knowledge using logic Agent that reason logically A knowledge based agent Representing

More information

Proof Complexity of Propositional Default Logic

Proof Complexity of Propositional Default Logic Proof Complexity of Propositional Default Logic Olaf Beyersdorff 1, Arne Meier 2, Sebastian Müller 3, Michael Thomas 2, and Heribert Vollmer 2 1 Institute of Computer Science, Humboldt University Berlin,

More information

A Sequent Calculus for Skeptical Reasoning in Autoepistemic Logic

A Sequent Calculus for Skeptical Reasoning in Autoepistemic Logic A Sequent Calculus for Skeptical Reasoning in Autoepistemic Logic Robert Saxon Milnikel Kenyon College, Gambier OH 43022 USA milnikelr@kenyon.edu Abstract A sequent calculus for skeptical consequence in

More information

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität Freiburg Contents 1 Agents

More information

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016

More information

CS 4700: Foundations of Artificial Intelligence

CS 4700: Foundations of Artificial Intelligence CS 4700: Foundations of Artificial Intelligence Bart Selman selman@cs.cornell.edu Module: Knowledge, Reasoning, and Planning Part 2 Logical Agents R&N: Chapter 7 1 Illustrative example: Wumpus World (Somewhat

More information

Dismatching and Local Disunification in EL

Dismatching and Local Disunification in EL Dismatching and Local Disunification in EL (Extended Abstract) Franz Baader, Stefan Borgwardt, and Barbara Morawska Theoretical Computer Science, TU Dresden, Germany {baader,stefborg,morawska}@tcs.inf.tu-dresden.de

More information

Declarative Merging of and Reasoning about Decision Diagrams

Declarative Merging of and Reasoning about Decision Diagrams Declarative Merging of and Reasoning about Decision Diagrams Thomas Eiter Thomas Krennwallner Christoph Redl {eiter,tkren,redl}@kr.tuwien.ac.at September 12, 2011 Eiter T., Krennwallner T., Redl C. (TU

More information

Introduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010

Introduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Introduction to Artificial Intelligence Propositional Logic & SAT Solving UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Today Representation in Propositional Logic Semantics & Deduction

More information

From Syllogism to Common Sense

From Syllogism to Common Sense From Syllogism to Common Sense Mehul Bhatt Oliver Kutz Thomas Schneider Department of Computer Science & Research Center on Spatial Cognition (SFB/TR 8) University of Bremen Normal Modal Logic K r i p

More information

MAI0203 Lecture 7: Inference and Predicate Calculus

MAI0203 Lecture 7: Inference and Predicate Calculus MAI0203 Lecture 7: Inference and Predicate Calculus Methods of Artificial Intelligence WS 2002/2003 Part II: Inference and Knowledge Representation II.7 Inference and Predicate Calculus MAI0203 Lecture

More information

Computation and Inference

Computation and Inference Computation and Inference N. Shankar Computer Science Laboratory SRI International Menlo Park, CA July 13, 2018 Length of the Longest Increasing Subsequence You have a sequence of numbers, e.g., 9, 7,

More information

Computer-Checked Meta-Logic

Computer-Checked Meta-Logic 1 PART Seminar 25 February 2015 Computer-Checked Meta-Logic Jørgen Villadsen jovi@dtu.dk Abstract Over the past decades there have been several impressive results in computer-checked meta-logic, including

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

On the Logic and Computation of Partial Equilibrium Models

On the Logic and Computation of Partial Equilibrium Models On the Logic and Computation of Partial Equilibrium Models Pedro Cabalar 1, Sergei Odintsov 2, David Pearce 3 and Agustín Valverde 4 1 Corunna University (Corunna, Spain), cabalar@dc.fi.udc.es 2 Sobolev

More information

Non-classical Logics: Theory, Applications and Tools

Non-classical Logics: Theory, Applications and Tools Non-classical Logics: Theory, Applications and Tools Agata Ciabattoni Vienna University of Technology (TUV) Joint work with (TUV): M. Baaz, P. Baldi, B. Lellmann, R. Ramanayake,... N. Galatos (US), G.

More information

A formal system for quantum communication environments 1. Author(s): Anderson de Araújo Marcelo Finger

A formal system for quantum communication environments 1. Author(s): Anderson de Araújo Marcelo Finger A formal system for quantum communication environments 1 Author(s): Anderson de Araújo Marcelo Finger 1 This work was supported by Fapesp Project LogProb, grant 2008/03995-5, São Paulo, Brazil. A formal

More information

COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati"

COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning  Hanna Kurniawati COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati" Last week" Main components of PRM" Collision check for a configuration"

More information

Probabilistic and Logistic Circuits: A New Synthesis of Logic and Machine Learning

Probabilistic and Logistic Circuits: A New Synthesis of Logic and Machine Learning Probabilistic and Logistic Circuits: A New Synthesis of Logic and Machine Learning Guy Van den Broeck KULeuven Symposium Dec 12, 2018 Outline Learning Adding knowledge to deep learning Logistic circuits

More information