The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Digital Archiving Policy
  • Promote your Publication
  • Metadata Harvesting (OAI2)

IJACSA

  • About the Journal
  • Call for Papers
  • Editorial Board
  • Author Guidelines
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Fees/ APC
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving

Special Issues

  • Home
  • Archives
  • Proposals
  • Guest Editors
  • SUSAI-EE 2025
  • ICONS-BA 2025
  • IoT-BLOCK 2025

Future of Information and Communication Conference (FICC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Computing Conference

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Archives
  • Indexing

DOI: 10.14569/IJARAI.2012.010704
PDF

Temporally Annotated Extended Logic Programs

Author 1: Anastasia Analyti
Author 2: Ioannis Pachoulakis

International Journal of Advanced Research in Artificial Intelligence(IJARAI), Volume 1 Issue 7, 2012.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

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.

Keywords: Extended logic programs; validity temporal intervals; temporal inference; query answering.

Anastasia Analyti and Ioannis Pachoulakis, “Temporally Annotated Extended Logic Programs” International Journal of Advanced Research in Artificial Intelligence(IJARAI), 1(7), 2012. http://dx.doi.org/10.14569/IJARAI.2012.010704

@article{Analyti2012,
title = {Temporally Annotated Extended Logic Programs},
journal = {International Journal of Advanced Research in Artificial Intelligence},
doi = {10.14569/IJARAI.2012.010704},
url = {http://dx.doi.org/10.14569/IJARAI.2012.010704},
year = {2012},
publisher = {The Science and Information Organization},
volume = {1},
number = {7},
author = {Anastasia Analyti and Ioannis Pachoulakis}
}



Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

IJACSA

Upcoming Conferences

Computer Vision Conference (CVC) 2026

16-17 April 2026

  • Berlin, Germany

Healthcare Conference 2026

21-22 May 2026

  • Amsterdam, The Netherlands

Computing Conference 2025

19-20 June 2025

  • London, United Kingdom

IntelliSys 2025

28-29 August 2025

  • Amsterdam, The Netherlands

Future Technologies Conference (FTC) 2025

6-7 November 2025

  • Munich, Germany
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Paper
  • Indexing

Our Conferences

  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference
  • Communication Conference

Help & Support

  • Contact Us
  • About Us
  • Terms and Conditions
  • Privacy Policy

© The Science and Information (SAI) Organization Limited. All rights reserved. Registered in England and Wales. Company Number 8933205. thesai.org