NARS an Artificial General Intelligence Project

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

1 Knowledge Representation Introduction KR and Logic.
Modelling with expert systems. Expert systems Modelling with expert systems Coaching modelling with expert systems Advantages and limitations of modelling.
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Logic Programming Automated Reasoning in practice.
CHAPTER 13 Inference Techniques. Reasoning in Artificial Intelligence n Knowledge must be processed (reasoned with) n Computer program accesses knowledge.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
Automated Reasoning Systems For first order Predicate Logic.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Rulebase Expert System and Uncertainty. Rule-based ES Rules as a knowledge representation technique Type of rules :- relation, recommendation, directive,
Logic Use mathematical deduction to derive new knowledge.
1 DCP 1172 Introduction to Artificial Intelligence Chang-Sheng Chen Topics Covered: Introduction to Nonmonotonic Logic.
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Intelligent systems Lecture 6 Rules, Semantic nets.
CPSC 322 Introduction to Artificial Intelligence September 15, 2004.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6 [P]: Reasoning Under Uncertainty Section.
A Probabilistic Framework for Information Integration and Retrieval on the Semantic Web by Livia Predoiu, Heiner Stuckenschmidt Institute of Computer Science,
Introduction to AI & AI Principles (Semester 1) WEEK 8 (07/08) [Barnden’s slides only] John Barnden Professor of Artificial Intelligence School of Computer.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Ontologies Reasoning Components Agents Simulations Belief Update, Planning and the Fluent Calculus Jacques Robin.
Formal Models in AGI Research Pei Wang Temple University Philadelphia, USA.
Pattern-directed inference systems
AGI Architectures & Control Mechanisms. Realworld environment Anatomy of an AGI system Intellifest 2012 Sensors Actuators Data Processes Control.
LOGIC AND ONTOLOGY Both logic and ontology are important areas of philosophy covering large, diverse, and active research projects. These two areas overlap.
Natural Language Processing by Reasoning and Learning Pei Wang Temple University Philadelphia, USA.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Today’s Topics Introduction to Proofs Rules of Inference Rules of Equivalence.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
CS6133 Software Specification and Verification
Thinking  Cognition  mental activities associated with thinking, knowing, remembering, and communicating  Cognitive Psychology  study of mental activities.
Some Thoughts to Consider 8 How difficult is it to get a group of people, or a group of companies, or a group of nations to agree on a particular ontology?
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
International Conference on Fuzzy Systems and Knowledge Discovery, p.p ,July 2011.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Anne Watson Hong Kong  grasp formal structure  think logically in spatial, numerical and symbolic relationships  generalise rapidly and broadly.
EEL 5937 Content languages EEL 5937 Multi Agent Systems Lecture 10, Feb. 6, 2003 Lotzi Bölöni.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
CSC3315 (Spring 2009)1 CSC 3315 Languages & Compilers Hamid Harroud School of Science and Engineering, Akhawayn University
Issues in Temporal and Causal Inference Pei Wang Temple University, USA Patrick Hammer Graz University of Technology, Austria.
Some Thoughts to Consider 5 Take a look at some of the sophisticated toys being offered in stores, in catalogs, or in Sunday newspaper ads. Which ones.
From NARS to a Thinking Machine Pei Wang Temple University.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
Artificial Intelligence Knowledge Representation.
Definition and Technologies Knowledge Representation.
Artificial Intelligence Logical Agents Chapter 7.
Research Design. How do we know what we know? The way we make reasoning Deductive logic Begins with one or more premises, reasoning then proceeds logically.
Knowledge Representation Techniques
CHAPTER 5 Handling Uncertainty BIC 3337 EXPERT SYSTEM.
Chapter 7. Propositional and Predicate Logic
Programming paradigms
ece 720 intelligent web: ontology and beyond
Knowledge Representation and Reasoning
Introduction to Prolog
Architecture Components
Knowledge Representation
Logical architecture refinement
Logic Use mathematical deduction to derive new knowledge.
KNOWLEDGE REPRESENTATION
A Brief Summary for Exam 1
CPSC 322 Introduction to Artificial Intelligence
An Introduction to Software Architecture
Back to “Serious” Topics…
The Logic of Declarative Statements
Chapter 7. Propositional and Predicate Logic
Copyright © Cengage Learning. All rights reserved.
Software Development Process Using UML Recap
Representations & Reasoning Systems (RRS) (2.2)
Generalized Diagnostics with the Non-Axiomatic Reasoning System (NARS)
Presentation transcript:

NARS an Artificial General Intelligence Project Tony Lofthouse & The OpenNARS Team

“Intelligence” Interpreted Main­stream AI treats “Intelligence” as a collection of problem-specific and domain-specific parts AGI takes “Intelligence” as a general- purpose capability that should be treated as a whole AGI research still includes different research objectives and strategies

Basic Assumption “Intelligence” is the capability of a system to adapt to its environment and to work with insufficient knowledge and resources Assumption of Insufficient Knowledge and Resources (AIKR): To rely on finite processing capacity To work in real time To open to unexpected tasks

