NDLI: Terminating Evaluation of Logic Programs with Finite Three-Valued Models

Content Provider	ACM Digital Library
Author	Riguzzi, Fabrizio Swift, Terrance
Copyright Year	2014
Abstract	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.
Starting Page	1
Ending Page	38
Page Count	38
File Format	PDF
ISSN	15293785
e-ISSN	1557945X
DOI	10.1145/2629337
Volume Number	15
Issue Number	4
Journal	ACM Transactions on Computational Logic (TOCL)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-09-12
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Tabled logic programming Termination
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Logic Computational Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On proving left termination of constraint logic programs

Termination of simply moded logic programs with dynamic scheduling

Automated termination proofs for logic programs by term rewriting

Termination Analysis for Tabled Logic Programming (1997)

Strongly equivalent logic programs

Logic programs with propositional connectives and aggregates

Termination proofs for logic programs with tabling

Minimum model semantics for logic programs with negation-as-failure

A dynamic approach to characterizing termination of general logic programs

Terminating Evaluation of Logic Programs with Finite Three-Valued Models

Similar Documents

On proving left termination of constraint logic programs

Termination of simply moded logic programs with dynamic scheduling

Automated termination proofs for logic programs by term rewriting

Termination Analysis for Tabled Logic Programming (1997)

Strongly equivalent logic programs

Logic programs with propositional connectives and aggregates

Termination proofs for logic programs with tabling

Minimum model semantics for logic programs with negation-as-failure

A dynamic approach to characterizing termination of general logic programs

Terminating Evaluation of Logic Programs with Finite Three-Valued Models