Enumeration of success patterns in logic programs

DOI10.1016/0304-3975(84)90119-1zbMath0985.68554OpenAlexW1963910234MaRDI QIDQ1348532

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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item