Reasoning System Framework a language for representation a semantics of the language a set of inference rules a memory structure a control mechanism Advantages: domain independence rich expressing power justifiability flexibility 4

Fundamental Issue Under AIKR, the system cannot guarantee absolute correctness or optimum anymore. Now what is the standard of validity or rationality? Validity and rationality become relative to the available knowledge and resources. Desired features: general, adaptive, flexible, robust, scalable 5

Term: word, as name of a concept Statement: subject-copula-predicate Term and Statement Term: word, as name of a concept Statement: subject-copula-predicate S  P as specialization-generalization water liquid Copula inheritance is reflexive and transitive 6

Experience K: a finite set of statements Binary Truth-value Experience K: a finite set of statements Beliefs K*: the transitive closure of K A statement is true if either it is in K* or it has the form of X  X otherwise it is false 7

Extension and Intension TI For a given term T, its extension TE = {x | x  T} its intension TI = {x | T  x} Theorem: (S  P)  (SE  PE)  (PI  SI) 8

Evidence Positive evidence of S  P : ⊗ ⊕ Positive evidence of S  P : {x | x  (SE  PE)  (PI  SI)} Negative evidence of S  P : {x | x  (SE – PE)  (PI – SI)} Amount of evidence: positive: w+ = |SE  PE | + |PI  SI | negative: w– = |SE – PE | + |PI – SI | total: w = w+ + w– = |SE | + |PI | 9

Truth-Value Defined In NARS, the truth-value of a statement is a pair of real numbers in [0, 1], and measures the evidential support to the statement. S  P <f, c> frequency: f = w+/w confidence: c = w / (w +1) S P <f, c> 10

Truth-Value Produced Actual experience: a stream of statements with truth-value, where the confidence is in (0, 1) Each inference rule has a truth-value function, and the truth-value of the conclusion is determined only by the evidence provided by the premises 11

Truth-value Function Design 1. Treat all involved variables as Boolean 2. For each value combination in premises, decide the values in conclusion 3. Build Boolean functions among the variables 4. Extend the operators to real-number: not(x) = 1 – x and(x, y) = x * y or(x, y) = 1 – (1 – x) * (1 – y) 12

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

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

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

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

Types of Inference Rules Local Inference: revising beliefs or choosing an answer for a question Forward inference: from existing beliefs to new beliefs (deduction, induction, abduction, …) Backward inference: from existing questions and beliefs and to derived questions 17

Memory Structure A task is either a question or a piece of new knowledge A belief is accepted knowledge The tasks and beliefs are clustered into concepts, each named by a term Concepts are prioritized in the memory; tasks and beliefs are prioritized within each concept 18

Memory as a Network bird gull swimmer 19 robin feathered_creature crow [?] robin [1.00, 0.90] [1.00, 0.90] [1.00, 0.90] [1.00, 0.45] [0.00, 0.90] feathered_creature Cbird [1.00, 0.90] [1.00, 0.90] [1.00, 0.90] [1.00, 0.90] crow bird swan 19

Meaning of Concept Every concept in NARS is fluid: Its meaning is determined neither by reference nor definition, but by experienced relations Each relation is a matter of degree Meaning changes by history and context 20

Architecture and Routine

Control Strategy In each step, a task interacts with a belief according to applicable rules The task and belief are selected probabilistically, biased by priority Factors influence the priority of an item: its quality, its usefulness in history, and its relevance to the current context 22

The Layers of the Logic IL-9 NAL-9 event, goal, and operation as term statement and variable as term IL-5 NAL-5 implementation IL-4 NAL-4 derivative copulas & compound terms IL-3 NAL-3 IL-2 NAL-2 atomic term IL-1 NAL-1

Copulas & Compound Terms Ideas from set theory: Variants of the inheritance copula: similarity, instance, and property Compound terms: sets, intersections, differences, products, and images New inference rules for comparison, analogy, plus compound-term composition and decomposition 24

Higher-Order Reasoning Ideas from propositional/predicate logic: Copulas: implication and equivalence Compound statements: negation, conjunction, and disjunction Conditional inferences as implication Variable terms as symbols NAL as a universal meta-logic 25

Procedural Reasoning Ideas from logic programming: Events as statements with temporal relations (sequential and parallel) Operations as executable events, with a sensorimotor interface Goals as events to be realized Mental operations are integrated into the inference process 26

Unifications in NARS Fully based on AIKR Unified representational language Complete inferential power Reasoning as learning, planning, problem solving, decision making, ... Integrating with other software & hardware via plug-and-play 27

Implementation NARS has been mostly implemented in the open-source project OpenNARS Working examples exist as proof of concept, though only cover simple cases The system shows many human-like properties, though it is not a psychological model 28

Potential Applications NARS is not designed for any specific application, it can be considered as a general purpose tool user Suitable domains: AIKR is applicable Tasks expressible as reasoning Tools have compatible interface 29

Publications & reports: http://www.cis.temple.edu/~pwang/ Source code, examples, and documents: http://opennars.org/ Participations and COLLABORATIONS are welcome!