Temporally Annotated Extended Logic Programs
Journal Title: International Journal of Advanced Research in Artificial Intelligence(IJARAI) - Year 2012, Vol 1, Issue 7
Abstract
Extended logic programs (ELPs) are a set of logic rules with strong negation allowed in the bodies or head of the rules and weak negation ~ allowed in the bodies of the rules. ELPs enable for various forms of reasoning that cannot be achieved by definite logic programs. Answer Set Programming provides a widely acceptable semantics for ELPs. However, ELPs do not provide information regarding the temporal intervals that derived ELP literals or weakly negated ELP literals are valid. In this paper, we associate ELP rules with their validity temporal interval, resulting in a temporally annotated logic program. A ground temporal literal has the form L:i, where L is a ground ELP literal or weakly negated ELP literal and i is a temporal interval. We define (simple) entailment and maximal entailment of a ground temporal literal L:i from a temporally annotated logic program C. Both kinds of entailment are based on Answer Set Programming. Additionally, we provide an algorithm that for an ELP literal or a weakly negated ELP literal L returns a list with all temporal intervals i such that a temporally annotated logic program C maximally entails L:i. Based on this algorithm, the answer of various kinds of temporal queries can be provided.
Authors and Affiliations
Anastasia Analyti, Ioannis Pachoulakis
Keywords
Related Articles
- EP ID EP114407
- DOI -
- Views 119
- Downloads 0
Sensitivity Analysis and Error Analysis of Reflectance Based Vicarious Calibration with Estimated Aerosol Refractive Index and Size Distribution Derived from Measured Solar Direct and Diffuse Irradiance as well as Measured Surface Reflectance
Sensitivity analysis and error of reflectance based vicarious calibration with estimated aerosol refractive index and size distribution derived from measured solar direct and diffuse irradiance as well as measured surfac...
Analysis of Security Protocols using Finite-State Machines
This paper demonstrates a comprehensive analysis method using formal methods such as finite-state machine. First, we describe the modified version of our new protocol and briefly explain the encrypt-then-authentica...
Hybrid Metaheuristics for the Unrelated Parallel Machine Scheduling to Minimize Makespan and Maximum Just-in-Time Deviations
This paper studies the unrelated parallel machine scheduling problem with three minimization objectives – makespan, maximum earliness, and maximum tardiness (MET-UPMSP). The last two objectives combined are related...
Design and Implementation of Rough Set Algorithms on FPGA: A Survey
Rough set theory, developed by Z. Pawlak, is a powerful soft computing tool for extracting meaningful patterns from vague, imprecise, inconsistent and large chunk of data. It classifies the given knowledge base app...
Method for 3D Image Representation with Reducing the Number of Frames based on Characteristics of Human Eyes
Method for 3D image representation with reducing the number of frames based on characteristics of human eyes is proposed together with representation of 3D depth by changing the pixel transparency. Through experime...