Abstract:
Justification is the process of constructing evidence, in terms of proof, for the truth or falsity of an answer derived by tabled evaluation. The evidence is most easily constructed by post-processing the memo tables created during query evaluation. In this paper we introduce online justification, based on program transformation, to efficiently construct the evidence during query evaluation, while adding little overhead to the evaluation itself. Apart from its efficiency, online justification separates evidence generation from exploration thereby providing flexibility in exploring the evidence either declaratively or procedurally. We present experimental results obtained on examples that construct large evidences which demonstrate the scalability of online justification.
Bibtex Entry:
@inproceedings{PGDRR:FLOPS04, author = {Giridhar Pemmasani and Haifeng Guo and Yifei Dong and C. R. Ramakrishnan and I. V. Ramakrishnan}, title = {Online Justification for Tabled Logic Programs}, booktitle = {International Functional and Logic Programming ({FLOPS})}, address = {Nara, Japan}, month = {April}, series = {Lecture Notes in Computer Science}, volume = {2998}, publisher = {Springer}, pages = {24--38}, year = {2004} }
| Full Paper: | [pdf] |
C. R. Ramakrishnan
(cram@cs.sunysb.edu)