Name
Abstract | ||
|---|---|---|
This paper presents a novel scheme for constraint logic programming, based on an abstract model of constraints that takes as primitive the notions of atomic constraint and substitution. It is shown that the constraint model generalizes the constraint languages of Hohfeld and Smolka (8), and fits well in the general framework proposed by Saraswat (17). The semantics of the proposed logic programming scheme is an immediate generalization of the semantics of Horn clause logic, and we show that it possesses simple char- acterizations of the operational, declarative and fixed-point semantics. The main motivation for this work was to formalize the notion of useful and con- cise answers to queries to hierarchic type systems. The paper ends with a simple example illustrating this application. |
Year | Venue | Keywords |
|---|---|---|
1992 | JICSLP | type system,fixed point |
Field | DocType | Citations |
Default logic,Computational logic,Horn clause,Description logic,Theoretical computer science,Prolog,Concurrent constraint logic programming,Logic programming,Dynamic logic (modal logic),Mathematics | Conference | 3 |
PageRank | References | Authors |
0.96 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Margarida Mamede | 1 | 40 | 6.46 |
| Luís Monteiro | 2 | 126 | 19.98 |