Terminating evaluation of logic programs with finite three-valued models

DOI10.1145/2629337zbMATH Open1354.68039OpenAlexW2108205915WikidataQ58063706 ScholiaQ58063706MaRDI QIDQ2946744FDOQ2946744

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

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

zbMATH Keywords

terminationtabled logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

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

Cited In (5)

• A Terminating Evaluation-Driven Variant of G3i
• The distribution semantics for normal programs with function symbols
• Title not available (Why is that?)
• Using linear constraints for logic program termination analysis
• Title not available (Why is that?)

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)