Rfuzzy: An expressive simple fuzzy compiler

Size: px
Start display at page:

Download "Rfuzzy: An expressive simple fuzzy compiler"

Transcription

1 Rfuzzy: An expressive simple fuzzy compiler Víctor Pablos Ceruelo, Susana Muñoz-Hernandez and Hannes Straß Babel Group, Facultad de Informática Universidad Politécnica de Madrid (T.U. of Madrid), Spain IWANN 2009, Salamanca, Spain VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 1 / 13

2 Motivation (I): What can we model by using Rfuzzy? We are able to model Credibility and Fuzziness. Example of rule: IF cloudy THEN i t m a y r a i n Credibility: Consider that it is cloudy. How much do we trust the rule that says that it may rain? Fuzziness: How much cloudy is it? Can we see the sun? We have different degrees. VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 2 / 13

3 Motivation (II): Rfuzzy vs Fuzzy Prolog How Rfuzzy reduces Fuzzy Prolog complexity Uses real numbers instead of intervals between real numbers to represent truth values. Answers queries with direct values instead of constraints. Programmer does not have to code variables to manage truth values. How Rfuzzy increases Fuzzy Prolog expressiveness Defines a types extension to limit the set of valid individuals. Allows to define default truth values for subsets of individuals. We do not compare Rfuzzy with other approaches that substitute the SLD-resolution with a fuzzy variant that is able to handle partial truth. The main advantage of our proposal over them is that we can reuse thousands of existing lines of prolog code, and mix fuzzy with crisp resolution. VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 3 / 13

4 Rfuzzy syntax example I % t y p e d e f o f 1 s t argument o f p r e d i c a t e young : s e t p r o p young/1 person /1. person ( john ). person ( mike ). person ( marcus ). person ( hannes ). person ( susana ). person ( v i c t o r ). % d e f a u l t and c o n c r e t e t r u t h v a l u e s d e c l : d e f a u l t ( young /1, 0). % d e f a u l t : Nobody % i s young young ( john ) value % He i s 11 y e a r s old. young ( mike ) value % He i s 15 y e a r s old. VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 4 / 13

5 Rfuzzy syntax example II teenager age : d e f a u l t ( teenager /1, 0). % f u n c t i o n t r u t h v a l u e d e c l a r a t i o n teenager :# ([ (9, 0), (10, 1), (19, 1), (20, 0) ]). VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 5 / 13

6 Rfuzzy syntax example III : d e f a u l t ( teenager /1, 0). teenager :# ([ (9, 0), (10, 1), (19, 1), (20, 0) ]). : d e f a u l t ( c h i l d /1, 0). c h i l d :# ([ (0, 1), (10, 1), (12, 0) ]). : d e f a u l t ( young /1, 0). young (P) cred (min, 0.3) : max c h i l d (P), teenager (P). % Every one i s young with a t v o f 0.3 Available aggregation operators: minimum, maximum, (inverse) product, (inverse) Lukasiewicz operator. VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 6 / 13

7 Rfuzzy syntax example IV % Susana s a y s t h a t she i s s t i l l young... young ( susana ) value % But the f a c t i s t h a t a l l the authors are s t i l l % young. ( the p r e v i o u s d e c l a r a t i o n i s removed ) % C o n d i t i o n a l t r u t h v a l u e d e c l a r a t i o n : d e f a u l t ( young /1, 0.7) paper author /1. paper author ( susana ). paper author ( hannes ). paper author ( v i c t o r ). % P r e v i o u s d e f and d e c l o f young : d e f a u l t ( young /1, 0). young (P) cred (min, 0.3) : max c h i l d (P), teenager (P). VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 7 / 13

8 Queries, Answers and Constructivity On compilation we add a new argument ( V is the truth value arg) % non c o n s t r u c t i v e % c o n s t r u c t i v e? young ( hannes, V).? young (X, V), V V = 0.7? ; V = 0.9, X = john? ; no V = 0.8, X = mike? ; no We say that it is constructive because it does not return a constraint X susana, hannes, victor, marcus. Instead of that it returns the valid values in a Prolog way (i.e. one by one). When looking for the truth value of an individual Rfuzzy returns only one truth value, and it is always the most concrete truth value declared in the program. VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 8 / 13

