Abstract metaprolog engine
Journal of Logic Programming
169 - 199
Item Usage Stats
MetadataShow full item record
A compiler-based meta-level system for MetaProlog language is presented. Since MetaProlog is a meta-level extension of Prolog, the Warren Abstract Machine (WAM) is extended to get an efficient implementation of meta-level facilities; this extension is called the Abstract MetaProlog Engine (AMPE). Since theories and proofs are main meta-level objects in MetaProlog, we discuss their representations and implementations in detail. First, we describe how to efficiently represent theories and derivability relations. At the same time, we present the core part of the AMPE, which supports multiple theories and a fast context switching among theories in the MetaProlog system. Then we describe how to compute proofs, how to shrink the search space of a goal using partially instantiated proofs, and how to represent other control knowledge in a WAM-based system. In addition to computing proofs that are just success branches of search trees, fail branches can also be computed and used in the reasoning process.
Knowledge Based Systems
Object Oriented Programming
PROLOG (Programming Language)
Abstract MetaProlog Engine
Warren Abstract Machine
Published Version (Please cite this version)https://doi.org/10.1016/S0743-1066(97)00075-7
Showing items related by title, author, creator and subject.
Dedeoğlu, Mehmet; Alp, Yaşar Kemal; Arıkan, Orhan (IEEE, 2014)Finite impulse response (FIR) filters have been a primary topic of digital signal processing since their inception. Although FIR filter design is an old problem, with the developments of fast convex solvers, convex modelling ...
Kian R.; Kargar K. (Elsevier, 2016)In this paper, we study the hub location problem with a power-law congestion cost and propose an exact solution approach. We formulate this problem in a conic quadratic form and use a strengthening method which rests on ...
Flener, Pierre (Springer, 1996-08)DIALOGS (Dialogue-based Inductive and Abductive LOGic program Synthesizer) is a schema-guided synthesizer of recursive logic programs; it takes the initiative and queries a (possibly computationally naive) specifier for ...