Program Updating by Incremental and Answer Subsumption Tabling

Ari Saptawijaya, Luis Moniz Pereira

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We propose a novel conceptual approach to program updates implementation that exploits two features of tabling in logic programming (in XSB Prolog): incremental and answer subsumption tabling. Our approach, EVOLP/R, is based on the constructs of Evolving Logic Programs (EVOLP), but simplifies it at first by restricting updates to fluents only. Rule updates are nevertheless achieved via the mechanism of rule name fluents, placed in rules' bodies, permitting to turn rules on or off, through assertions or retractions of their corresponding unique name fluents. Incremental tabling of fluents allows to automatically maintain - at engine level - the consistency of program states. Answer subsumption of fluents addresses the frame problem - at engine level - by automatically keeping track of their latest assertion or retraction. The implementation is detailed here to the extent that it may be exported to other logic programming tabling systems.

Original languageEnglish
Title of host publicationLOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR 2013)
EditorsP Cabalar, TC Son
PublisherSPRINGER-VERLAG BERLIN
Pages479-484
Number of pages6
ISBN (Print)978-3-642-40564-8
Publication statusPublished - 2013
Event12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) - Corunna, Spain
Duration: 15 Sep 201319 Sep 2013

Publication series

NameLecture Notes in Computer Science
PublisherSPRINGER-VERLAG BERLIN
Volume8148
ISSN (Print)0302-9743

Conference

Conference12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)
CountrySpain
CityCorunna
Period15/09/1319/09/13

Keywords

  • logic program updates
  • incremental tabling
  • answer subsumption tabling

Cite this