Bounded quantifications for iteration and concurrency in logic programming

DOI10.1007/BF03037340MaRDI QIDQ1326573zbMATH OpenFDO

Authors Jonas Barklund

Publication date 18 May 1994

Published in New Generation Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF03037340

zbMATH Keywords

arraysbounded quantificationdata parallelismdefinite interactionlogic programming languagesparallel computationPrologquantifiers

Mathematics Subject Classification ID

Logic programming (68N17)

Cites work

• First order compiler: A deterministic logic program synthesis algorithm
• scientific article; zbMATH DE number 3965422 (Why is no real title available?)
• scientific article; zbMATH DE number 3965423 (Why is no real title available?)
• scientific article; zbMATH DE number 4074449 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 48041 (Why is no real title available?)
• scientific article; zbMATH DE number 1337623 (Why is no real title available?)
• scientific article; zbMATH DE number 512900 (Why is no real title available?)
• scientific article; zbMATH DE number 516984 (Why is no real title available?)
• scientific article; zbMATH DE number 517039 (Why is no real title available?)
• scientific article; zbMATH DE number 194921 (Why is no real title available?)
• scientific article; zbMATH DE number 788038 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 970730 (Why is no real title available?)
• Making prolog more expressive
• MULTILISP: a language for concurrent symbolic computation
• {log}: A language for programming in logic with finite sets

Cited in

(12)

• Bounded-wait merge in Shapiro's concurrent Prolog
• The expressive power of the bounded-iteration construct
• scientific article; zbMATH DE number 1337623 (Why is no real title available?)
• scientific article; zbMATH DE number 512900 (Why is no real title available?)
• scientific article; zbMATH DE number 516984 (Why is no real title available?)
• On the convergence of query-bounded computations and logical closure properties of c.e. sets
• scientific article; zbMATH DE number 1954107 (Why is no real title available?)
• Representing any-time and program-iteration by infinitary conjunction
• scientific article; zbMATH DE number 6820296 (Why is no real title available?)
• scientific article; zbMATH DE number 2090530 (Why is no real title available?)
• scientific article; zbMATH DE number 970730 (Why is no real title available?)
• Bounded nondeterminism of logic programs

Describes a project that uses

Uses Software

• Multilisp
• Haskell
• GHC

This page was built for publication: Bounded quantifications for iteration and concurrency in logic programming

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