9 Rfuzzy Implementation The global compilation process has two preprocessor steps: 1 the Rfuzzy program is translated into CLP(R) constraints by means of the Rfuzzy package and 2 those constraints are translated into ISO Prolog by using the CLP(R) package. RFuzzy program RFuzzy package preprocessing CLP(R) program CLP(R) package preprocessing ISO Prolog program Y We do not create a new SLD-resolution. Instead of that we use prolog SLD resolution. This allows us to mix prolog code with fuzzy prolog code, and reuse a lot of prolog existing code. VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 9 / 13

10 Example: MYCIN can be modelled by using Rfuzzy IF The s t a i n of the organism i s Gram negative, AND The morphology o f the organism i s rod, AND The a e r o b i c i t y of the organism i s a e r o b i c THEN There i s s t r o n g l y s u g g e s t i v e evidence ( 0. 8 ) t h a t the c l a s s of the organism i s E n t e r o b a c t e r i a c e a e Rules have credibility and facts have a truth value. CF( s t a i n = gram negative ) = CF( morphology = rod ) = CF( a e r o b i c i t y = a e r o b i c ) = 0.4. VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 10 / 13

11 Conclusions Rfuzzy offers to the users a new framework to represent fuzzy problems over real numbers. Main Rfuzzy advantages over Fuzzy Prolog are a simpler syntax and the elimination of answers with constraints. Its fuzzy values are simple real numbers instead of intervals between real numbers, it hides the management of truth value variables and as it does not answer queries with constraints, answers are always ground terms. This is a more human-readable way of answering questions and it can be used in web forms (constraints can not be used there). Applications: Search Engines, Knowledge Extraction (from databases, ontologies, etc.), Semantic Web, Business Rules, Coding Rules (where the violation of one rule can be given a truth value), etc. VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 11 / 13

12 Current work? young (X, V). Apply constructive negation to the engine, but first we have to find the correct semantics. What do we want to obtain when we make a query like this one? Have fuzzy relations in the Semantic Web, allowing the user to represent not only who is young or not but the fact that the authors of this paper belong to the young set with a truth value of VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 12 / 13

13 Questions VPC, SMH, HS (Babel Group, UPM, Spain) Rfuzzy Framework IWANN 09, Salamanca 13 / 13

Knowledge Representation. Propositional logic.

Knowledge Representation. Propositional logic. CS 1571 Introduction to AI Lecture 10 Knowledge Representation. Propositional logic. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 3 due today Homework assignment

More information

Fuzzy Answer Set semantics for Residuated Logic programs

Fuzzy Answer Set semantics for Residuated Logic programs semantics for Logic Nicolás Madrid & Universidad de Málaga September 23, 2009 Aims of this paper We are studying the introduction of two kinds of negations into residuated : Default negation: This negation

More information

Where are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples

Where are we? Operations on fuzzy sets (cont.) Fuzzy Logic. Motivation. Crisp and fuzzy sets. Examples Operations on fuzzy sets (cont.) G. J. Klir, B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice-Hall, chapters -5 Where are we? Motivation Crisp and fuzzy sets alpha-cuts, support,

More information

AI Programming CS S-09 Knowledge Representation

AI Programming CS S-09 Knowledge Representation AI Programming CS662-2013S-09 Knowledge Representation David Galles Department of Computer Science University of San Francisco 09-0: Overview So far, we ve talked about search, which is a means of considering

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

Knowledge Representation. Propositional logic

Knowledge Representation. Propositional logic CS 2710 Foundations of AI Lecture 10 Knowledge Representation. Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Knowledge-based agent Knowledge base Inference engine Knowledge

More information

Predicting Neighbor Goodness in Collaborative Filtering

Predicting Neighbor Goodness in Collaborative Filtering Predicting Neighbor Goodness in Collaborative Filtering Alejandro Bellogín and Pablo Castells {alejandro.bellogin, pablo.castells}@uam.es Universidad Autónoma de Madrid Escuela Politécnica Superior Introduction:

More information

A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions

A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions Fernando Bobillo Miguel Delgado Juan Gómez-Romero Department of Computer Science and Artificial Intelligence University

More information

Fuzzy Propositional Formulas under the Stable Model Semantics

Fuzzy Propositional Formulas under the Stable Model Semantics Fuzzy Propositional Formulas under the Stable Model Semantics Joohyung Lee School of Computing, Informatics, and Decision Systems Engineering Arizona State University, Tempe, USA joolee@asu.edu Yi Wang

More information

CS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration

