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

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

The Generation and Evaluation of Generic Sentences

Non-Axiomatic Logic (NAL) Specification. Pei Wang

2 Deduction Abduction Induction M P P M M P S M S M M S S P S P S P Dened in this way, the dierence among the three is purely syntactic: in deduction,

Toward a Unified Artificial Intelligence

A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

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

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence

Learning Goals of CS245 Logic and Computation

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

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

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

Propositional Logic: Logical Agents (Part I)

Propositional logic (revision) & semantic entailment. p. 1/34

7. Propositional Logic. Wolfram Burgard and Bernhard Nebel

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

Description Logics. Deduction in Propositional Logic. franconi. Enrico Franconi

MAI0203 Lecture 7: Inference and Predicate Calculus

Propositional Logic: Logical Agents (Part I)

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

22c:145 Artificial Intelligence

Artificial Intelligence. Propositional logic

Belief Revision in Probability Theory

A statement is a sentence that is definitely either true or false but not both.

Logic: Propositional Logic (Part I)

Propositional Logic Language

Human-level concept learning through probabilistic program induction

Nonclassical logics (Nichtklassische Logiken)

Deliberative Agents Knowledge Representation I. Deliberative Agents

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

Human interpretation and reasoning about conditionals

Reasoning with Uncertainty

THE LOGIC OF OPINION

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

Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions

Logic in AI Chapter 7. Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz )

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

Towards Tractable Inference for Resource-Bounded Agents

Propositional Logic: Review

CS:4420 Artificial Intelligence

6. Logical Inference

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Possibilistic Logic. Damien Peelman, Antoine Coulon, Amadou Sylla, Antoine Dessaigne, Loïc Cerf, Narges Hadji-Hosseini.

Advanced Topics in LP and FP

Introduction to fuzzy logic

Probability Theory Ensues from Assumptions of Approximate Consistency: A Simple Derivation and its Implications for AGI

Logical reasoning - Can we formalise our thought processes?

Quantum Probability in Cognition. Ryan Weiss 11/28/2018

First-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig

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

Artificial Intelligence Knowledge Representation I

A Theory of Forgetting in Logic Programming

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic

Dynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics

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

Uncertain Logic with Multiple Predicates

THE LOGIC OF COMPOUND STATEMENTS

ARTIFICIAL INTELLIGENCE

Natural Deduction for Propositional Logic

Propositional logic. First order logic. Alexander Clark. Autumn 2014

Deontic Logic and Meta-Ethics

1 Propositional Logic

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

Handbook of Logic and Proof Techniques for Computer Science

Introduction to Intelligent Systems

Relevant Logic. Daniel Bonevac. March 20, 2013

Partial Implication Semantics for Desirable Propositions

Chapter 11: Automated Proof Systems

Math Real Analysis

Chapter 11: Automated Proof Systems (1)

Nested Epistemic Logic Programs

Topics in Model-Based Reasoning

Change, Change, Change: three approaches

Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask

BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR

Logic and Proofs. (A brief summary)

Foundations of Artificial Intelligence

Chapter 1. Introduction

The Limitation of Bayesianism

Module 7 D and Equivalent Systems

INF5390 Kunstig intelligens. Logical Agents. Roar Fjellheim

Fuzzy Propositional Logic for the Knowledge Representation

Is probability the measure of uncertainty?

Part Two: The Basic Components of the SOFL Specification Language

Can Machines Learn Logics?

Computation and Inference

PROPOSITIONAL CALCULUS

The Representation of Medical Reasoning Models in Resolution-based Theorem Provers

CogSysI Lecture 9: Non-Monotonic and Human Reasoning

02 Propositional Logic

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

Lecture 2: Foundations of Concept Learning

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

Rule-Based Fuzzy Model

Introduction to Artificial Intelligence. Logical Agents

Logic: Intro & Propositional Definite Clause Logic

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Transcription:

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 be studied as a whole It is possible to build machine intelligence comparable to human intelligence 2

Intelligence can be understood as rationality and validity to do the right thing. Logic studies valid reasoning, or the Law of Thought. Therefore, an AI system may be built as a reasoning system following a logic. 3

Systems following Mathematical logic Language and inference rules: first-order predicate calculus Semantics: model theory Memory: database or knowledge base Control: theory of computation and algorithm 4

