Efficient access mechanisms for tabled logic programs
From MaRDI portal
Publication:4223452
DOI10.1016/S0743-1066(98)10013-4zbMath0911.68033DBLPjournals/jlp/RamakrishnanRSSW99OpenAlexW2091478774WikidataQ58968546 ScholiaQ58968546MaRDI QIDQ4223452
Prasad M. S. V. Rao, I. V. Ramakrishnan, Terrance Swift, Konstantinos Sagonas, David S. Warren
Publication date: 4 May 1999
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0743-1066(98)10013-4
Related Items (14)
The YAP Prolog system ⋮ XSB: Extending Prolog with Tabled Logic Programming ⋮ The language features and architecture of B-Prolog ⋮ Top-down and Bottom-up Evaluation Procedurally Integrated ⋮ Table space designs for implicit and explicit concurrent tabled evaluation ⋮ Tabling, Rational Terms, and Coinduction Finally Together! ⋮ Incremental Tabling in Support of Knowledge Representation and Reasoning ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Towards multi-threaded local tabling using a common table space ⋮ Efficient tabling of structured data with enhanced hash-consing ⋮ The limits of fixed-order computation ⋮ ILP :- Just Trie It
Uses Software
This page was built for publication: Efficient access mechanisms for tabled logic programs
