1 LCW-Based Agent Planning for the Semantic Web Jeff Heflin, Hector Muñoz-Avila presented by Axel Polleres cf.

Slides:



Advertisements
Similar presentations
REVIEW : Planning To make your thinking more concrete, use a real problem to ground your discussion. –Develop a plan for a person who is getting out of.
Advertisements

Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Chapter 12 cognitive models.
Inference Rules Universal Instantiation Existential Generalization
CLASSICAL PLANNING What is planning ?  Planning is an AI approach to control  It is deliberation about actions  Key ideas  We have a model of the.
WIMS 2014, June 2-4Thessaloniki, Greece1 Optimized Backward Chaining Reasoning System for a Semantic Web Hui Shi, Kurt Maly, and Steven Zeil Contact:
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
OntoPlan: Knowledge Fusion Using Semantic Web Ontologies Héctor Muñoz-Avila Jeff Heflin.
Propositional Logic Reading: C , C Logic: Outline Propositional Logic Inference in Propositional Logic First-order logic.
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Mar, 4, 2015 Slide credit: some slides adapted from Stuart.
SIG2: Ontology Language Standards WebOnt Briefing Ian Horrocks University of Manchester, UK.
Planning Search vs. planning STRIPS operators Partial-order planning.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
Artificial Intelligence 2005/06
Ontologies and the Semantic Web by Ian Horrocks presented by Thomas Packer 1.
A Probabilistic Framework for Information Integration and Retrieval on the Semantic Web by Livia Predoiu, Heiner Stuckenschmidt Institute of Computer Science,
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
1 Basic abstract interpretation theory. 2 The general idea §a semantics l any definition style, from a denotational definition to a detailed interpreter.
Artificial Intelligence Chapter 11: Planning
Dynamic Ontologies on the Web Jeff Heflin, James Hendler.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
CS 561, Session Planning Search vs. planning STRIPS operators Partial-order planning.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
An Intelligent Broker Approach to Semantics-based Service Composition Yufeng Zhang National Lab. for Parallel and Distributed Processing Department of.
Queensland University of Technology An Ontology-based Mining Approach for User Search Intent Discovery Yan Shen, Yuefeng Li, Yue Xu, Renato Iannella, Abdulmohsen.
Planning with Incomplete, Unbounded Information May 20, 2003 Tal Shaked.
Planning Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 11.
1 Adapting BPEL4WS for the Semantic Web The Bottom-Up Approach to Web Service Interoperation Daniel J. Mandell and Sheila McIlraith Presented by Axel Polleres.
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
© Bertrand Meyer and Yishai Feldman Notice Some of the material is taken from Object-Oriented Software Construction, 2nd edition, by Bertrand Meyer (Prentice.
ITCS 6010 SALT. Speech Application Language Tags (SALT) Speech interface markup language Extension of HTML and other markup languages Adds speech and.
Analyzing the Requirements with Formal Specifications Vienna Development Method Specification Language (VDM-SL) Book: Formal Software Development From.
Constraint Satisfaction Problems (CSPs) CPSC 322 – CSP 1 Poole & Mackworth textbook: Sections § Lecturer: Alan Mackworth September 28, 2012.
Simplifying Rational Expressions where P(x) and Q(x) are polynomials, Q(x) ≠ 0. Just as we simplify rational numbers (fractions) in arithmetic, we want.
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
First-Order Logic and Plans Reading: C. 11 (Plans)
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
An Ontological Framework for Web Service Processes By Claus Pahl and Ronan Barrett.
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
A Logical Framework for Web Service Discovery The Third International Semantic Web Conference Hiroshima, Japan, Michael Kifer 1, Rubén Lara.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
Ch. 13 Ch. 131 jcmt CSE 3302 Programming Languages CSE3302 Programming Languages (notes?) Dr. Carter Tiernan.
Automated Planning Dr. Héctor Muñoz-Avila. What is Planning? Classical Definition Domain Independent: symbolic descriptions of the problems and the domain.
Learning to Share Meaning in a Multi-Agent System (Part I) Ganesh Padmanabhan.
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Oct, 30, 2015 Slide credit: some slides adapted from Stuart.
1 Reasoning with Infinite stable models Piero A. Bonatti presented by Axel Polleres (IJCAI 2001,
Daniel Kroening and Ofer Strichman Decision Procedures An Algorithmic Point of View Deciding Combined Theories.
Logic: Proof procedures, soundness and correctness CPSC 322 – Logic 2 Textbook §5.2 March 7, 2011.
A Portrait of the Semantic Web in Action Jeff Heflin and James Hendler IEEE Intelligent Systems December 6, 2010 Hyewon Lim.
1 September 2003 Brokering Services A Transformation-Based Perspective Stephen Potter & Marco Schorlemmer
OWL Web Ontology Language Summary IHan HSIAO (Sharon)
Consider the task get milk, bananas, and a cordless drill.
Towards a Semantic Model for Java Wildcards Sophia Drossopoulou Mariangiola Dezani-Ciancaglini Imperial College London Università di Torino Italy Nicholas.
Logical Agents. Inference : Example 1 How many variables? 3 variables A,B,C How many models? 2 3 = 8 models.
Propositional Logic: Logical Agents (Part I)
Data Types In Text: Chapter 6.
Introduction to Logic for Artificial Intelligence Lecture 2
EA C461 – Artificial Intelligence Logical Agent
Consider the task get milk, bananas, and a cordless drill
Christophe Bisciglia 5/16/2003
Logical Agents Chapter 7.
Computer Security: Art and Science, 2nd Edition
Logical Agents Chapter 7.
Semantic Markup for Semantic Web Tools:
Cognitive models linguistic physical and device architectural
CSE S. Tanimoto Lambda Calculus
Chapter 12 cognitive models.
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
Presentation transcript:

1 LCW-Based Agent Planning for the Semantic Web Jeff Heflin, Hector Muñoz-Avila presented by Axel Polleres cf.

2 Overview Add LCW to DAML+OIL and SHOE Combine enriched ontologies with OTD. Semantic Description of the involved Sources/Services is not an issue.

3 Local Closed World Assumption An expression of the form LCW(  ) means stating that any substitution of  which is true in the real world is also represented in the agents knowledge, i.e. stating "local complete knowledge" on .

4 Semantic Web and LCW Why is this interesting here? The open world causes often unbounded search (therefore, e.g. classical planning is not directly applicable). Suggestion: Extend fixed KB by a “Semantic Web Mediator” to gather more information.

5 DAML-LCW: State that a resource has complete information on a particular class.

6 DAML-LCW Limited suitability for properties: Can express LCW(prop(X,c)), but not LCW(prop(c,X)), nor LCW(prop(x,y))

7 LCW within DAML+OIL States that C is the class of r 1, …, r n and nothing else! i.e. DAML-LCW is not more expressive than DAML+OIL itself. Problem: very naïve, since r 1, …, r n have to be enumerated explicitely.

8 SHOE-LCW states LCW(flight(X)  destination(X,Y)  USCity(Y)) LCW restricted to pos. conjunctions. more flexible than DAML-LCW (variables), but LCW not expressible within the language itself (complement/disjointness not expressible)

9 SHOE-LCW LCW adds implicit negation to SHOE. How to handle this? Non- monotonic reasoning? Unsolved. In the paper they assume “well-formed LCW information”, but can this be achieved in the Web? further remark: LCW cannot be defined on sets of resources (neither in DAML-LCW, nor in SHOE-LCW)

10 Rest of the paper OTD enhanced by Semantic Web mediator: What is OTD? method M(h,P,ST)... compound task definition with head h, preconditions P and a set of subtasks ST. matches(h,t,S)... a task matches a method with head h if hΘ=t and S satisfies PΘ where Θ is a substitution. operator O(h,P,aL,dL)... primitive action, with preconditions add-list and delete-list (like in STRIPS) OTD: match tasks to subtasks recursively to an ordered list of operators p, binding all parameters.

11 Architecture: Fixed KB contains information gathered so far (including LCW information) and domain theory. Other information sources queried via Semantic Web mediator. (Problem: offline, actions are not “executed” on the source before planning is completed)

12 LCW in planning: LCW information can arise in two forms in Planning: – LCW provided by information sources – LCW inferred as result of an action (example: UNIX command " ls " whereafter we know all files in a directory and we know that these are all files there).

13 Use LCW for precondition evaluation:

14 Querying the SWeb Mediator: Bound by resource-constraints such as time limits or max number of sources to be queried.

15 LCW yielding operators: After execution with f  355 and date  1/2/2002, we can add LCW(SeatFree(355, 1/2/2002, s))

16 Conclusions LCW can be udes to reduce/cut-off search space in search/planning. LCW info stored explicitly or yielded by action execution Unclear how to deal with inconsistent LCW information.