525 search results - page 44 / 105 » Composing Programs in a Rewriting Logic for Declarative Prog... |
AGP
1997
IEEE
14 years 1 hour ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
AGP
1998
IEEE
14 years 1 days ago
1998
IEEE
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
ICDE
1993
IEEE
13 years 12 months ago
1993
IEEE
The IsaLog model and language are presented. The model has complex objects with classes, relations, and isa hierarchies. The language is strongly typed and declarative. The main i...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...