Temporally Annotated Extended Logic Programs

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

 One of the Possible Causes for Diatom Appearance in Ariake Bay Area in Japan In the Winter from 2010 to 2015 (Clarified with AQUA/MODIS)

 One of the possible causes for diatom appearance in Ariake bay area I Japan in the winter seasons from 2010 to 2015 is clarified with AQUA/MODIS of remote sensing satellite. Two months (January and February) AQUA/M...

 A Semantic-Aware Data Management System for Seismic Engineering Research Projects and Experiments

 The invention of the Semantic Web and related technologies is fostering a computing paradigm that entails a shift from databases to Knowledge Bases (KBs). There the core is the ontology that plays a main role in en...

 The Mobile Version of the Predicted Energy Efficient Bee-Inspired Routing (PEEBR)

 In this paper, the previously proposed Predictive Energy Efficient Bee-inspired Routing (PEEBR) family of routing optimization algorithms based on the Artificial Bees Colony (ABC) Optimization model is extended fro...

 Enhanced Tunneling Technique for Flow-Based Fast Handover in Proxy Mobile Ipv6 Networks

 In the Mobile IPv6 network, each node is highly mobile and handoff is a very common process. When not processed efficiently, the handoff process may result in large amount of packet loss. If the handover process is...

Download PDF file
  • EP ID EP114407
  • DOI -
  • Views 118
  • Downloads 0

How To Cite

Anastasia Analyti, Ioannis Pachoulakis (2012). Temporally Annotated Extended Logic Programs. International Journal of Advanced Research in Artificial Intelligence(IJARAI), 1(7), 20-26. https://europub.co.uk/articles/-A-114407