Theory of partial-order programming

DOI10.1016/S0167-6423(98)00018-5MaRDI QIDQ1806132zbMATH OpenOpenAlexFDO

Authors Bharat Jayaraman, David A. Plaisted, Mauricio Osorio Galindo

Publication date 27 June 2000

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6423(98)00018-5

zbMATH Keywords

declarative programmingpartial-order clauses

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Partial order programming (revisited)
• Semantics of partial-order programs
• Partial evaluation in logic programming
• scientific article; zbMATH DE number 1738693

Cited in

(6)

• Logic programming with solution preferences
• Modality Argumentation Programming
• scientific article; zbMATH DE number 4007715 (Why is no real title available?)
• Semantics of partial-order programs
• Partial order programming (revisited)
• A general theory of confluent rewriting systems for logic programming and its applications

This page was built for publication: Theory of partial-order programming

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