Amanote Research

Amanote Research

    RegisterSign In

Query Proof Structure Caching for Incremental Evaluation of Tabled Prolog Programs

doi 10.5121/csit.2014.4129
Full Text
Open PDF
Abstract

Available in full text

Date

January 2, 2014

Authors
Taher AliZiad NajemMohd Sapiyan
Publisher

Academy & Industry Research Collaboration Center (AIRCC)


Related search

A Tabled Prolog Program for Solving Sokoban

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

A Tabled Prolog Program for Solving Sokoban

2011English

Retroactive Subsumption-Based Tabled Evaluation of Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Extracting Proofs From Tabled Proof Search

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

A Practical Type Analysis for Verification of Modular Prolog Programs

2008English

Programs as Collections of Communicating Prolog Units

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1986English

Service Differentiation for Collaborative Caching Query Process in Mobile Database

2011English

Efficient and Self-Tuning Incremental Query Expansion for Top-K Query Processing

2005English

Graph-Aware, Workload-Adaptive SPARQL Query Caching

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy