Copyright © 2002 Cycorp The Basics Arity Argument Types Second-Order Predicates More on Functions Predicates and Denotational Functions.

Slides:



Advertisements
Similar presentations
The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.
Advertisements

SCL: A Logic Standard for Semantic Integration Christopher Menzel Philosophy Department Texas A&M University
Copyright © 2002 Cycorp Introduction Fundamental Expression Types Top Level Collections Time and Dates Spatial Properties and Relations Event Types Information.
The Logic of Quantified Statements
Copyright , Doron Peled and Cesare Tinelli. These notes are based on a set of lecture notes originally developed by Doron Peled at the University.
Introduction to PROLOG ME 409 Lab - 1. Introduction to PROLOG.
Relational Algebra Dashiell Fryer. What is Relational Algebra? Relational algebra is a procedural query language. Relational algebra is a procedural query.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
1 Ontology Language Comparisons doug foxvog 16 September 2004.
1 Module 8 Closure Properties –Definition –Language class definition set of languages –Closure properties and first-order logic statements For all, there.
Copyright © 2002 Cycorp Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories Foundations of Knowledge Representation.
Copyright © 2002 Cycorp Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories Foundations of Knowledge Representation.
Overview of Cyc Tom O'Hara NMSU AI Seminar 18 February 2002.
Copyright © 2002 Cycorp Errors with Constants, Variables, and Reliance on NL Errors with Specialization, Generalization, and Rules Other Errors Errors.
Copyright © 2002 Cycorp Logical Aspects of Inference Incompleteness in Searching Incompleteness from Resource Bounds and Continuable Searches Inference.
Copyright © 2002 Cycorp Events in Cyc Roles and Event Predicates Actor Slots Sub-events OE Example: Events and Roles.
Copyright © 2002 Cycorp Errors with Constants, Variables, and Reliance on NL Errors with Specialization, Generalization, and Rules Other Errors Errors.
Copyright © 2002 Cycorp Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories Foundations of Knowledge Representation.
Copyright © 2002 Cycorp Introduction Fundamental Expression Types Top Level Collections Time and Dates Spatial Properties and Relations Event Types Information.
Functions of Several Variables Most goals of economic agents depend on several variables –Trade-offs must be made The dependence of one variable (y) on.
Cyc Seven Differences between Cyc and Frames Systems.
Copyright © 2002 Cycorp Why use logic? CycL Syntax Collections and Individuals (#$isa and #$genls) Microtheories Foundations of Knowledge Representation.
Copyright © 2002 Cycorp The Basics Arity Argument Types Second-Order Predicates More on Functions Predicates and Denotational Functions.
Copyright © 2002 Cycorp Writing Efficient CycL Part 1 Part One –Simpler is Better –Use Rule Macro Predicates –Create Simplifying Vocabulary Part Two –Factor.
Chapter 3: Methods of Inference Expert Systems: Principles and Programming, Fourth Edition.
Copyright © 2002 Cycorp The Basics Arity Argument Types Second-Order Predicates More on Functions Predicates and Denotational Functions.
Parametric Programming For CNC Machining Centers and Turning Centers Copyright 1999 Demo Only!! * Most items restricted * Poor sound quality (minimizes.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Ontology Mapping with Cyc doug foxvog 14 July 2004
Copyright © 2008 Pearson Education, Inc. Chapter 1.
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
Copyright © Peter Cappello Mathematical Induction Goals Explain & illustrate construction of proofs of a variety of theorems using mathematical induction.
Atomic Sentences Chapter 1 Language, Proof and Logic.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Declarative vs Procedural Programming  Procedural programming requires that – the programmer tell the computer what to do. That is, how to get the output.
Chapter P Prerequisites: Fundamental Concepts of Algebra 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1 P.9 Linear Inequalities and Absolute.
Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Common Factors and Factoring by Grouping Terms with Common Factors Factoring.
CSE (c) S. Tanimoto, 2005 Knowledge Representation 1 Knowledge Representation (Introduction) Knowledge Information Data Knowledge representation:
Solving Inequalities. What are Inequations? Statements showing inequalities One quantity or expression is not equal to another.
Copyright © Curt Hill Quantifiers. Copyright © Curt Hill Introduction What we have seen is called propositional logic It includes.
Lambda Expressions Version 1.0
 SOLVE EQUATIONS WITH ABSOLUTE VALUE.  SOLVE INEQUALITIES WITH ABSOLUTE VALUE. Copyright © 2012 Pearson Education, Inc. Publishing as Addison Wesley.
Word Problem Consider the following problem: To register, you will need either a yellow card or a note from the Dean. To obtain a note from the Dean you.
1 Knowledge Based Systems (CM0377) Lecture 6 (last modified 20th February 2002)
The Syntax of CycL. CycL is a formal language whose syntax derives from first-order predicate calculus (the language of formal logic) and from Lisp. In.
Cyc Jaehui Park Summarized by Jaehui Park, IDS Lab., Seoul National University Presented by Jaehui Park, IDS Lab., Seoul National University.
The Art About Statements Chapter 8 “Say what you mean and mean what you say” By Alexandra Swindell Class Four Philosophical Questions.
Operators A binary operator combines two values to get one result: x OP y where OP is any binary operators such as +, -, *, /, ==, !=, >, &&, or even =.
Chapter 3: Methods of Inference
2. The Logic of Compound Statements Summary
Lambda Expressions Version 1.1
CHAPTER 3: Quadratic Functions and Equations; Inequalities
Short Circuits Design Recipe Redux Structures
Predicate Calculus Discussion #14 Chapter 2, Section 1 1/20.
Discussion #14 Predicate Calculus
Chapter 3: Methods of Inference

Copyrights apply.
Predicate Calculus Discussion #14 Chapter 2, Section 1.
Sequences COURSE 3 LESSON 12-1
Solving Equations and Inequalities with Absolute Value
EDLC(Embedded system Development Life Cycle ).
Solving Equations and Inequalities with Absolute Value
Knowledge Representation (Introduction)
Knowledge Representation (Introduction)
Knowledge Representation (Introduction)
Chapter 14 External Memorandum
Predicate Calculus. Predicate Calculus Topics Predicates Variables and instantiation Quantifiers Logical expressions Bound and free variables.
Presentation transcript:

Copyright © 2002 Cycorp The Basics Arity Argument Types Second-Order Predicates More on Functions Predicates and Denotational Functions

Copyright © 2002 Cycorp Second-Order Predicates Sometimes we want to make statements about predicates themselves. This requires “second-order” predicates, which can take predicates as arguments. Examples : #$arg1Isa, #$arity, #$isa Thus in (#$arity #$mother 2), #$arity takes the predicate #$mother as its first argument. Some second-order predicates are used to relate CycL predicates to one another within a predicate hierarchy...

Copyright © 2002 Cycorp #$genlPreds (#$isa #$genlPreds #$BinaryPredicate) (#$arg1Isa #$genlPreds #$Predicate) (#$arg2Isa #$genlPreds #$Predicate) (#$genlPreds ?NARROW-PRED ?WIDE-PRED) means that ?NARROW-PRED is a restricted version of ?WIDE-PRED Any arguments of which ?NARROW-PRED is true are also ones of which ?WIDE-PRED is true. Predicates related by #$genlPreds can be any arity, as long as they both have the same arity.

Copyright © 2002 Cycorp #$genlPreds #$genlPreds (continued) (#$genlPreds #$biologicalMother #$biologicalParents ) is (#$implies (#$biologicalMother ?X ?Y) (#$biologicalParents ?X ?Y)) (#$genlPreds #$createdBy #$startsAfterStartingOf) is (#$implies (#$createdBy ?X ?Y) (#$startsAfterStartingOf ?X ?Y))

Copyright © 2002 Cycorp #$genlInverse (#$genlInverse ?NARROW-PRED ?WIDE-PRED-INV) means that ?NARROW-PRED is a restricted version of ?WIDE-PRED-INV, with argument order reversed.

Copyright © 2002 Cycorp #$genlInverse (#$genlInverse ?NARROW-PRED ?WIDE-PRED-INV) means that ?NARROW-PRED is a restricted version of ?WIDE-PRED-INV, with argument order reversed. How would this be expressed in a rule ?

Copyright © 2002 Cycorp #$genlInverse (#$genlInverse ?NARROW-PRED ?WIDE-PRED-INV) means that ?NARROW-PRED is a restricted version of ?WIDE-PRED-INV, with argument order reversed. How would this be expressed in a rule ? (#$implies (?NARROW-PRED ?ARG1 ?ARG2) (?WIDE-PRED-INV ?ARG2 ?ARG1)) ?NARROW-PRED and ?WIDE-INV-PRED must be binary predicates. Example : (#$genlInverse #$customers #$suppliers)

Copyright © 2002 Cycorp #$negationPreds (#$negationPreds ?PRED ?NEG-PRED ) means that if (?PRED ?ARG1 … ?ARGN) then not (?NEG-PRED ?ARG1 … ?ARGN) ?PRED and ?NEG-PRED can be of any arity, as long as they both have the same arity. Example : (#$negationPreds #$owns #$rents)

Copyright © 2002 Cycorp #$negationInverse (#$negationInverse ?PRED ?NEG-PRED-INV) means that if (?PRED ?ARG1 ?ARG2) then not (?NEG-PRED-INV ?ARG2 ?ARG1) ?PRED and ?NEG-PRED-INV must be binary predicates. Example: (#$negationInverse #$subordinates #$subordinates)

Copyright © 2002 Cycorp Summary Second-Order predicates can be used to express relations between predicates The four predicates discussed were: –#$genlPreds –#$genlInverse –#$negationPreds –#$negationInverse

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.