Finite failure is and-compositional

DOI10.1093/LOGCOM/7.6.753MaRDI QIDQ4381868zbMATH OpenOpenAlexFDO

Authors Roberta Gori, Giorgio Levi

Publication date 25 March 1998

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/9e139a2c9d8cf51d81c19c8001fd382b703e628f

zbMATH Keywords

finite failureSLD-trees

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• scientific article; zbMATH DE number 1405454
• Finite failures and partial computations in concurrent logic languages
• Levationis Laus
• General failure of logic programs

Cited in

(5)

• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
• On the verification of finite failure
• scientific article; zbMATH DE number 1487845 (Why is no real title available?)
• scientific article; zbMATH DE number 4197405 (Why is no real title available?)
• Finite failures and partial computations in concurrent logic languages

This page was built for publication: Finite failure is and-compositional

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