Skip to main content Accessibility help
×
Home

Incremental Tabling in Support of Knowledge Representation and Reasoning

  • TERRANCE SWIFT (a1)

Abstract

Resolution-based Knowledge Representation and Reasoning (KRR) systems, such as Flora-2, Silk or Ergo, can scale to tens or hundreds of millions of facts, while supporting reasoning that includes Hilog, inheritance, defeasibility theories, and equality theories. These systems handle the termination and complexity issues that arise from the use of these features by a heavy use of tabled resolution. In fact, such systems table by default all rules defined by users, unless they are simple facts.

Performing dynamic updates within such systems is nearly impossible unless the tables themselves can be made to react to changes. Incremental tabling as first implemented in XSB (Saha 2006) partially addressed this problem, but the implementation was limited in scope and not always easy to use. In this paper, we introduce transparent incremental tabling which at the semantic level supports updates in the 3-valued well-founded semantics, while guaranteeing full consistency of all tabled queries. Transparent incremental tabling also has significant performance improvements over previous implementations, including lazy recomputation, and control over the dependency structures used to determine how tables are updated.

Copyright

References

Hide All
Chen, W. and Warren, D. S. 1996. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM 43, 1, 2074.
Grosof, B. and Swift, T. 2013. Radial restraint: A semantically clean approach to bounded rationality for logic programs. In Conference of the American Association for Artificial Intelligence.
Hermenegildo, M., Puebla, G., Marriott, K., and Stuckey, P. 2000. Incremental Analysis of Constraint Logic Programs. ACM TOPLAS 22, 2 (March), 187223.
Hermenegildo, M. V., Bueno, F., Carro, M., López-Garciá, P., Mera, E., Morales, F., and Puebla, G. 2012. An overview of Ciao and its design philosophy. Theory and Practice of Logic Programming 12, 1-2, 219252.
ISO working group JTC1/SC22. 1995. Prolog international standard ISO-IEC 13211-1. Tech. rep., International Standards Organization.
Lloyd, J. and Topor, R. 1984. Making Prolog more expressive. Journal of Logic Programming 1, 3, 225240.
Naish, L. 2006. A three-valued semantics for logic programmers. Theory and Practice of Logic Programming 6, 5, 509538.
Ramakrishnan, C., Ramakrishnan, I., and Warren, D. S. 2007. XcelLog: A deductive spreadsheet system. Knowledge Engineering Review 22, 3, 269279.
Ramakrishnan, I. V., Rao, P., Sagonas, K., Swift, T., and Warren, D. S. 1999. Efficient access mechanisms for tabled logic programs. Journal of Logic Programming 38, 1, 3155.
Reece, J., Urry, L., Cain, M., Wasserman, S., Minorsky, P., and Jackson, R. 2010. Campbell Biology. B. Cummings. 9th Edition.
Riguzzi, F. and Swift, T. 2013. Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics. Theory and Practice of Logic Programming 13, 2, 279302.
Sagonas, K. and Swift, T. 1998. An abstract machine for tabled execution of fixed-order stratified logic programs. ACM TOPLAS 20, 3 (May), 586635.
Sagonas, K., Swift, T., and Warren, D. S. 2000. An abstract machine for efficiently computing queries to well-founded models. Journal of Logic Programming 45, 1–3, 141.
Saha, D. 2006. Incremental evaluation of tabled logic programs. Ph.D. thesis, SUNY Stony Brook.
Saha, D. and Ramakrishnan, C. 2005. Incemental and demand-driven points-to analysis using logic programming. In Principles and Practice of Declarative Programming. 117–128.
Santos Costa, V., Damas, L., and Rocha, R. 2012. The YAP prolog system. Theory and Practice of Logic Programming 12, 1-2, 534.
Swift, T. and Warren, D. 2012. XSB: Extending the power of Prolog using tabling. Theory and Practice of Logic Programming 12, 1-2, 157187.
Yang, G., Kifer, M., Wan, H., and Zhao, C. 2013. FLORA-2: User's Manual Version 0.99.3. http://flora.sourceforge.net.
Zhou, N. and Have, C. 2012. Efficient tabling of structured data with enhanced hash-consing. Theory and Practice of Logic Programming 12, 4-5, 547563.
Type Description Title
PDF
Supplementary materials

SWIFT
Incremental Tabling in Support of Knowledge Representation and Reasoning

 PDF (132 KB)
132 KB

Incremental Tabling in Support of Knowledge Representation and Reasoning

  • TERRANCE SWIFT (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed