School of Computing and Mathematics, University of Huddersfield PDDL and other languages.. Lee McCluskey Department of Computing and Mathematical Sciences,

Slides:



Advertisements
Similar presentations
Ontologies: Dynamic Networks of Formally Represented Meaning Dieter Fensel: Ontologies: Dynamic Networks of Formally Represented Meaning, 2001 SW Portal.
Advertisements

Semantics Static semantics Dynamic semantics attribute grammars
Opmaker2: Efficient Action Schema Acquisition T.L.McCluskey, S.N.Cresswell, N. E. Richardson and M.M.West The University of Huddersfield,UK
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Semantic Web Services Peter Bartalos. 2 Dr. Jorge Cardoso and Dr. Amit Sheth
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages Chapter 3 : Describing Syntax and Semantics Axiomatic Semantics.
ISBN Chapter 3 Describing Syntax and Semantics.
ICKEP International Competition for Knowledge Engineering in Planning - A PROPOSAL Lee McCluskey KE TCU.
Ontologies - What’s all the fuss about? Lee McCluskey Department of Computing and Mathematical Sciences University of Huddersfield.
Towards An Algebraic Formulation of Domain Definitions using Parameterised Machines T. L. McCluskey and R. M.Simpson School of Computing and Engineering.
Language Specfication and Implementation - PART II: Semantics of Procedural Programming Languages Lee McCluskey Department of Computing and Mathematical.
The Semantic Web: Implications for Future Intelligent Systems Lee McCluskey, Artform Research Group, Department of Computing And Mathematical Sciences,
LEARNING FROM OBSERVATIONS Yılmaz KILIÇASLAN. Definition Learning takes place as the agent observes its interactions with the world and its own decision-making.
Knowledge and Systems Research Group, University of Huddersfield B vs OCL: Comparing Specification Languages for Planning Domains Diane Kitchin, Lee McCluskey,
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Lee McCluskey, University of Huddersfield - EKAW'04 Knowledge Formulation for AI Planning Lee McCluskey Ron Simpson Artform research group Department of.
PDDL: A Language with a Purpose? Lee McCluskey Department of Computing and Mathematical Sciences, The University of Huddersfield.
School of Computing and Mathematics, University of Huddersfield Knowledge Engineering: Issues for the Planning Community Lee McCluskey Department of Computing.
C SC 520 Principles of Programming Languages 1 C SC 520: Principles of Programming Languages Peter J. Downey Department of Computer Science Spring 2006.
HAS. Patterns The use of patterns is essentially the reuse of well established good ideas. A pattern is a named well understood good solution to a common.
Formal Ontology and Information Systems Nicola Guarino (FOIS’98) Presenter: Yihong Ding CS652 Spring 2004.
ICKEP International Competition for Knowledge Engineering in Planning Lee McCluskey PLANET Knowledge Engineering.
Chapter 1 Principles of Programming and Software Engineering.
Describing Syntax and Semantics
Chapter 10 Classes Continued
© 2006 Pearson Addison-Wesley. All rights reserved2-1 Chapter 2 Principles of Programming & Software Engineering.
Matthew J Mattia CSC  Cumbersome Code  Consistent/Predictable design (GUEPs #5, CD’s #10)  Display “proper” amount of information  Including.
9-Aug-15 Vocabulary. Programming Vocabulary Watch closely, you might even want to take some notes. There’s a short quiz at the end of this presentation!
CHAPTER 1: INTORDUCTION TO C LANGUAGE
Abstract data types What does ‘ abstract ’ mean? From Latin: to ‘ pull out ’— the essentials –To defer or hide the details –Abstraction emphasizes essentials.
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
FRE 2672 Urban Ontologies : the Towntology prototype towards case studies Chantal BERDIER (EDU), Catherine ROUSSEY (LIRIS)
Programming Languages and Paradigms Object-Oriented Programming.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
C++ Object Oriented 1. Class and Object The main purpose of C++ programming is to add object orientation to the C programming language and classes are.
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
1 Intelligent Systems ISCRAM 2013 Validating Procedural Knowledge in the Open Virtual Collaboration Environment Gerhard Wickler AIAI, University.
Analyzing the Requirements with Formal Specifications Vienna Development Method Specification Language (VDM-SL) Book: Formal Software Development From.
Introduction CS 3358 Data Structures. What is Computer Science? Computer Science is the study of algorithms, including their  Formal and mathematical.
PLANSERVE - overview of an EU proposal for the “Future and Emerging Technologies” Program Lee McCluskey Artform Research.
CHA2555 Week2: Knowledge Representation, Logic and Planning Lee McCluskey First term:
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
Introduction CS 3358 Data Structures. What is Computer Science? Computer Science is the study of algorithms, including their  Formal and mathematical.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
CHAPTER 4: CONTROL STRUCTURES - SEQUENCING 10/14/2014 PROBLEM SOLVING & ALGORITHM (DCT 1123)
Knowledge Representation of Statistic Domain For CBR Application Supervisor : Dr. Aslina Saad Dr. Mashitoh Hashim PM Dr. Nor Hasbiah Ubaidullah.
Basic of Programming Language Skill Area Computer System Computer Program Programming Language Programmer Translators.
Christoph F. Eick University of Houston Organization 1. What are Ontologies? 2. What are they good for? 3. Ontologies and.
Semantics In Text: Chapter 3.
1 Analysing system-user cooperation in KADS H. P. de Greef and J. A. Breuker, Department of Social Science Informatics, University of Amsterdam Knowledge.
© 2006 Pearson Addison-Wesley. All rights reserved 2-1 Chapter 2 Principles of Programming & Software Engineering.
1 September 2003 Brokering Services A Transformation-Based Perspective Stephen Potter & Marco Schorlemmer
Concept mining for programming automation. Problem ➲ A lot of trivial tasks that could be automated – Add field Patronim on Customer page. – Remove field.
C HAPTER 3 Describing Syntax and Semantics. D YNAMIC S EMANTICS Describing syntax is relatively simple There is no single widely acceptable notation or.
Artificial Intelligence Knowledge Representation.
Knowledge Representation Techniques
Chapter 3 of Programming Languages by Ravi Sethi
Design by Contract Jim Fawcett CSE784 – Software Studio
Design by Contract Jim Fawcett CSE784 – Software Studio
Web Service Modeling Ontology (WSMO)
The Need for Algorithms 2 days
COMS W1004 Introduction to Computer Science and Programming in Java
Computer Programming.
Semantics In Text: Chapter 3.
Java Modeling Language (JML)
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
Representations & Reasoning Systems (RRS) (2.2)
C++ Object Oriented 1.
Presentation transcript:

School of Computing and Mathematics, University of Huddersfield PDDL and other languages.. Lee McCluskey Department of Computing and Mathematical Sciences, The University of Huddersfield

School of Computing and Mathematics, University of Huddersfield Background Related to AI Planning there are several kinds of knowledge that is required declaratively: = Domain/environment = Planning heuristics = Task (input)  Plans (output) – actions/activities = Execution - resources

School of Computing and Mathematics, University of Huddersfield PDDL  A language convention for describing DOMAIN DYNAMICS (‘and nothing else’) which has succeeded through its use in the AIPS 98,00 and 02 planning competitions. = Its aim of encouraging sharing of planning problems and algorithms has to some degree been achieved.

School of Computing and Mathematics, University of Huddersfield PDDL - form  PDDL’s syntax is LISP like. A domain (model) definition is structured into components by Keywords e.g. ‘:constants’ ‘:actions’ etc. The most important components are the set of actions.  A special keyword is ‘:requirements’ which tells a process which blend of PDDL features are used in the domain definition. So we have a family of languages to suit planners with different capabilities.

School of Computing and Mathematics, University of Huddersfield PDDL - Semantics The basic requirement in PDDL is ‘:strips’ which indicates the underlying semantics of the language – worlds are considered as sets of situations (states), where each state is specified by stating a list of all predicates that are true. States are changed instantaneously into new states by actions which change the truth value of predicates. Actions have preconditions and effects under the default persistence assumption.. Etc…

School of Computing and Mathematics, University of Huddersfield PDDL - Where is the Semantics? The semantics of PDDL v1.2 (used for ’98 competition) are informal and appear to be distributed among:  the pre-existing languages/systems – strips, ucpop 7 The v1.2 manual 7 The language processors (solution checker) 7 LISP 7 somewhere else??

School of Computing and Mathematics, University of Huddersfield PDDL Examples.. ‘The rule is that action definitions are not allowed to have effects that mention predicates that occur in the :implies field [RHS] of an axiom’ (p13) ‘An action definition must have an :effect or an :expansion but not both’ (p8)

School of Computing and Mathematics, University of Huddersfield PDDL - v2.1 Extensions – different handling of numeric quantities, addition of durative actions Left out – HTN actions (apparently no-one had used them!) BUT – attempted to give a formal semantics to the language

School of Computing and Mathematics, University of Huddersfield Is PDDL a (good) modelling language?? Fox and Long in the v2.1 manual describe it explicitly as one. Although not much discussed, PDDLv1.2 actually provides modelling features.. 7 :timeless - predicates (static factual knowledge)  :domain-axioms – written as L-R rules that form invariants on situations  :expansion – allows encapsulation of actions in an HTN fashion  :extends – allows some modularisation - one can import previously written components.

School of Computing and Mathematics, University of Huddersfield Is PDDL a modelling language?? But:  PDDL was designed to reflect current languages and their underlying assumptions. It was NOT designed with a model building method in mind OR with many ‘pragmatic’ feature which make building easier.  It is a ‘machine code’ rather than a language for human use!

School of Computing and Mathematics, University of Huddersfield Role of PDDL in the Semantic Web?. One can imagine having planning services around the web – one supplies the problems + domain model in extended-PDDL and invokes the planning service. Extensions: 7 Marked up (XML/RDF/RDFS (?)) version of PDDL 7 Language for expressing advice / heuristics Service: analyses the domain model and configures a planner to solve the problems

School of Computing and Mathematics, University of Huddersfield Future – develop ontologies for Planning Ontologies are explicit specifications of a conceptual model for sharing the understanding of a particular domain. Some ontologies for planning concepts have been created – e.g. PLANET (Blythe) and SPAR (Tate). They are deemed essential for on-line agent communication between agents involved in planning (but promise multiple benefits eg in the KA process).

School of Computing and Mathematics, University of Huddersfield Future – develop ontologies for Planning Both - planning-oriented AND - planning-application-oriented ontologies need to be developed.

School of Computing and Mathematics, University of Huddersfield Future – my vision? Timely maturing of 4 research areas – = Semantic Web  KE – knowledge sharing and re-use = Planning language conventions = Planning KE Can be combined to solve the biggest problems in AI planning currently – lack of Accessibility and Usability of the technology