A declarative semantics of flat guarded Horn clauses for programs with perpetual processes

DOI10.1016/0304-3975(90)90062-MMaRDI QIDQ915481zbMATHFDO

Authors Masaki Murakami

Publication date 1990

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

zbMATH Keywords

concurrencyparallelismHorn logicconcurrent programming language

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 17798
• Contributions to the semantics of logic perpetual processes
• scientific article; zbMATH DE number 4125378
• NESTED GUARDED HORN CLAUSES
• scientific article; zbMATH DE number 4074449

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3951990 (Why is no real title available?)
• scientific article; zbMATH DE number 41233 (Why is no real title available?)
• scientific article; zbMATH DE number 3349291 (Why is no real title available?)
• Contributions to the Theory of Logic Programming
• Declarative modeling of the operational behavior of logic languages
• PARLOG: parallel programming in logic
• Truly concurrent constraint programming

Cited in

(2)

• scientific article; zbMATH DE number 4106262 (Why is no real title available?)
• scientific article; zbMATH DE number 17798 (Why is no real title available?)

Describes a project that uses

Uses Software

• PARLOG
• GHC

This page was built for publication: A declarative semantics of flat guarded Horn clauses for programs with perpetual processes

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