A linear operational semantics for termination and complexity analysis of ISO prolog

DOI10.1007/978-3-642-32211-2_16zbMATH Open1377.68068OpenAlexW2113956592MaRDI QIDQ4909327FDOQ4909327

Authors: Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs 

Publication date: 13 March 2013

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32211-2_16

Recommendations

• On computational complexity of Prolog programs
• scientific article; zbMATH DE number 65740
• scientific article; zbMATH DE number 19144
• scientific article; zbMATH DE number 18622
• Comparative semantics for prolog with cut

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cited In (8)

• Selective Unification in (Constraint) Logic Programming*
• Title not available (Why is that?)
• Concolic testing in logic programming
• On computational complexity of Prolog programs
• Concolic testing in CLP
• An SMT-based concolic testing tool for logic programs
• Reversible debugging in logic programming
• Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

This page was built for publication: A linear operational semantics for termination and complexity analysis of ISO prolog

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