A practical analysis of non-termination in large logic programs

DOI10.1017/S1471068413000446zbMath1286.68050MaRDI QIDQ5398306

Michael Kifer, Senlin Liang

Publication date: 27 February 2014

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

logic programmingtermination and non-termination analysisterminyzer

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols

Uses Software

• HiLog
• YAP-Prolog
• Terminyzer
• XSB

Cites Work

• An analysis of loop checking mechanisms for logic programs
• The YAP Prolog system
• XSB: Extending Prolog with Tabled Logic Programming
• The language features and architecture of B-Prolog
• An overview of Ciao and its design philosophy
• Automated termination analysis for logic programs with cut
• HiLog: A foundation for higher-order logic programming
• Logical foundations of object-oriented and frame-based languages
• Termination proofs for logic programs with tabling

This page was built for publication: A practical analysis of non-termination in large logic programs