Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
Program Updating by Incremental and Answer Subsumption Tabling
September 2013
PU-LPNMR-2013
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.
In proceedings
Ari Saptawijaya, Luís Moniz Pereira
Pedro Cabalar, Tran Cao Son
Proceedings 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)
LNAI
Springer
http://www.springer.com/computer/ai/book/978-3-642-40563-1
8148
479-484
978-3-642-40563-1
-
http://centria.di.fct.unl.pt/~lmp/publications/online-papers/evolpR.pdf
http://link.springer.com/chapter/10.1007/978-3-642-40564-8_47
Export formats
Ari Saptawijaya and Luís Moniz Pereira, Program Updating by Incremental and Answer Subsumption Tabling, in: Pedro Cabalar and Tran Cao Son (eds), Proceedings 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), LNAI, Springer, http://www.springer.com/computer/ai/book/978-3-642-40563-1, Vol. 8148, ISBN 978-3-642-40563-1, Pag. 479-484, (http://link.springer.com/chapter/10.1007/978-3-642-40564-8_47), http://centria.di.fct.unl.pt/~lmp/publications/online-papers/evolpR.pdf, September 2013.
<a href="/people/members/view.php?code=3296a2fcb759ac3f30bc313a41f955bc" class="author">Ari Saptawijaya</a> and <a href="/people/members/view.php?code=6175f826202ff877fba2ad77784cb9cb" class="author">Luís Moniz Pereira</a>, <b>Program Updating by Incremental and Answer Subsumption Tabling</b>, in: Pedro Cabalar and Tran Cao Son (eds), <u>Proceedings 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)</u>, LNAI, <a href="http://www.springer.com" title="Link to external entity..." target="_blank" class="publisher">Springer</a>, http://www.springer.com/computer/ai/book/978-3-642-40563-1, Vol. 8148, ISBN 978-3-642-40563-1, Pag. 479-484, (<a href="http://link.springer.com/chapter/10.1007/978-3-642-40564-8_47" target="_blank">url</a>), <i>http://centria.di.fct.unl.pt/~lmp/publications/online-papers/evolpR.pdf</i>, September 2013.
@inproceedings {PU-LPNMR-2013, author = {Ari Saptawijaya and Lu\'{\i}s Moniz Pereira}, editor = {Pedro Cabalar and Tran Cao Son}, title = {Program Updating by Incremental and Answer Subsumption Tabling}, booktitle = {Proceedings 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)}, series = {LNAI}, publisher = {Springer}, address = {http://www.springer.com/computer/ai/book/978-3-642-40563-1}, volume = {8148}, pages = {479-484}, isbn = {978-3-642-40563-1}, note = {http://centria.di.fct.unl.pt/~lmp/publications/online-papers/evolpR.pdf}, url = {http://link.springer.com/chapter/10.1007/978-3-642-40564-8_47}, 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.}, keywords = {logic program updates, incremental tabling, answer subsumption tabling}, month = {September}, year = {2013}, }
Publication's urls
/publications/view.php?code=5fbdc8aacb19c1fd6416a29850a28881
/publications/view.php?code=PU-LPNMR-2013
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT