This note provides background information and references to the tutorial on recent research developments in logicprogramming inspired by needs of knowledge representation.
ISBN:
(纸本)9783540746089
This note provides background information and references to the tutorial on recent research developments in logicprogramming inspired by needs of knowledge representation.
In this paper we consider an extension of logicprogramming that tackles the SemanticWeb challenge of acquiring rules combined with ontologies. To face this bottleneck problem we propose a framework that resorts to th...
详细信息
This paper presents a parallel logicprogramming language named P-Prolog which is being developed as a logicprogramming language featuring both and- and or-parallelism. Compared with the other parallel logic programm...
详细信息
A standard approach to describe pictures is the use of formal grammars. This, and the strong link between definite clause grammars and logicprogramming, motivates the design of the declarative picture specification l...
详细信息
Open Answer Set programming (OASP) is a knowledge representation paradigm that allows for a tight integration of logicprogramming rules and Description logic ontologies. Although several decidable fragments of OASP e...
详细信息
We consider logicprogramming-like systems which are based on solving equations in a given structure as opposed to obtaining unifiers. While such systems are elegant from an operational point of view, a logical interp...
详细信息
作者：
Apt, KRUNIV AMSTERDAM
DEPT MATH COMP SCI PHYS & ASTRON 1018 TV AMSTERDAM NETHERLANDS
We claim that programming within the logicprogramming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constrai...
详细信息
We claim that programming within the logicprogramming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constraint logic programs which use iteration and arrays instead of explicit recursion and lists. These programs are substantially simpler than their counterparts written in the conventional way. They are easier to write and to understand, are guaranteed to terminate and their declarative character makes it simpler to argue about their correctness. Iteration is implemented by means of bounded quantification.
Although the sequential execution speed of logic programs has been greatly improved by the concepts introduced in the Warren Abstract Machine (WAM), parallel execution represents the only way to increase this speed be...
详细信息
We show how one can add negation and disjunction to Prolog, with the property that there is no overhead in run time if we do not use the negation, and we only pay for the negation when we actually use it. The extensio...
详细信息
暂无评论