Gert Smolka, Ralf Treinen  Home/Search
Context Related
| unh.edu/pub/csp/archiv...JICSLP92.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 From: unh.edu (more) (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... (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):
79.3%: Records for Logic Programming - Smolka, Treinen (1994) (Correct)
6.5%: A Complete Axiomatization of a Theory with Feature and Arity.. - Backofen (1995) (Correct)
5.0%: A Complete and Recursive Feature Theory - Backofen, Smolka (1993) (Correct)
Active bibliography (related documents): More All
0.3: A Feature-based Constraint System for Logic.. - Hassan Aït-Kaci.. (1992) (Correct)
0.2: A New Method for Undecidability Proofs of First Order Theories - Treinen (1992) (Correct)
0.2: First Order Data Types and First Order Logic - Treinen (1991) (Correct)
Similar documents based on text: More All
0.5: Feature Trees over Arbitrary Structures - Treinen (1997) (Correct)
0.3: Functional Computation in a Calculus of Relational.. - Joachim Niehren, Gert .. (1994) (Correct)
0.3: An Oz Primer - Smolka (1995) (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/smolka94records.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/smolka94records.html" }
Citations (may not include all citations):561 Constraint logic programming (context) - Jaffar, Lassez - 1987
344 Concurrent constraint programming (context) - Saraswat, Rinard - 1990
246 Lexical-Functional Grammar: A formal system for grammatical .. (context) - Kaplan, Bresnan - 1982
166 Unification revisited (context) - Lassez, Maher et al. - 1988
151 Logic semantics for a class of committed-choice programs (context) - Maher - 1987
119 LOGIN: A logic programming language with built-in inheritanc.. (context) - Ait-Kaci, Nasr - 1986
94 Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984
93 Feature constraint logics for unification grammars - Smolka - 1992
80 Functional grammar (context) - Kay - 1979
78 Efficiency of a good but not linear set union algorithm (context) - Tarjan - 1975
72 Prolog and infinite trees (context) - Colmerauer - 1982
63 German Research Center for Artificial Intelligence (context) - Backofen, Smolka et al. - 1992
63 German Research Center for Artificial Intelligence (context) - Smolka, Treinen et al. - 1992
52 Towards a meaning of LIFE (context) - Ait-Kaci, Podelski - 1991
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
23 ese de Doctorat d (context) - Huet, dans et al. - 1976
21 A constraint sequent calculus (context) - Lassez, McAloon - 1990
21 A feature-based constraint system for logic programming with.. (context) - Ait-Kaci, Podelski et al. - 1992
10 Typed feature structures: A generalization of first-order te.. (context) - Carpenter - 1991
8 Lisp and Symbolic Computation (context) - Ait-Kaci, Nasr et al. - 1989
5 Complete axiomatisations of the algebra of finite (context) - Maher - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.unh.edu.html): More
Csim - a Simple HP48 Circuit Simulator for Educational Purposes - Stenius (1992) (Correct)
Solving Geometric Constraint Systems - Kramer (1990) (Correct)
A Theorem-Proving Approach to Jobshop Scheduling - Toni (1994) (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