Enumeration of success patterns in logic programs

DOI10.1016/0304-3975(84)90119-1MaRDI QIDQ1348532zbMATH OpenOpenAlexFDO

Authors Taisuke Sato, Hisao Tamaki

Publication date 13 May 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(84)90119-1

Mathematics Subject Classification ID

Artificial intelligence (68T99)

Cited in

(11)

• S-semantics for logic programming: a retrospective look
• Non-strict independence-based program parallelization using sharing and freeness information
• Existential continuation
• Frameworks for abstract interpretation
• Most specific logic programs
• Set-sharing is redundant for pair-sharing
• On the verification of finite failure
• An analysis of the equational properties of the well-founded fixed point
• Abstract interpretation of temporal concurrent constraint programs
• On the complexity of dataflow analysis of logic programs
• Efficient bottom-up execution of logic programs using abstract interpretation

This page was built for publication: Enumeration of success patterns in logic programs

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