Semantics and termination of simply-moded logic programs with dynamic scheduling

DOI10.1007/3-540-45309-1_27MaRDI QIDQ2763687zbMATH OpenFDO

Authors Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus

Publication date 21 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2028/20280402

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Termination of simply moded logic programs with dynamic scheduling
• Semantics of well-moded input consuming logic programs
• Program Development in Computational Logic
• Logic Programming
• Algebraic and logical semantics for CLP languages with dynamic scheduling

Cited in

(8)

• Constraint logic programming with dynamic scheduling: A semantics based on closure operators
• Semantics of well-moded input consuming logic programs
• Independence in dynamically scheduled logic languages
• Algebraic and logical semantics for CLP languages with dynamic scheduling
• Termination of simply moded logic programs with dynamic scheduling
• Inferring non-suspension conditions for logic programs with dynamic scheduling
• Logic Programming
• Program Development in Computational Logic

This page was built for publication: Semantics and termination of simply-moded logic programs with dynamic scheduling

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