EUVIMEDEUVIMED entdecken
Crossref

Terminating Evaluation of Logic Programs with Finite Three-Valued Models

Fabrizio Riguzzi, Terrance Swift

ACM Transactions on Computational Logic · 2014-08 · 15 (4) · 1-38

DOI: 10.1145/2629337 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Computational Logic, online erschienen am 12.09.2014. Verfasst von Fabrizio Riguzzi und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 51 Literaturangaben. Gefördert von: Fundação para a Ciência e a Tecnologia.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

As evaluation methods for logic programs have become more sophisticated, the classes of programs for which termination can be guaranteed have expanded. From the perspective of ar set programs that include function symbols, recent work has identified classes for which grounding routines can terminate either on the entire program [Calimeri et al. 2008] or on suitable queries [Baselice et al. 2009]. From the perspective of tabling, it has long been known that a tabling technique called subgoal abstraction provides good termination properties for definite programs [Tamaki and Sato 1986], and this result was recently extended to stratified programs via the class of bounded term-size programs [Riguzzi and Swift 2013]. In this article, we provide a formal definition of tabling with subgoal abstraction resulting in the SLG SA algorithm. Moreover, we discuss a declarative characterization of the queries and programs for which SLG SA terminates. We call this class strongly bounded term-size programs and show its equivalence to programs with finite well-founded models. For normal programs, strongly bounded term-size programs strictly includes the finitely ground programs of Calimeri et al. [2008]. SLG SA has an asymptotic complexity on strongly bounded term-size programs equal to the best known and produces a residual program that can be sent to an answer set programming system. Finally, we describe the implementation of subgoal abstraction within the SLG-WAM of XSB and provide performance results.

Förderung

  • Fundação para a Ciência e a Tecnologia

Zitieren

APA

Riguzzi, F., & Swift, T. (2014). Terminating Evaluation of Logic Programs with Finite Three-Valued Models. ACM Transactions on Computational Logic, 15(4), 1-38. https://doi.org/10.1145/2629337

Vancouver

Riguzzi F, Swift T. Terminating Evaluation of Logic Programs with Finite Three-Valued Models. ACM Transactions on Computational Logic. 2014;15(4):1-38. doi:10.1145/2629337

BibTeX
@article{Riguzzi2014,
  author = {Riguzzi, Fabrizio and Swift, Terrance},
  title = {Terminating Evaluation of Logic Programs with Finite Three-Valued Models},
  journal = {ACM Transactions on Computational Logic},
  year = {2014},
  volume = {15},
  number = {4},
  pages = {1--38},
  doi = {10.1145/2629337}
}
Kostenlos starten →