Markus Hohfeld, Gert Smolka  Home/Search
Context Related
| ps.unisb.de/Papers/abstract...LL53.ps ps.unisb.de/Papers/abstract...LR53.ps Cached: PS.gz PS This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PDF Image Update HelpPS.gz PS From: ps.unisb.de/Papers/abstracts/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper shows that the nice properties of logic programs extend to definite clause specifications over arbitrary constraint languages. The notion of a constraint language sees a constraint as a piece of syntax with unknown internal structure that constrains the values variables can take in interpretations. Examples of constraint languages are Predicate Logic and its sublanguages as well as attributive concept description languages developed for knowledge representation. (Update)
Context of citations to this paper: More
...feature age is defined and yields the value assigned to y. The notion of constraint used here is worked out in a more general form in [13]. 14 Let I be a feature algebra. An I assignment is a mapping from the set of all variables to the domain of I. We use ASS[I] to denote...
...framework for constraint logic programming with residuation. The two theorems given in this section are consequences of the results in [10]. We assume that a constraint system and a set of definite relation symbols are given, where the definite relation symbols take a...
Cited by: More
The Algebraic Structure of Attributed Type Signatures - Penn (2000) (Correct)
A Compositional Semantic Basis for the Analysis of.. - Alpuente, Falaschi.. (1996) (Correct)
Compositional Analysis for - Programs (Correct)
Similar documents (at the sentence level):
54.6%: Logic Programming over Polymorphically Order-Sorted Types - Smolka (1989) (Correct)
Similar documents based on text: More All
0.4: Towards a Meaning of LIFE - Aït-Kaci, Podelski (1992) (Correct)
0.3: Compiling HPSG constraint grammars into logic programs - Götz (1995) (Correct)
0.3: The Complexity Of Maximal Constraint Languages - Bulatov, Krokhin, Jeavons (2001) (Correct)
Related documents from co-citation: More All
18: Constraint Logic Programming (context) - Jaffar, Lassez - 1987
13: Constraint logic programming (context) - Ja, Jean-Louis - 1987
11: Feature constraint logics for unification grammars - Smolka - 1992
BibTeX entry: (Update)
M. Hohfeld and G. Smolka. Definite relations over constraint languages. Technical report, IBM Deutschland GmbH, Stuttgart, 1988. http://citeseer.ist.psu.edu/hohfeld88definite.html More
@techreport{ hohfeld88definite,
author = "M. Hohfeld and Gert Smolka",
title = "Definite Relations over Constraint Languages",
number = "53",
year = "1988",
url = "citeseer.ist.psu.edu/hohfeld88definite.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ps.uni-sb.de/Papers/abstracts/): More
Set-Based Failure Analysis for Logic Programs and.. - Podelski, Charatonik, .. (1999) (Correct)
Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura (Correct)
Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC