Finite failure is and-compositional

DOI10.1093/logcom/7.6.753zbMath0892.68016OpenAlexW2059194615MaRDI QIDQ4381868

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

SLD-treesfinite failure

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

On the verification of finite failure ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.

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