Finite failures and partial computations in concurrent logic languages

DOI10.1016/0304-3975(90)90061-LzbMath0702.68079OpenAlexW1974891472WikidataQ127586774 ScholiaQ127586774MaRDI QIDQ915476

Giorgio Levi, Moreno Falaschi

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90061-l

zbMATH Keywords

parallelismconcurrencycommit operatorconcurrent logic languagesparallel computation rule

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Artificial intelligence (68T99)

Related Items (3)

An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. ⋮ A theory of observables for logic programs ⋮ Bottom-up abstract interpretation of logic programs

Uses Software

• PARLOG
• GHC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• PARLOG: parallel programming in logic
• Contributions to the Theory of Logic Programming

This page was built for publication: Finite failures and partial computations in concurrent logic languages