CS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration Lecture 4 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square dministration Homework assignment 1 is out Due next week on Wednesday, September 17 Problems: LISP programming a PL

More information

Knowledge Representation and Reasoning (Logic) George Konidaris

Knowledge Representation and Reasoning (Logic) George Konidaris Knowledge Representation and Reasoning (Logic) George Konidaris gdk@cs.brown.edu Fall 2018 Knowledge Representation and Reasoning Represent knowledge about the world. Representation language. Knowledge

More information

Brief Introduction to Prolog

Brief Introduction to Prolog Brief to Prolog Joana Côrte-Real jcr@dcc.fc.up.pt CRACS & INESC TEC Faculty of Sciences University of Porto University of Aizu 5th December 2014 1 / 27 Overview 1 to Prolog Prolog Syntax Tutorial 1 2 Lists

More information

COMP2411 Lecture 10: Propositional Logic Programming. Note: This material is not covered in the book. Resolution Applied to Horn Clauses

COMP2411 Lecture 10: Propositional Logic Programming. Note: This material is not covered in the book. Resolution Applied to Horn Clauses COMP2411 Lecture 10: Propositional Logic Programming Note: This material is not covered in the book Consider two Horn clauses Resolution Applied to Horn Clauses p p 1... p n and q q 1... q m Suppose these

More information

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system): Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building

More information

Knowledge-Based Systems and Deductive Databases

Knowledge-Based Systems and Deductive Databases Knowledge-Based Systems and Deductive Databases Wolf-Tilo Balke Christoph Lofi Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 10 Expert Systems 10.1 Expert

More information

Uncertainty and Rules

Uncertainty and Rules Uncertainty and Rules We have already seen that expert systems can operate within the realm of uncertainty. There are several sources of uncertainty in rules: Uncertainty related to individual rules Uncertainty

More information

Probabilistic Logic CNF for Reasoning

Probabilistic Logic CNF for Reasoning Probabilistic Logic CNF for Reasoning Song- Chun Zhu, Sinisa Todorovic, and Ales Leonardis At CVPR, Providence, Rhode Island June 16, 2012 Goal input tracking parsing reasoning activity recognition in

More information

Propositional Logic: Review

Propositional Logic: Review Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or

More information

Logic. Stephen G. Ware CSCI 4525 / 5525

Logic. Stephen G. Ware CSCI 4525 / 5525 Logic Stephen G. Ware CSCI 4525 / 5525 Logic How can we represent knowledge about the world in a general, reusable way? How can we use existing knowledge to gain new knowledge? Problem Solving Approaches

More information

A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System

A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System 1 / 31 A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System Judy Zhao 1, Harold Boley 2, Weichang Du 1 1. Faculty of Computer Science, University

More information

Realizing Default Logic over Description Logic Knowledge Bases. Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner

Realizing Default Logic over Description Logic Knowledge Bases. Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner Realizing Default Logic over Description Logic Knowledge Bases Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner KBS Group, Institute of Information Systems, Vienna University of Technology ECSQARU 2009

More information

Computational Logic Fundamentals (of Definite Programs): Syntax and Semantics

