Terminating evaluation of logic programs with finite three-valued models

DOI10.1145/2629337MaRDI QIDQ2946744zbMATH OpenOpenAlexWikidataFDO

Authors Fabrizio Riguzzi, Terrance Swift

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2629337

zbMATH Keywords

tabled logic programmingtermination

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Termination proofs for logic programs with tabling
• Tabled evaluation with delaying for general logic programs
• Termination of simply-moded well-typed logic programs under a tabled execution mechanism
• On the termination of logic programs with function symbols
• Strong termination of logic programs

Cites work

• A decidable subclass of finitary programs
• A practical analysis of non-termination in large logic programs
• Automated termination proofs for logic programs by term rewriting
• Classes of terminating logic programs
• Compiling \(\mathrm{input}^\ast\) FO\((\cdot)\) inductive definitions into tabled prolog rules for IDP3
• Computable Functions in ASP: Theory and Implementation
• Data exchange: semantics and query answering
• Disjunctive ASP with functions: decidable queries and effective computation
• Efficient access mechanisms for tabled logic programs
• Finitely recursive programs: decidability and bottom-up computation
• scientific article; zbMATH DE number 3982556 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 1487801 (Why is no real title available?)
• scientific article; zbMATH DE number 1931693 (Why is no real title available?)
• Inference of termination conditions for numerical loops in Prolog
• Logic Programming
• Logic Programming
• Non-termination analysis of logic programs with integer arithmetics
• On finitely recursive programs
• On the termination of logic programs with function symbols
• One More Decidable Class of Finitely Ground Programs
• Query-driven procedures for hybrid MKNF knowledge bases
• Tabled evaluation with delaying for general logic programs
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Termination of floating-point computations
• Termination of logic programs: the never-ending story
• Termination of narrowing via termination of rewriting
• Termination proofs for logic programs with tabling
• The well-founded semantics for general logic programs
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
• XSB: extending Prolog with tabled logic programming

Cited in

(6)

• A Terminating Evaluation-Driven Variant of G3i
• The distribution semantics for normal programs with function symbols
• Using linear constraints for logic program termination analysis
• Coalgebraic semantics for probabilistic logic programming
• scientific article; zbMATH DE number 7649893 (Why is no real title available?)
• A semantics for probabilistic hybrid knowledge bases with function symbols

Describes a project that uses

Uses Software

• Gringo
• Terminyzer
• XSB

This page was built for publication: Terminating evaluation of logic programs with finite three-valued models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946744)