Finite failures and partial computations in concurrent logic languages
From MaRDI portal
Publication:915476
Recommendations
Cites work
- Contributions to the Theory of Logic Programming
- Declarative modeling of the operational behavior of logic languages
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
- Fundamentals of artificial intelligence. An advanced course
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 41233 (Why is no real title available?)
- scientific article; zbMATH DE number 193216 (Why is no real title available?)
- PARLOG: parallel programming in logic
Cited in
(6)- Bottom-up abstract interpretation of logic programs
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
- A theory of observables for logic programs
- scientific article; zbMATH DE number 3951990 (Why is no real title available?)
- Finite failure is and-compositional
- scientific article; zbMATH DE number 4197405 (Why is no real title available?)
This page was built for publication: Finite failures and partial computations in concurrent logic languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915476)