Computational Logic Fundamentals (of Definite Programs): Syntax and Semantics Computational Logic Fundamentals (of Definite Programs): Syntax and Semantics 1 Towards Logic Programming Conclusion: resolution is a complete and effective deduction mechanism using: Horn clauses (related

More information

Designing and Evaluating Generic Ontologies

Designing and Evaluating Generic Ontologies Designing and Evaluating Generic Ontologies Michael Grüninger Department of Industrial Engineering University of Toronto gruninger@ie.utoronto.ca August 28, 2007 1 Introduction One of the many uses of

More information

Logic. (Propositional Logic)

Logic. (Propositional Logic) Logic (Propositional Logic) 1 REPRESENTING KNOWLEDGE: LOGIC Logic is the branch of mathematics / philosophy concerned with knowledge and reasoning Aristotle distinguished between three types of arguments:

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

Discrete Mathematics

Discrete Mathematics Discrete Mathematics Discrete mathematics is devoted to the study of discrete or distinct unconnected objects. Classical mathematics deals with functions on real numbers. Real numbers form a continuous

More information

15414/614 Optional Lecture 1: Propositional Logic

15414/614 Optional Lecture 1: Propositional Logic 15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,

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

Gödel Negation Makes Unwitnessed Consistency Crisp

Gödel Negation Makes Unwitnessed Consistency Crisp Gödel Negation Makes Unwitnessed Consistency Crisp Stefan Borgwardt, Felix Distel, and Rafael Peñaloza Faculty of Computer Science TU Dresden, Dresden, Germany [stefborg,felix,penaloza]@tcs.inf.tu-dresden.de

More information

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning. 3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on

More information

Logical Inference. Artificial Intelligence. Topic 12. Reading: Russell and Norvig, Chapter 7, Section 5

Logical Inference. Artificial Intelligence. Topic 12. Reading: Russell and Norvig, Chapter 7, Section 5 rtificial Intelligence Topic 12 Logical Inference Reading: Russell and Norvig, Chapter 7, Section 5 c Cara MacNish. Includes material c S. Russell & P. Norvig 1995,2003 with permission. CITS4211 Logical

More information

VARIABLE-STRENGTH CONDITIONAL PREFERENCES FOR RANKING OBJECTS IN ONTOLOGIES

VARIABLE-STRENGTH CONDITIONAL PREFERENCES FOR RANKING OBJECTS IN ONTOLOGIES I N F S Y S R E S E A R C H R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ARBEITSBEREICH WISSENSBASIERTE SYSTEME VARIABLE-STRENGTH CONDITIONAL PREFERENCES FOR RANKING OBJECTS IN ONTOLOGIES THOMAS LUKASIEWICZ

More information

Semantics and Inference for Probabilistic Ontologies

Semantics and Inference for Probabilistic Ontologies Semantics and Inference for Probabilistic Ontologies Fabrizio Riguzzi, Elena Bellodi, Evelina Lamma, and Riccardo Zese ENDIF University of Ferrara, Italy, email: {fabrizio.riguzzi, elena.bellodi, evelina.lamma}@unife.it,

More information

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

Semantic Web SPARQL. Gerd Gröner, Matthias Thimm. July 16,

Semantic Web SPARQL. Gerd Gröner, Matthias Thimm. July 16, Semantic Web SPARQL Gerd Gröner, Matthias Thimm {groener,thimm}@uni-koblenz.de Institute for Web Science and Technologies (WeST) University of Koblenz-Landau July 16, 2013 Gerd Gröner, Matthias Thimm Semantic

More information

Methods of Partial Logic for Knowledge Representation and Deductive Reasoning in Incompletely Specified Domains

Methods of Partial Logic for Knowledge Representation and Deductive Reasoning in Incompletely Specified Domains Methods of Partial Logic for Knowledge Representation and Deductive Reasoning in Incompletely Specified Domains Anatoly Prihozhy and Liudmila Prihozhaya Information Technologies and Robotics Department,

More information

Propositional and First-Order Logic

Propositional and First-Order Logic Propositional and First-Order Logic Chapter 7.4 7.8, 8.1 8.3, 8.5 Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer Logic roadmap overview Propositional logic (review) Problems with

More information

Expert Systems! Knowledge Based Systems!

Expert Systems! Knowledge Based Systems! Expert Systems Knowledge Based Systems ES-1 Medical diagnosis» Disease identification Example Areas of Use ES-2 Example Areas of Use 2 Medical diagnosis» Disease identification Natural resource exploration»

More information

Chapter 2: Basic Notions of Predicate Logic

Chapter 2: Basic Notions of Predicate Logic 2. Basic Notions of Predicate Logic 2-1 Deductive Databases and Logic Programming (Winter 2009/2010) Chapter 2: Basic Notions of Predicate Logic Signature, Formula Interpretation, Model Implication, Consistency,

More information

Advanced Topics in LP and FP

Advanced Topics in LP and FP Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection

More information

Expert Systems! Knowledge Based Systems!

Expert Systems! Knowledge Based Systems! Expert Systems Knowledge Based Systems ES-1 Medical diagnosis» Disease identification Example Areas of Use ES-2 Example Areas of Use 2 Medical diagnosis» Disease identification Natural resource exploration»

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence CS482, CS682, MW 1 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis, sushil@cse.unr.edu, http://www.cse.unr.edu/~sushil Logic Logical Agents Truth tables you

More information

Well-Supported Semantics for Description Logic Programs

Well-Supported Semantics for Description Logic Programs Well-Supported Semantics for Description Logic Programs Yi-Dong Shen Institute of Software, Chinese Academy of Sciences, Beijing, China http://lcs.ios.ac.cn/~ydshen IJCAI 2011, Barcelona, Spain Outline

More information

Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories

Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories Jeroen Janssen 1, Stijn Heymans 2, Dirk Vermeir 1, and Martine De Cock 2 1 Dept. of Computer Science, Vrije Universiteit Brussel {jeroen.janssen,dvermeir}@vub.ac.be

More information

KU Leuven Department of Computer Science

KU Leuven Department of Computer Science Implementation and Performance of Probabilistic Inference Pipelines: Data and Results Dimitar Shterionov Gerda Janssens Report CW 679, March 2015 KU Leuven Department of Computer Science Celestijnenlaan

More information

Definite Logic Programs

Definite Logic Programs Chapter 2 Definite Logic Programs 2.1 Definite Clauses The idea of logic programming is to use a computer for drawing conclusions from declarative descriptions. Such descriptions called logic programs

More information

OUTLINE. Introduction History and basic concepts. Fuzzy sets and fuzzy logic. Fuzzy clustering. Fuzzy inference. Fuzzy systems. Application examples

OUTLINE. Introduction History and basic concepts. Fuzzy sets and fuzzy logic. Fuzzy clustering. Fuzzy inference. Fuzzy systems. Application examples OUTLINE Introduction History and basic concepts Fuzzy sets and fuzzy logic Fuzzy clustering Fuzzy inference Fuzzy systems Application examples "So far as the laws of mathematics refer to reality, they

More information

CS 4110 Programming Languages & Logics. Lecture 16 Programming in the λ-calculus

CS 4110 Programming Languages & Logics. Lecture 16 Programming in the λ-calculus CS 4110 Programming Languages & Logics Lecture 16 Programming in the λ-calculus 30 September 2016 Review: Church Booleans 2 We can encode TRUE, FALSE, and IF, as: TRUE λx. λy. x FALSE λx. λy. y IF λb.

More information

QSQL: Incorporating Logic-based Retrieval Conditions into SQL

QSQL: Incorporating Logic-based Retrieval Conditions into SQL QSQL: Incorporating Logic-based Retrieval Conditions into SQL Sebastian Lehrack and Ingo Schmitt Brandenburg University of Technology Cottbus Institute of Computer Science Chair of Database and Information

More information

Propositional Logic Part 1

Propositional Logic Part 1 Propositional Logic Part 1 Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Louis Oliphant, Andrew Moore, Jerry Zhu] slide 1 5 is even

