DOCSLIB.ORG

Discrete Event Calculus Using Semantic Web Technologies

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Glamorgan Dspace Discrete event calculus using Semantic Web technologies WILL MEPHAM A submission presented in partial fulfilment of the requirements of the University of Glamorgan/Prifysgol Morgannwg for the degree of Doctor of Philosophy 2010 Table of Contents ABSTRACT................................................................................................................................................1 GLOSSARY................................................................................................................................................2 CHAPTER 1 OBJECTIVES AND MOTIVATION.................................................................................4 1.1 BACKGROUND TO THE PROJECT...................................................................................................................4 1.2 MOTIVATION...........................................................................................................................................5 1.3 INITIAL GOALS.........................................................................................................................................7 1.3.1 A DEC ontology defined in Semantic Web languages.................................................................7 1.3.2 A software framework that can use the ontology for practical applications..............................8 1.3.3 An accurate implementation of DEC..........................................................................................8 1.3.4 A reusable framework for DEC rule resolution..........................................................................9 1.3.5 An investigation into merging time ontology with DEC ............................................................9 1.4 LONG TERM OBJECTIVES............................................................................................................................9 CHAPTER 2 LITERATURE REVIEW.................................................................................................11 2.1 OVERVIEW............................................................................................................................................11 2.1.1 Scope of this section..................................................................................................................11 2.1.2 Preliminary discussion..............................................................................................................11 2.1.2.1 References to Semantic Web standards.............................................................................................11 2.1.2.2 Logic terms......................................................................................................................................11 2.1.2.3 Rules................................................................................................................................................11 2.2 BACKGROUND TO THE SEMANTIC WEB.....................................................................................................11 2.3 ONTOLOGY AND THE SEMANTIC WEB.......................................................................................................14 2.3.1 Different interpretations of ontology.........................................................................................14 2.3.2 Motivation for ontology engineering........................................................................................15 2.3.3 Semantic web standards............................................................................................................16 2.3.4 Semantic web stack...................................................................................................................18 2.4 RULES AND THE SEMANTIC WEB.............................................................................................................22 2.4.1 The need for rules in Semantic Web applications.....................................................................22 2.4.2 SWRL.........................................................................................................................................22 2.4.3 Decidability and rules...............................................................................................................23 2.5 EVENT CALCULUS IN THE CONTEXT OF TEMPORAL REASONING......................................................................25 2.5.1 Common concerns of temporal logics.......................................................................................25 2.5.1.1 Representation of intervals and timepoints.......................................................................................25 2.5.1.2 Cause and effect for temporal logics................................................................................................25 2.5.1.3 Monotonic and non-monotonic entailment and proof ......................................................................26 i 2.5.1.4 Circumscription for non-monotonic entailment and proof................................................................27 2.5.1.5 The frame problem...........................................................................................................................27 2.5.1.6 The ramification problem.................................................................................................................28 2.5.1.7 Inertia...............................................................................................................................................28 2.6 EVENT CALCULUS.................................................................................................................................28 2.6.1 Origins and general characteristics of Event Calculus............................................................28 2.6.1.1 Parsimony of representation.............................................................................................................29 2.6.1.2 Expressive flexibility.......................................................................................................................30 2.6.1.3 Elaboration tolerance........................................................................................................................30 2.6.2 Basic sorts and form.................................................................................................................30 2.6.2.1 Events (actions) ...............................................................................................................................30 2.6.2.2 Fluents .............................................................................................................................................30 2.6.2.3 Timepoints ......................................................................................................................................30 2.6.2.4 Predicates.........................................................................................................................................31 2.6.2.5 EC domain description.....................................................................................................................31 2.6.3 Representational capabilities of EC..........................................................................................32 2.6.3.1 Circumscription in EC......................................................................................................................32 2.6.3.2 Defeasible reasoning........................................................................................................................34 2.6.3.3 Handling contradictions...................................................................................................................34 2.6.3.4 Continuous change...........................................................................................................................35 2.6.3.5 Concurrency.....................................................................................................................................35 2.7 DISCRETE EVENT CALCULUS...................................................................................................................35 2.7.1 An example DEC sequence with equivalent EC sequence........................................................37 2.8 ALTERNATIVE FORMALISMS TO EVENT CALCULUS.......................................................................................39 2.8.1 Situation calculus......................................................................................................................39 2.8.2 Fluent calculus..........................................................................................................................40 2.8.3 PMON and TAL.........................................................................................................................41 2.8.4 K-IA classification of temporal logic formalisms.....................................................................42 2.8.5 General remarks........................................................................................................................42 2.9 EXISTING WORK ON TIME AND EVENT-BASED SEMANTIC WEB ONTOLOGIES.....................................................43 2.9.1 Time based Semantic Web ontologies ......................................................................................43 2.9.2 Event based Semantic Web ontologies......................................................................................44
Recommended publications
  • Understanding Binomial Sequential Testing Table of Contents of Two START Sheets

    Understanding Binomial Sequential Testing Table of Contents of Two START Sheets

    Selected Topics in Assurance Related Technologies START Volume 12, Number 2 Understanding Binomial Sequential Testing Table of Contents of two START sheets. In this first START Sheet, we start by exploring double sampling plans. From there, we proceed to • Introduction higher dimension sampling plans, namely sequential tests. • Double Sampling (Two Stage) Testing Procedures We illustrate their discussion via numerical and practical examples of sequential tests for attributes (pass/fail) data that • The Sequential Probability Ratio Test (SPRT) follow the Binomial distribution. Such plans can be used for • The Average Sample Number (ASN) Quality Control as well as for Life Testing problems. We • Conclusions conclude with a discussion of the ASN or “expected sample • For More Information number,” a performance measure widely used to assess such multi-stage sampling plans. In the second START Sheet, we • About the Author will discuss sequential testing plans for continuous data (vari- • Other START Sheets Available ables), following the same scheme used herein. Introduction Double Sampling (Two Stage) Testing Determining the sample size “n” required in testing and con- Procedures fidence interval (CI) derivation is of importance for practi- tioners, as evidenced by the many related queries that we In hypothesis testing, we often define a Null (H0) that receive at the RAC in this area. Therefore, we have expresses the desired value for the parameter under test (e.g., addressed this topic in a number of START sheets. For exam- acceptable quality). Then, we define the Alternative (H1) as ple, we discussed the problem of calculating the sample size the unacceptable value for such parameter.
  • Opening Presentation

    Opening Presentation

    Mono Meeting. Miguel de Icaza [email protected] October 24, 2006 Mono, Novell and the Community. Mono would not exist without the community: • Individual contributors. • Companies using Mono. • Organizations using Mono. • Companies using parts of Mono. • Google Summer of Code. Introductions. 2 Goals of the Meeting. A chance to meet. • Most of the Novell/Mono team is here. • Many contributors are here. • Various breaks to talk. Talk to others! • Introduce yourself, ask questions. Talk to us! • Frank Rego, Mono's Product Manager is here. • Tell us what you need in Mono. • Tell us about how you use Mono. 3 Project Status Goals Originally: • Improve our development platform on Linux. As the community grew: • Expand to support Microsoft APIs. As Mono got more complete: • Provide a complete cross platform runtime. • Allow Windows developers to port to Linux. 5 Mono Stacks and Goals. MySMQySQLL//PPosstgtrgesrsess EvEovolluutitioonn# # ASP.NET Novell APIs: MMoozzillala Novell iFolder iFolder, LDAP, Identity ADO.NET ApAapchachee MMonoono DesktoGpTK#: GTK# OpNoevenlOl LfDfAiPce GCneomceil# Windows.Forms JavaJa vCa oCommpaatitbilbitiylity Google APIs Microsoft Compatibility Libraries Mono Libraries Mono Runtime (Implementation of ECMA #335) 6 Platforms, CIL, Code Generation. 7 API space Mono 1.0: July 2004 “T-Bone” Mono 1.2: November 2006 “Rump steak” Mono 1.2 bits. Reliability and C# 2.0, .NET 2.0 scalability: • Complete. • With VM support. • ZenWorks and iFolder • Some 2.0 API support. pushed Mono on the server. • IronPython works. • xsp 1.0: 8 request/second. • xsp 1.2: 250 Debugger: request/second. • x86 and x86-64 debugger. GUI • CLI-only, limited in scenarios (no xsp).
  • Reading Inventory Technical Guide

    Reading Inventory Technical Guide

    Technical Guide Using a Valid and Reliable Assessment of College and Career Readiness Across Grades K–12 Technical Guide Excepting those parts intended for classroom use, no part of this publication may be reproduced in whole or in part, or stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without written permission of the publisher. For information regarding permission, write to Scholastic Inc., 557 Broadway, New York, NY 10012. Scholastic Inc. grants teachers who have purchased SRI College & Career permission to reproduce from this book those pages intended for use in their classrooms. Notice of copyright must appear on all copies of copyrighted materials. Portions previously published in: Scholastic Reading Inventory Target Success With the Lexile Framework for Reading, copyright © 2005, 2003, 1999; Scholastic Reading Inventory Using the Lexile Framework, Technical Manual Forms A and B, copyright © 1999; Scholastic Reading Inventory Technical Guide, copyright © 2007, 2001, 1999; Lexiles: A System for Measuring Reader Ability and Text Difficulty, A Guide for Educators, copyright © 2008; iRead Screener Technical Guide by Richard K. Wagner, copyright © 2014; Scholastic Inc. Copyright © 2014, 2008, 2007, 1999 by Scholastic Inc. All rights reserved. Published by Scholastic Inc. ISBN-13: 978-0-545-79638-5 ISBN-10: 0-545-79638-5 SCHOLASTIC, READ 180, SCHOLASTIC READING COUNTS!, and associated logos are trademarks and/or registered trademarks of Scholastic Inc. LEXILE and LEXILE FRAMEWORK are registered trademarks of MetaMetrics, Inc. Other company names, brand names, and product names are the property and/or trademarks of their respective owners.
  • Metadefender Core V4.13.1

    Metadefender Core V4.13.1

    MetaDefender Core v4.13.1 © 2018 OPSWAT, Inc. All rights reserved. OPSWAT®, MetadefenderTM and the OPSWAT logo are trademarks of OPSWAT, Inc. All other trademarks, trade names, service marks, service names, and images mentioned and/or used herein belong to their respective owners. Table of Contents About This Guide 13 Key Features of Metadefender Core 14 1. Quick Start with Metadefender Core 15 1.1. Installation 15 Operating system invariant initial steps 15 Basic setup 16 1.1.1. Configuration wizard 16 1.2. License Activation 21 1.3. Scan Files with Metadefender Core 21 2. Installing or Upgrading Metadefender Core 22 2.1. Recommended System Requirements 22 System Requirements For Server 22 Browser Requirements for the Metadefender Core Management Console 24 2.2. Installing Metadefender 25 Installation 25 Installation notes 25 2.2.1. Installing Metadefender Core using command line 26 2.2.2. Installing Metadefender Core using the Install Wizard 27 2.3. Upgrading MetaDefender Core 27 Upgrading from MetaDefender Core 3.x 27 Upgrading from MetaDefender Core 4.x 28 2.4. Metadefender Core Licensing 28 2.4.1. Activating Metadefender Licenses 28 2.4.2. Checking Your Metadefender Core License 35 2.5. Performance and Load Estimation 36 What to know before reading the results: Some factors that affect performance 36 How test results are calculated 37 Test Reports 37 Performance Report - Multi-Scanning On Linux 37 Performance Report - Multi-Scanning On Windows 41 2.6. Special installation options 46 Use RAMDISK for the tempdirectory 46 3. Configuring Metadefender Core 50 3.1. Management Console 50 3.2.
  • Manual Técnico Portal Para El Centro De Capacitación Continua De La Fica

    Manual Técnico Portal Para El Centro De Capacitación Continua De La Fica

    MANUAL TÉCNICO – PORTAL PARA EL CENTRO DE CAPACITACIÓN CONTINUA DE LA FICA MANUAL TÉCNICO PORTAL PARA EL CENTRO DE CAPACITACIÓN CONTINUA DE LA FICA INSTALACIÓN Es necesario instalar Linux Red Hat 8.0 como servidor, agregando los siguientes paquetes mínimos al momento de la instalación: Desktops: - Sistema X Window - Entorno GNOME Aplications: - Editores (Emacs, vi) - Internet gráfica Servers - Herramientas de configuración del servidor - Servidor Web - Servidor de nombres DNS (BIND) - Servidor de bases de datos - Servidor FTP - Servidor de red Development: - Herramientas de desarrollo (automake, gcc, perl, pitón y depuradores) - Desarrollo de software X (aplicaciones para X window) - Desarrollo de software de GNOME (desarrollar GTK+) System - Herramientas de administración (cuentas de usuario, gestión) - Herramientas del sistema PABLO ANDRÉS LANDETA LÓPEZ 1 UTN – FICA -EISI MANUAL TÉCNICO – PORTAL PARA EL CENTRO DE CAPACITACIÓN CONTINUA DE LA FICA - Soporte para impresión Es muy importante instalar la parte de Development, por cuanto vamos a instalar Mono desde su código fuente, y es necesario compilar las librerías utilizando por ejemplo los compiladores de C++ (gcc). Si instalamos Mono utilizando los archivos .rpm al momento de instalar las aplicaciones nos indicará las dependencias necesarias. Una vez que se tiene instalado la versión Red Hat 8.0 de Linux, e instalado la base de datos MySQL, debemos tener los instaladores (código fuente) de Mono que son los siguientes: mono-0.28.tar.gz mcs-0.28.tar.gz xsp-0.5.tar.gz Primeramente abrimos
  • Reconciling Situation Calculus and Fluent Calculus

    Reconciling Situation Calculus and Fluent Calculus

    Reconciling Situation Calculus and Fluent Calculus Stephan Schiffel and Michael Thielscher Department of Computer Science Dresden University of Technology stephan.schiffel,mit @inf.tu-dresden.de { } Abstract between domain descriptions in both calculi. Another ben- efit of a formal relation between the SC and the FC is the The Situation Calculus and the Fluent Calculus are successful possibility to compare extensions made separately for the action formalisms that share many concepts. But until now two calculi, such as concurrency. Furthermore it might even there is no formal relation between the two calculi that would allow to formally analyze the relationship between the two allow to translate current or future extensions made only for approaches as well as between the programming languages one of the calculi to the other. based on them, Golog and FLUX. Furthermore, such a formal Golog is a programming language for intelligent agents relation would allow to combine Golog and FLUX and to ana- that combines elements from classical programming (condi- lyze which of the underlying computation principles is better tionals, loops, etc.) with reasoning about actions. Primitive suited for different classes of programs. We develop a for- statements in Golog programs are actions to be performed mal translation between domain axiomatizations of the Situ- by the agent. Conditional statements in Golog are composed ation Calculus and the Fluent Calculus and present a Fluent of fluents. The execution of a Golog program requires to Calculus semantics for Golog programs. For domains with reason about the effects of the actions the agent performs, deterministic actions our approach allows an automatic trans- lation of Golog domain descriptions and execution of Golog in order to determine the values of fluents when evaluating programs with FLUX.
  • The Features-And-Fluents Semantics for the Fluent Calculus

    The Features-And-Fluents Semantics for the Fluent Calculus

    The Features-and-Fluents Semantics for the Fluent Calculus Michael Thielscher and Thomas Witkowski Department of Computer Science Dresden University of Technology, Germany Abstract fluent calculus, is expressive enough to be applicable to the full test suite of example reasoning problems in (Sandewall Based on an elaborate ontological taxonomy, the Features- 1994), let alone to be provably sound and complete wrt. one and-Fluents framework provides an independent action se- of the more expressive ontological classes in the taxonomy. mantics for assessing the range of applicability of action cal- culi. In this paper, we show how the fluent calculus can In this paper, we present a version of the fluent calculus be used to capture the full range of phenomena in K-IA, that is sufficiently expressive to capture K-IA, which is the the broadest ontological class that has been fully formalized broadest class that has been rigorously formalized and in- in (Sandewall 1994). To this end, we develop a significant tensively studied in (Sandewall 1994) and in which correct extension of the fluent calculus for modeling actions with du- knowledge and a fully inertial world is assumed. To this rations and with specific trajectories of changes. We present a end, we develop a significant extension of the basic fluent provably correct translation of scenario descriptions from the calculus by introducing an explicit model for the duration Features-and-Fluents semantics into fluent calculus axioma- of actions and for trajectories of changes. On this basis, we tizations. present a translation function that maps any K-IA scenario into a fluent calculus axiomatization, and we prove that the Introduction intended models of the former coincide with the classical models of the latter.
  • Fluent Tips & Tricks

    Fluent Tips & Tricks

    FluentFluent TipsTips && TricksTricks UGMUGM 20042004 Sutikno Wirogo Samir Rida 1/ 75 Outline List of Tips and Tricks collected from: Solution database available through the Online Technical Support (OTS) portal http://www.fluentusers.com Frequently Asked Questions Know-how of Fluent’s technical staff This presentation provides Tips and Tricks: For IO and Batch For Case Set-up and Mesh For Solving For Post-Processing For Reporting 2/ 75 This presentation provides Tips and Tricks: For IO and Batch For Case Set-up and Mesh For Solving For Post-Processing For Reporting 3/ 75 Miscellaneous on Parallel IO In parallel, the mesh is first read into the host and then distributed to the compute nodes If reading case into parallel solver takes unusually long time, do the following: • Merge as many zones as possible • Put the host and compute-node-0 on the same machine • Put the case and data files on a disk on the machine running the host and compute-node-0 processes Parallel Fluent will allocate buffers for exchanging messages while reading and building the grid • Default buffer size depends of the case that is being read For 4 million cell case on 4 CPUs, the buffer size will be 4M/4 = 1M • To query buffer size, use the following scheme command: (%query-parallel-io-buffers) • If the host machine does not have enough memory, using a large buffer will slow down the read case stage and thus can limit the maximum buffer size using: (%limit-parallel-io-buffer-size 0) ¾ Needs to be executed before reading the case file ¾ Will increase
  • Fluent Getting Started Guide

    Fluent Getting Started Guide

    ANSYS Fluent Getting Started Guide ANSYS, Inc. Release 19.1 Southpointe April 2018 2600 ANSYS Drive Canonsburg, PA 15317 ANSYS, Inc. and [email protected] ANSYS Europe, Ltd. are UL http://www.ansys.com registered ISO (T) 724-746-3304 9001: 2008 (F) 724-514-9494 companies. Copyright and Trademark Information © 2018 ANSYS, Inc. Unauthorized use, distribution or duplication is prohibited. ANSYS, ANSYS Workbench, AUTODYN, CFX, FLUENT and any and all ANSYS, Inc. brand, product, service and feature names, logos and slogans are registered trademarks or trademarks of ANSYS, Inc. or its subsidiaries located in the United States or other countries. ICEM CFD is a trademark used by ANSYS, Inc. under license. CFX is a trademark of Sony Corporation in Japan. All other brand, product, service and feature names or trademarks are the property of their respective owners. FLEXlm and FLEXnet are trademarks of Flexera Software LLC. Disclaimer Notice THIS ANSYS SOFTWARE PRODUCT AND PROGRAM DOCUMENTATION INCLUDE TRADE SECRETS AND ARE CONFID- ENTIAL AND PROPRIETARY PRODUCTS OF ANSYS, INC., ITS SUBSIDIARIES, OR LICENSORS. The software products and documentation are furnished by ANSYS, Inc., its subsidiaries, or affiliates under a software license agreement that contains provisions concerning non-disclosure, copying, length and nature of use, compliance with exporting laws, warranties, disclaimers, limitations of liability, and remedies, and other provisions. The software products and documentation may be used, disclosed, transferred, or copied only in accordance with the terms and conditions of that software license agreement. ANSYS, Inc. and ANSYS Europe, Ltd. are UL registered ISO 9001: 2008 companies. U.S. Government Rights For U.S.
  • Programming with Windows Forms

    Programming with Windows Forms

    A P P E N D I X A ■ ■ ■ Programming with Windows Forms Since the release of the .NET platform (circa 2001), the base class libraries have included a particular API named Windows Forms, represented primarily by the System.Windows.Forms.dll assembly. The Windows Forms toolkit provides the types necessary to build desktop graphical user interfaces (GUIs), create custom controls, manage resources (e.g., string tables and icons), and perform other desktop- centric programming tasks. In addition, a separate API named GDI+ (represented by the System.Drawing.dll assembly) provides additional types that allow programmers to generate 2D graphics, interact with networked printers, and manipulate image data. The Windows Forms (and GDI+) APIs remain alive and well within the .NET 4.0 platform, and they will exist within the base class library for quite some time (arguably forever). However, Microsoft has shipped a brand new GUI toolkit called Windows Presentation Foundation (WPF) since the release of .NET 3.0. As you saw in Chapters 27-31, WPF provides a massive amount of horsepower that you can use to build bleeding-edge user interfaces, and it has become the preferred desktop API for today’s .NET graphical user interfaces. The point of this appendix, however, is to provide a tour of the traditional Windows Forms API. One reason it is helpful to understand the original programming model: you can find many existing Windows Forms applications out there that will need to be maintained for some time to come. Also, many desktop GUIs simply might not require the horsepower offered by WPF.
  • The Calculus of Newton and Leibniz CURRENT READING: Katz §16 (Pp

    The Calculus of Newton and Leibniz CURRENT READING: Katz §16 (Pp

    Worksheet 13 TITLE The Calculus of Newton and Leibniz CURRENT READING: Katz §16 (pp. 543-575) Boyer & Merzbach (pp 358-372, 382-389) SUMMARY We will consider the life and work of the co-inventors of the Calculus: Isaac Newton and Gottfried Leibniz. NEXT: Who Invented Calculus? Newton v. Leibniz: Math’s Most Famous Prioritätsstreit Isaac Newton (1642-1727) was born on Christmas Day, 1642 some 100 miles north of London in the town of Woolsthorpe. In 1661 he started to attend Trinity College, Cambridge and assisted Isaac Barrow in the editing of the latter’s Geometrical Lectures. For parts of 1665 and 1666, the college was closed due to The Plague and Newton went home and studied by himself, leading to what some observers have called “the most productive period of mathematical discover ever reported” (Boyer, A History of Mathematics, 430). During this period Newton made four monumental discoveries 1. the binomial theorem 2. the calculus 3. the law of gravitation 4. the nature of colors Newton is widely regarded as the most influential scientist of all-time even ahead of Albert Einstein, who demonstrated the flaws in Newtonian mechanics two centuries later. Newton’s epic work Philosophiæ Naturalis Principia Mathematica (Mathematical Principles of Natural Philosophy) more often known as the Principia was first published in 1687 and revolutionalized science itself. Infinite Series One of the key tools Newton used for many of his mathematical discoveries were power series. He was able to show that he could expand the expression (a bx) n for any n He was able to check his intuition that this result must be true by showing that the power series for (1+x)-1 could be used to compute a power series for log(1+x) which he then used to calculate the logarithms of several numbers close to 1 to over 50 decimal paces.
  • Practical Migration to Linux on System Z

    Practical Migration to Linux on System Z

    Front cover Practical Migration to Linux on System z Overview and migration methodology Migration analysis Hands-on migration case study Lydia Parziale Joseph Apuzzo Saulo Augusto M Martins da Silva Louis Henderson Manoj Srinivasan Pattabhiraman Richard Sewell ibm.com/redbooks International Technical Support Organization Practical Migration to Linux on System z October 2009 SG24-7727-00 Note: Before using this information and the product it supports, read the information in “Notices” on page xi. First Edition (October 2009) This edition applies to z/VM Version 5.3 and Version 5.4, Novell SUSE Linux Enterprise Server Version 10 and Version 11, and Red Hat Enterprise Linux Version 5.3. © Copyright International Business Machines Corporation 2009. All rights reserved. Note to U.S. Government Users Restricted Rights -- Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Notices . xi Trademarks . xii Preface . xv The team who wrote this book . xv Become a published author . xviii Comments welcome. xviii Part 1. Overview and migration methodology . 1 Chapter 1. Migration considerations . 3 1.1 Reason to migrate systems. 4 1.1.1 How green is your data center . 4 1.1.2 The IBM Big Green server consolidation . 7 1.2 Benefits of migrating to Linux on System z . 7 1.3 Reasons to select Linux on System z . 9 1.3.1 System z strengths . 10 1.3.2 Value of Linux on System z. 12 1.3.3 Choosing workloads to migrate to IBM System z . 13 1.4 z/VM virtualization for Linux on IBM System z .