Terminating Evaluation of Logic Programs with Finite Three-Valued Models

DOI10.1145/2629337zbMath1354.68039OpenAlexW2108205915WikidataQ58063706 ScholiaQ58063706MaRDI QIDQ2946744

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

terminationtabled logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (4)

The distribution semantics for normal programs with function symbols ⋮ Unnamed Item ⋮ Using linear constraints for logic program termination analysis ⋮ Unnamed Item

Uses Software

• Gringo
• Terminyzer
• XSB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data exchange: semantics and query answering
• Termination of floating-point computations
• Termination of narrowing via termination of rewriting
• XSB: Extending Prolog with Tabled Logic Programming
• Automated termination proofs for logic programs by term rewriting
• Query-Driven Procedures for Hybrid MKNF Knowledge Bases
• Non-termination analysis of logic programs with integer arithmetics
• A decidable subclass of finitary programs
• Disjunctive ASP with functions: Decidable queries and effective computation
• On finitely recursive programs
• Efficient access mechanisms for tabled logic programs
• The well-founded semantics for general logic programs
• Termination of logic programs: the never-ending story
• Tabled evaluation with delaying for general logic programs
• Classes of terminating logic programs
• Inference of termination conditions for numerical loops in Prolog
• Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
• One More Decidable Class of Finitely Ground Programs
• On the Termination of Logic Programs with Function Symbols
• Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3
• A practical analysis of non-termination in large logic programs
• Logic Programming
• Logic Programming
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Computable Functions in ASP: Theory and Implementation
• Termination proofs for logic programs with tabling

This page was built for publication: Terminating Evaluation of Logic Programs with Finite Three-Valued Models