More information

Insights from Web 3.0: Is it Time for a New Scientific Publishing Methodology?

Insights from Web 3.0: Is it Time for a New Scientific Publishing Methodology? Insights from Web 3.0: Is it Time for a New Scientific Publishing Methodology? Markus Schatten, Mirko Maleković University of Zagreb Faculty of Organization and Informatics Pavlinska 2, 42000 Varaždin,

More information

Franz J. Kurfess Computer Science Department California Polytechnic State University San Luis Obispo, CA, U.S.A.

Franz J. Kurfess Computer Science Department California Polytechnic State University San Luis Obispo, CA, U.S.A. CPE/CSC 481: Knowledge-Based Systems Franz J. Kurfess Computer Science Department California Polytechnic State University San Luis Obispo, CA, U.S.A. Usage of the Slides these slides are intended for the

More information

Deciding Equivalence between Extended Datalog Programs. A Brief Survey.

Deciding Equivalence between Extended Datalog Programs. A Brief Survey. Deciding Equivalence between Extended Datalog Programs. A Brief Survey. Stefan Woltran Technische Universität Wien A-1040 Vienna, Austria Joint work with: Thomas Eiter, Wolfgang Faber, Michael Fink, Hans

More information

Chapter 16. Logic Programming. Topics. Logic Programming. Logic Programming Paradigm

