Results 1 
9 of
9
Abstract machines for programming language implementation
 FUTURE GENERATION COMPUTER SYSTEMS
, 2000
"... We present an extensive, annotated bibliography of the abstract machines designed for each of the main programming paradigms (imperative, object oriented, functional, logic and concurrent). We conclude that whilst a large number of efficient abstract machines have been designed for particular langua ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
We present an extensive, annotated bibliography of the abstract machines designed for each of the main programming paradigms (imperative, object oriented, functional, logic and concurrent). We conclude that whilst a large number of efficient abstract machines have been designed for particular language implementations, relatively little work has been done to design abstract machines in a systematic fashion.
Efficient Evaluation of Normal Logic Programs
, 1994
"... An accident of implementation may be responsible for the fact that Logic Programming, Deductive Databases and NonMonotonic Reasoning are different subfields. Logic Programming views logic as a programming language  usually through Prolog or an extension of Prolog. The Deductive Database communi ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
An accident of implementation may be responsible for the fact that Logic Programming, Deductive Databases and NonMonotonic Reasoning are different subfields. Logic Programming views logic as a programming language  usually through Prolog or an extension of Prolog. The Deductive Database community regards logic as a database language, often using a variant of magic sets as a basis for implementation. Finally the field of NonMonotonic Reasoning studies nonclassical logics of interest to Artificial Intelligence or other applications. However, there are currently few engines powerful enough to execute practical programs in NonMonotonic Reasoning. Tabling methods have been formulated recently that have the potential to unify these subfields. This thesis explores how to efficiently implement one such meth...
Concurrent Inference through Dual Transformation
, 1998
"... This paper presents two somewhat independent results and sketches a mechanism that could tie these results together to form an automated theorem proving method. The first point is a correct and complete inference method for firstorder logic based on the transformation between conjunctive and disjun ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper presents two somewhat independent results and sketches a mechanism that could tie these results together to form an automated theorem proving method. The first point is a correct and complete inference method for firstorder logic based on the transformation between conjunctive and disjunctive canonical normal forms. This method, although apparently very ine#cient, presents interesting properties, such as not presenting external inference rules. The second point is a concurrent algorithm for dual transformation. This algorithm is presented in a general framework that can be specialized to model several formal systems. Finally, based on the representation adopted to define the algorithm, a dual transformation theorem proving method is sketched. 1 Keywords: firstorder logic, dual transformation, inference, knowledge representation 1 Introduction The introduction by Robinson [28] of the Resolution method and by Smullyan [30] of the Semantic Tableaux method for automated theo...
A MultiAgent Approach to FirstOrder Logic
 In Proceedings of 8 th Portuguese Conference on Artificial Intelligence (EPIA'97
, 1997
"... This paper presents a hierarchical heterogeneous multiagent society based on a hypercube parallel architecture able to manage, in a distributed way, a firstorder logic knowledge base and to draw inferences from it. The knowledge base is structured into theories, composed by sets of formulas. The a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents a hierarchical heterogeneous multiagent society based on a hypercube parallel architecture able to manage, in a distributed way, a firstorder logic knowledge base and to draw inferences from it. The knowledge base is structured into theories, composed by sets of formulas. The adopted internal representation of these theories consists of both canonical forms of the formulas that define them. The inference method underlying the deductive capabilities of the architecture is based on the fact that the two canonical forms of a set of formulas can used as a generalized inference rule, giving rise to a complete logical inference method. A prototype of the proposed knowledge representation system, where concurrence is sequentially simulated, has been implemented in Common Lisp/CLOS. Content Areas: AgentOriented Programming, Automated Reasoning, Knowledge Representation, Theorem Proving. 1 Introduction Any knowledge representation system based in firstorder logic has to...
A nonshared binding scheme for parallel Prolog implementation
 Proc. Int. Joint Conf. on Artificial Intelligence
, 1991
"... To allow efficient parallel processing of Prolog programs on distributed multiprocessors, a nonshared variable binding approach is required such that binding environments can be independently distributed among processors. This paper presents a binding scheme, which realises the independence of a cl ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
To allow efficient parallel processing of Prolog programs on distributed multiprocessors, a nonshared variable binding approach is required such that binding environments can be independently distributed among processors. This paper presents a binding scheme, which realises the independence of a clause's binding environment by eagerly instantiating variables across clause arguments. The application of the scheme on a Prolog virtual machine has illustrated its features of efficiency in execution and simplicity in implementation. The preliminary performance evaluation has demonstrated the feasibility of the scheme. 1
• Module systems • Debuggers • Dynamic code
"... • The WAM has been known for over 20 years •... so why are there a lot of Prologs? ..."
Abstract
 Add to MetaCart
• The WAM has been known for over 20 years •... so why are there a lot of Prologs?
EFFICIENT EVALUATION OF NORMAL LOGIC PROGRAMS
, 1994
"... 1994 An accident of implementation may be responsible for the fact that Logic Programming, Deductive Databases and NonMonotonic Reasoning are different subfields. Logic Programming views logic as a programming language implemented through Prolog or an extension of Prolog. The Deductive Database c ..."
Abstract
 Add to MetaCart
1994 An accident of implementation may be responsible for the fact that Logic Programming, Deductive Databases and NonMonotonic Reasoning are different subfields. Logic Programming views logic as a programming language implemented through Prolog or an extension of Prolog. The Deductive Database community regards logic as a database language, often implemented using a variant of magic sets as a basis for implementation. Finally the field of NonMonotonic Reasoning studies nonclassical logics of interest to Artificial Intelligence or other applications. However, there are currently few engines powerful enough to implement NonMonotonic Reasoning for practical programs. Recent formulations of tabling methods have the potential to unify these subfields. This thesis explores how to efficiently implement one such method: SLG. Previous formulations of SLG do not make explicit the search strategy for an evaluation, or consider tradeoffs between alternate search strategies. To bring out these features, an operational semantics for SLG, SLGO, is defined which makes explicit algorithms for completion and other operations. This formalism allows proofs of correctness of algorithms upon which the SLGWAM is based, as well as proofs of termination for programs of boundedterm size. The modelling of search strategy is also powerful enough to derive preliminary results for the cut/0 operator as extended to SLG, and for combining SLG and SLDNF using Existential Negation. Based on the SLGO search strategy, Part 2 describes the SLGWAM, an engine which evaluates SLG for stationary stratified programs, and integrates SLG with full Prolog functionality, including the cut, findall, and metapredicates. Data structures and instructions of the SLGWAM are described in detail. The SLGWAM is in fact the engine for the XSB system, and has been installed in hundreds of sites around the world. Part three analyzes the SLGWAM and compares its performance with the WAM and ii
Programming in Logic
"... This article describes the abstract model implicit in logic programming and compares it to the models used in conventional languages. A simple example in Prolog illustrates how programming in logic can provide a concise problem description while offering a very flexible framework to solve for unknow ..."
Abstract
 Add to MetaCart
This article describes the abstract model implicit in logic programming and compares it to the models used in conventional languages. A simple example in Prolog illustrates how programming in logic can provide a concise problem description while offering a very flexible framework to solve for unknowns. The last section of this article surveys the current fields of active research in the area of logic programming and concludes with a prognosis for the future of this method