Finite failures and partial computations in concurrent logic languages
From MaRDI portal
Publication:915476
DOI10.1016/0304-3975(90)90061-LzbMath0702.68079MaRDI QIDQ915476
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68N15: Theory of programming languages
68Q55: Semantics in the theory of computing
68T99: Artificial intelligence
Related Items
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
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item