Gert Smolka, Ralf Treinen  Home/Search
Context Related
| lri.fr/LRI/article...cordsLogProg.ps.gz isg.sfu.ca/dfkips...cordsLogProg.ps.gz unh.edu/pub/csp/archiv...RR9223.ps.gz Cached: PS.gz PS PDF 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.
Image Update HelpPS.gz PS PDF Problem Downloading? From: lri.fr/~treinen/publications (more) From: isg.sfu.ca/dfkips/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system employed in Prolog II, where finer-grained constraints are used, and where subtrees are identified by keywords rather than by position. CFT is defined by a first-order structure consisting of so-called feature trees. Feature trees generalize the ordinary trees corresponding to first-order terms by having their edges labeled ... (Update)
Cited by: More
Finite-Tree Analysis for Constraint Logic-Based.. - Bagnara, Gori, Hill, .. (2001) (Correct)
Finite-Tree Analysis for Constraint Logic-Based Languages - Bagnara, Gori, Hill.. (2001) (Correct)
J. LOGIC PROGRAMMING 1994:19, 20:1--679 1 Theory and.. - Thom Fruhwirth.. (Correct)
Similar documents (at the sentence level):
35.2%: Records for Logic Programming - Smolka, Treinen (1994) (Correct)
Active bibliography (related documents): More All
0.2: A Feature-based Constraint System for Logic.. - Hassan Aït-Kaci.. (1992) (Correct)
0.2: Improving Backward Execution in the Andorra Family of.. - Abreu, Pereira, Codognet (1992) (Correct)
0.2: Design for AKL with Intelligent Pruning - Abreu, Pereira (1993) (Correct)
Similar documents based on text: More All
0.5: Feature Trees over Arbitrary Structures - Treinen (1997) (Correct)
0.3: Feature Constraints with First-Class Features - Treinen (1993) (Correct)
0.2: DF - a Feature Constraint System and its Extension to a Logic.. - Ciortuz (Correct)
Related documents from co-citation: More All
27: Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984
23: Head-driven Phrase Structure Grammar - Pollard, Sag - 1994
22: Logic semantics for a class of committed-choice programs (context) - Maher - 1987
BibTeX entry: (Update)
Gert Smolka and Ralph Treinen. Records for logic programming. Journal of Logic Programming, 18(3):229--258, 1994. http://citeseer.ist.psu.edu/article/smolka94record.html More
@techreport{ smolka92records,
author = "Gert Smolka and Ralf Treinen",
title = "Records for Logic Programming",
number = "RR-92-23",
address = "Deutsches Forschungszentrum f{\"u}r K{\"u}nstliche Intelligenz GmbH\\Erwin-Schr{\"o}dinger Stra{ss}e\\Postfach 2080\\67608 Kaiserslautern\\Germany",
pages = "38",
year = "1992",
url = "citeseer.ist.psu.edu/article/smolka94record.html" }
Citations (may not include all citations):561 Constraint logic programming (context) - Jaffar, Lassez - 1987 ACM DBLP
344 Concurrent constraint programming (context) - Saraswat, Rinard - 1990 ACM DBLP
246 Lexical-Functional Grammar: A formal system for grammatical .. (context) - Kaplan, Bresnan - 1982
172 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
166 Unification revisited (context) - Lassez, Maher et al. - 1988 ACM DBLP
151 Logic semantics for a class of committed-choice programs (context) - Maher - 1987 DBLP
125 Warren's Abstract Machine: A Tutorial Reconstruction (context) - Ait-Kaci - 1991
118 Complete axiomatizations of the algebras of finite (context) - Maher - 1988
114 Programming paradigms of the Andorra kernel language - Janson, Haridi DBLP
114 Fundamental properties of infinite trees (context) - Courcelle - 1983 DBLP
105 Records for logic programming - Smolka, Treinen - 1992 DBLP
94 Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984 DBLP
93 Feature constraint logics for unification grammars - Smolka - 1992
84 The Design and Analysis of Algorithms (context) - Kozen - 1992 ACM
80 Functional grammar (context) - Kay - 1979
72 Prolog and infinite trees (context) - Colmerauer - 1982
54 SICStus Prolog Users's manual (context) - Carlsson, Wid'en et al. - 1991
52 Towards a meaning of LIFE (context) - Ait-Kaci, Podelski - 1991 DBLP
49 A Lattice-Theoretic Approach to Computation Based on a Calcu.. (context) - Ait-Kaci - 1984
39 An algebraic semantics approach to the effective resolution .. (context) - Ait-Kaci - 1986 ACM DBLP
33 A feature-based constraint system for logic programming with.. - Ait-Kaci, Podelski et al. - 1992 DBLP
23 ese de Doctorat d (context) - Huet, dans et al. - 1976
21 A constraint sequent calculus (context) - Lassez, McAloon - 1990 ACM DBLP
18 LOGIN: A logic programming language with built-in inheritanc.. (context) - Ait-Kaci, Nasr - 1986 ACM DBLP
17 A complete and recursive feature theory - Backofen, Smolka - 1993 ACM DBLP
16 Constraint-based query optimization for spatial databases - Helm, Marriott et al. - 1991 ACM DBLP
16 Feature constraints with first-class features - Treinen - 1993 ACM DBLP
14 Deutsches Forschungszentrum fur Kunstliche Intelligenz (context) - Backofen, Smolka et al. - 1992
10 Typed feature structures: A generalization of first-order te.. (context) - Carpenter DBLP
8 Lisp and Symbolic Computation (context) - Ait-Kaci, Nasr et al. - 1989
4 Logic Programming (context) - Saraswat, Ueda - 1991 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lri.fr/~treinen/publications.html): More
Constraint Deduction in an Interval-based Temporal Logic - Jana Koehler, Ralf Treinen (1993) (Correct)
A New Method for Undecidability Proofs of First Order Theories - Treinen (1992) (Correct)
Feature Constraints with First-Class Features - Treinen (1993) (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