An Efficient and Flexible Engine for Computing Fixed Points

Abstract

An efficient and flexible engine for computing fixed-points is critical for many practical applications. In this paper, first, we present a goal-directed fixed-point computation strategy for the logic programming paradigm. Our strategy adopts tabled resolution (or memoized resolution) to mimic efficient semi-naive bottom-up computation. Its main idea is to… (More)

10 Figures and Tables

Topics

  • Presentations referencing similar topics