Chapter 16. Logic Programming. Topics. Logic Programming. Logic Programming Paradigm Topics Chapter 16 Logic Programming Introduction Predicate Propositions Clausal Form Horn 2 Logic Programming Paradigm AKA Declarative Paradigm The programmer Declares the goal of the computation (specification

More information

Logic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001

Logic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Logic Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Last Lecture Games Cont. α-β pruning Outline Games with chance, e.g. Backgammon Logical Agents and thewumpus World

More information

Propositional Logic: Logical Agents (Part I)

Propositional Logic: Logical Agents (Part I) Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Hybrid Rules with Well-Founded Semantics

Hybrid Rules with Well-Founded Semantics Hybrid Rules with Well-Founded Semantics W lodzimierz Drabent Jan Ma luszyński arxiv:0906.3815v1 [cs.lo] 20 Jun 2009 March 13, 2009 Submitted for publication Abstract A general framework is proposed for

More information

7 RC Simulates RA. Lemma: For every RA expression E(A 1... A k ) there exists a DRC formula F with F V (F ) = {A 1,..., A k } and

7 RC Simulates RA. Lemma: For every RA expression E(A 1... A k ) there exists a DRC formula F with F V (F ) = {A 1,..., A k } and 7 RC Simulates RA. We now show that DRC (and hence TRC) is at least as expressive as RA. That is, given an RA expression E that mentions at most C, there is an equivalent DRC expression E that mentions

More information

Reasoning under Uncertainty: Intro to Probability

Reasoning under Uncertainty: Intro to Probability Reasoning under Uncertainty: Intro to Probability Computer Science cpsc322, Lecture 24 (Textbook Chpt 6.1, 6.1.1) Nov, 2, 2012 CPSC 322, Lecture 24 Slide 1 Tracing Datalog proofs in AIspace You can trace

More information

It rains now. (true) The followings are not propositions.

It rains now. (true) The followings are not propositions. Chapter 8 Fuzzy Logic Formal language is a language in which the syntax is precisely given and thus is different from informal language like English and French. The study of the formal languages is the

More information

On flexible database querying via extensions to fuzzy sets

On flexible database querying via extensions to fuzzy sets On flexible database querying via extensions to fuzzy sets Guy de Tré, Rita de Caluwe Computer Science Laboratory Ghent University Sint-Pietersnieuwstraat 41, B-9000 Ghent, Belgium {guy.detre,rita.decaluwe}@ugent.be

More information

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017 3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,

More information

Fuzzy Propositional Logic for the Knowledge Representation

Fuzzy Propositional Logic for the Knowledge Representation Fuzzy Propositional Logic for the Knowledge Representation Alexander Savinov Institute of Mathematics Academy of Sciences Academiei 5 277028 Kishinev Moldova (CIS) Phone: (373+2) 73-81-30 EMAIL: 23LSII@MATH.MOLDOVA.SU

More information

A Framework for Representing Ontology Mappings under Probabilities and Inconsistency

A Framework for Representing Ontology Mappings under Probabilities and Inconsistency A Framework for Representing Ontology Mappings under Probabilities and Inconsistency Andrea Calì 1 Thomas Lukasiewicz 2, 3 Livia Predoiu 4 Heiner Stuckenschmidt 4 1 Computing Laboratory, University of

More information

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final exam Logic & Set Theory (2IT61) (correction model)

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final exam Logic & Set Theory (2IT61) (correction model) TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica Final exam Logic & Set Theory (2IT61) (correction model) Thursday November 4, 2016, 9:00 12:00 hrs. (2) 1. Determine whether the abstract

More information

SPARQL Extensions and Outlook

SPARQL Extensions and Outlook SPARQL Extensions and Outlook Axel Polleres 1 1 DERI Galway, National University of Ireland, Galway axel.polleres@deri.org European Semantic Web Conference 2007 A. Polleres SPARQL Extensions and Outlook

More information

Markov Logic Networks. November 24, 2009 CS 486/686 University of Waterloo

Markov Logic Networks. November 24, 2009 CS 486/686 University of Waterloo Markov Logic Networks November 24, 2009 CS 486/686 University of Waterloo Outline Markov Logic Networks Alchemy Readings: Matt Richardson and Pedro Domingos (2006), Markov Logic Networks, Machine Learning,

More information

HANDLING UNCERTAINTY IN INFORMATION EXTRACTION

HANDLING UNCERTAINTY IN INFORMATION EXTRACTION HANDLING UNCERTAINTY IN INFORMATION EXTRACTION Maurice van Keulen and Mena Badieh Habib URSW 23 Oct 2011 INFORMATION EXTRACTION Unstructured Text Information extraction Web of Data Inherently imperfect

More information

The non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω

The non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω 1 Preliminaries In this chapter we first give a summary of the basic notations, terminology and results which will be used in this thesis. The treatment here is reduced to a list of definitions. For the

More information

Predicate Logic: Introduction and Translations

Predicate Logic: Introduction and Translations Predicate Logic: Introduction and Translations Alice Gao Lecture 10 Based on work by J. Buss, L. Kari, A. Lubiw, B. Bonakdarpour, D. Maftuleac, C. Roberts, R. Trefler, and P. Van Beek 1/29 Outline Predicate

More information

Infinitary Equilibrium Logic and Strong Equivalence

Infinitary Equilibrium Logic and Strong Equivalence Infinitary Equilibrium Logic and Strong Equivalence Amelia Harrison 1 Vladimir Lifschitz 1 David Pearce 2 Agustín Valverde 3 1 University of Texas, Austin, Texas, USA 2 Universidad Politécnica de Madrid,

More information

Inducing syntactic cut-elimination for indexed nested sequents

Inducing syntactic cut-elimination for indexed nested sequents Inducing syntactic cut-elimination for indexed nested sequents Revantha Ramanayake Technische Universität Wien (Austria) IJCAR 2016 June 28, 2016 Revantha Ramanayake (TU Wien) Inducing syntactic cut-elimination

More information

A CLASSIFICATION METHOD BASED ON INDISTINGUISHABILITIES

A CLASSIFICATION METHOD BASED ON INDISTINGUISHABILITIES A CLASSIFICATION METHOD BASED ON INDISTINGUISHABILITIES Luis Garmendia E.T.S.I. Caminos Dpto. de Matemática Aplicada. and IBM Learning Services. luisgarmendia@es.ibm.com Adela Salvador E.T.S.I. Caminos

More information

Proving Security Protocols Correct. Lawrence C. Paulson Computer Laboratory

Proving Security Protocols Correct. Lawrence C. Paulson Computer Laboratory Proving Security Protocols Correct Lawrence C. Paulson Computer Laboratory How Detailed Should a Model Be? too detailed too simple concrete abstract not usable not credible ``proves'' everything ``attacks''

More information

DESCRIPTION LOGICS. Paula Severi. October 12, University of Leicester

DESCRIPTION LOGICS. Paula Severi. October 12, University of Leicester DESCRIPTION LOGICS Paula Severi University of Leicester October 12, 2009 Description Logics Outline Introduction: main principle, why the name description logic, application to semantic web. Syntax and

More information

CS560 Knowledge Discovery and Management. CS560 - Lecture 3 1

CS560 Knowledge Discovery and Management. CS560 - Lecture 3 1 CS560 Knowledge Discovery and Management Yugi Lee STB #560D (816) 235-5932 leeyu@umkc.edu www.sce.umkc.edu/~leeyu CS560 - Lecture 3 1 Logic A logic allows the axiomatization of the domain information,

More information

Logic Programming Techniques for Reasoning with Probabilistic Ontologies

Logic Programming Techniques for Reasoning with Probabilistic Ontologies Logic Programming Techniques for Reasoning with Probabilistic Ontologies Riccardo Zese, Elena Bellodi, Evelina Lamma and Fabrizio Riguzzi University of Ferrara, Italy riccardo.zese@unife.it Zese, Bellodi,

More information

UML. Design Principles.

UML. Design Principles. .. Babes-Bolyai University arthur@cs.ubbcluj.ro November 20, 2018 Overview 1 2 3 Diagrams Unified Modeling Language () - a standardized general-purpose modeling language in the field of object-oriented

More information

Weighted Abstract Dialectical Frameworks

Weighted Abstract Dialectical Frameworks Weighted Abstract Dialectical Frameworks Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de joint work with H. Strass, J. Wallner, S. Woltran G. Brewka (Leipzig)

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

REASONING UNDER UNCERTAINTY: CERTAINTY THEORY

REASONING UNDER UNCERTAINTY: CERTAINTY THEORY REASONING UNDER UNCERTAINTY: CERTAINTY THEORY Table of Content Introduction Certainty Theory Definition Certainty Theory: Values Interpretation Certainty Theory: Representation Certainty Factor Propagation

More information

CS206 Lecture 21. Modal Logic. Plan for Lecture 21. Possible World Semantics

CS206 Lecture 21. Modal Logic. Plan for Lecture 21. Possible World Semantics CS206 Lecture 21 Modal Logic G. Sivakumar Computer Science Department IIT Bombay siva@iitb.ac.in http://www.cse.iitb.ac.in/ siva Page 1 of 17 Thu, Mar 13, 2003 Plan for Lecture 21 Modal Logic Possible

More information

CS 380: ARTIFICIAL INTELLIGENCE

CS 380: ARTIFICIAL INTELLIGENCE CS 380: RTIFICIL INTELLIGENCE PREDICTE LOGICS 11/8/2013 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2013/cs380/intro.html Summary of last day: Logical gents: The can

More information

Intermediate Logic. Natural Deduction for TFL

Intermediate Logic. Natural Deduction for TFL Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The

More information

Aggregation and Non-Contradiction

Aggregation and Non-Contradiction Aggregation and Non-Contradiction Ana Pradera Dept. de Informática, Estadística y Telemática Universidad Rey Juan Carlos. 28933 Móstoles. Madrid. Spain ana.pradera@urjc.es Enric Trillas Dept. de Inteligencia

More information

Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web

Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web Thomas Lukasiewicz Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Via Salaria 113, I-00198

More information

A Logic Primer. Stavros Tripakis University of California, Berkeley. Stavros Tripakis (UC Berkeley) EE 144/244, Fall 2014 A Logic Primer 1 / 35

A Logic Primer. Stavros Tripakis University of California, Berkeley. Stavros Tripakis (UC Berkeley) EE 144/244, Fall 2014 A Logic Primer 1 / 35 EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2014 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,

More information

4CitySemantics. GIS-Semantic Tool for Urban Intervention Areas

4CitySemantics. GIS-Semantic Tool for Urban Intervention Areas 4CitySemantics GIS-Semantic Tool for Urban Intervention Areas Nuno MONTENEGRO 1 ; Jorge GOMES 2 ; Paulo URBANO 2 José P. DUARTE 1 1 Faculdade de Arquitectura da Universidade Técnica de Lisboa, Rua Sá Nogueira,

More information

LTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07

LTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07 Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity

More information

The PITA System for Logical-Probabilistic Inference

The PITA System for Logical-Probabilistic Inference The System for Logical-Probabilistic Inference Fabrizio Riguzzi 1 and Terrance Swift 2 1 EDIF University of Ferrara, Via Saragat 1, I-44122, Ferrara, Italy fabrizio.riguzzi@unife.it 2 CETRIA Universidade

More information

The underlying structure in Atanassov s IFS

The underlying structure in Atanassov s IFS The underlying structure in Atanassov s IFS J. Montero Facultad de Matemáticas Universidad Complutense Madrid 28040, Spain e-mail: monty@mat.ucm.es D. Gómez Escuela de Estadística Universidad Complutense

More information

Interval Neutrosophic Sets and Logic: Theory and Applications in Computing

Interval Neutrosophic Sets and Logic: Theory and Applications in Computing Georgia State University ScholarWorks @ Georgia State University Computer Science Dissertations Department of Computer Science 1-12-2006 Interval Neutrosophic Sets and Logic: Theory and Applications in

More information

Motivation. From Propositions To Fuzzy Logic and Rules. Propositional Logic What is a proposition anyway? Outline

Motivation. From Propositions To Fuzzy Logic and Rules. Propositional Logic What is a proposition anyway? Outline Harvard-MIT Division of Health Sciences and Technology HST.951J: Medical Decision Support, Fall 2005 Instructors: Professor Lucila Ohno-Machado and Professor Staal Vinterbo Motivation From Propositions

More information

Lecture 1: Geospatial Data Models

Lecture 1: Geospatial Data Models Lecture 1: GEOG413/613 Dr. Anthony Jjumba Introduction Course Outline Journal Article Review Projects (and short presentations) Final Exam (April 3) Participation in class discussions Geog413/Geog613 A

More information

Rule-Based Classifiers

Rule-Based Classifiers Rule-Based Classifiers For completeness, the table includes all 16 possible logic functions of two variables. However, we continue to focus on,,, and. 1 Propositional Logic Meta-theory. Inspection of a

More information

Normal Description Logic Programs as Default Theories

Normal Description Logic Programs as Default Theories Normal Description Logic Programs as Default Theories Yisong Wang Jia-Huai You Liyan Yuan Yi-Dong Shen Nonmon@30 Lexington, Kentucky 1 / 23 Applications of ASP/SAT fall into... 1 Stand alone applications

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

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Description Logics. Foundations of Propositional Logic.   franconi. Enrico Franconi (1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge

More information

Propositional Logic Logical Implication (4A) Young W. Lim 4/11/17

Propositional Logic Logical Implication (4A) Young W. Lim 4/11/17 Propositional Logic Logical Implication (4A) 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

More information