Table space designs for implicit and explicit concurrent tabled evaluation

DOI10.1017/S147106841800039XzbMath1452.68035arXiv1806.00441OpenAlexW2963431915WikidataQ129482663 ScholiaQ129482663MaRDI QIDQ4559837

Miguel Areias, Ricardo Rocha

Publication date: 4 December 2018

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.00441

zbMATH Keywords

implementationtablingconcurrencytable space

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Logic programming (68N17)

Uses Software

• YAP-Prolog
• B-Prolog
• Cilk
• XSB
• OPTYap
• Intel TBB
• Eden

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lock-free parallel dynamic programming
• Parallel ILP for distributed-memory architectures
• The YAP Prolog system
• XSB: Extending Prolog with Tabled Logic Programming
• The language features and architecture of B-Prolog
• On combining linear-based strategies for tabled evaluation of logic programs
• Efficient access mechanisms for tabled logic programs
• Tabled evaluation with delaying for general logic programs
• Tabling as a library with delimited control
• On applying or-parallelism and tabling to logic programs
• Towards multi-threaded local tabling using a common table space
• Parallel functional programming in Eden
• NB{\texttt{malloc}}: Allocating memory in a lock-free manner

This page was built for publication: Table space designs for implicit and explicit concurrent tabled evaluation