Uncertainty: fuzzy concepts, changing meanings and truth-values, fallible results, conflicting evidence, nondeterministic inference process, Semantic justification of non-deductive inference: induction, abduction, analogy, 5

Counter-intuitive results: sorites paradox, implication paradox, Hempel s confirmation paradox, Wason s selection task, Computability and complexity: termination problem, combinatorial explosion, unanticipated problem, 6

non-monotonic logic paraconsistent logic relevance logic probabilistic logic fuzzy logic inductive logic temporal logic modal logic situation calculus possible-world theory mental logic mental model case-based reasoning Bayesian network neural network genetic algorithm heuristic algorithm learning algorithm anytime algorithm 7

The traditional theories were developed in the study of the foundation of mathematics, while the problems appear outside mathematics. The logic of mathematics is different from the logic of cognition and intelligence in their assumptions on the knowledge and resources of the system involved. 8

Pure-axiomatic: the system s knowledge and resources are sufficient (with respect to the problems to be solved). Semi-axiomatic: some (but not all) aspects of the knowledge and resources are sufficient. Non-axiomatic: the knowledge and resources of the system are insufficient. 9

NARS (Non-Axiomatic Reasoning System) is a reasoning system that is fully based on the Assumption of Insufficient Knowledge and Resources. NARS is a finite, real time, open, and adaptive system. NARS is different from the traditional systems in all major components. 10

A typical sentence: bird animal [1.0, 0.9] Term: bird and animal are names of concepts Inheritance ( ): a copula for specialization-generalization relation Truth-value: [frequency, confidence] 11

The truth-value of a sentence is determined by the available evidence from the experience of the system: f = w + /w, c = w/(w+1) where w + and w are the amounts of positive and total evidence, respectively. The meaning of a term is defined by its experienced relations with other terms. 12

M P [f1, c1] S M [f2, c2] S P [f, c] f = f1 * f2 c = c1 * c2 * f1 * f2 S M P bird animal [1.00, 0.90] robin bird [1.00, 0.90] robin animal [1.00, 0.81] 13

M P [f1, c1] M S [f2, c2] S P [f, c] f = f1 c = f2 * c1 * c2 / (f2 * c1 * c2 + 1) S M P swan bird [1.00, 0.90] swan swimmer [1.00, 0.90] bird swimmer [1.00, 0.45] 14

P M [f1, c1] S M [f2, c2] S P [f, c] f = f2 c = f1 * c1 * c2 / (f1 * c1 * c2 + 1) S M P seabird swimmer [1.00, 0.90] gull swimmer [1.00, 0.90] gull seabird [1.00, 0.45] 15

S P [f1, c1] S P [f2, c2] S P [f, c] f = c = f1 * c1 * (1 - c2) + f2 * c2 * (1 - c1) c1 * (1 - c2) + c2 * (1 - c1) c1 * (1 - c2) + c2 * (1 - c1) c1 * (1 - c2) + c2 * (1 - c1) + (1 - c2) * (1 - c1) S P bird swimmer [1.00, 0.62] bird swimmer [0.00, 0.45] bird swimmer [0.67, 0.71] 16

gull [1.00, 0.90] swimmer robin [1.00, 0.90] C bird feathered_creature crow [1.00, 0.90] [1.00, 0.90] bird swan 17

In each step, a task is processed by interacting with a belief within the same concept, according to applicable rules. The concept, task, and belief are selected probabilistically, according to priority distributions among tasks and beliefs. Factors influencing the priority of an item: quality, usefulness in history, relevance to the current context, etc. 18

Compound terms: sets, intersections, differences, products, and images. Variants of the inheritance copula: similarity, instance, and property. New inference rules for comparison, analogy, plus compound-term composition and decomposition. Related changes in memory and control. 19

Implication and equivalence, are higherorder copulas between statements. Compound statements: negations, conjunctions, and disjunctions. The implication relation is used to carry out conditional and hypothetical inferences. Variable terms are used to carry out general and abstract inferences. 20

Events as statements with temporal relations (sequential and parallel). Prediction as temporal inference. Operations as statements with procedural interpretation. Skill learning and planning as procedural inferences. Goals as statements to be realized. Decision making as committing to candidate goals. 21

It is possible to build a reasoning system that adapts to environment, and works with insufficient knowledge and resources. Such a system provides a unified solution to many problems in AI and cognitive sciences, and may lead to AGI. 22

THANKS! Further information: http://www.cis.temple.edu/~pwang/ 23