(Enter summary)
Abstract: This paper presents the constraint system FT, which we feel is
an intriguing alternative to Herbrand both theoretically and practically.
As does Herbrand, FT provides a universal data structure
based on trees. However, the trees of FT (called feature trees) are
more general than the trees of Herbrand (called constructor trees),
and the constraints of FT are finer grained and of different expressivity.
The basic notion of FT are functional attributes called
features, which provide for... (Update)
Context of citations to this paper: More
...i.e. by specifying relationships between its nodes. Motivated by constraint programming, Smolka proposed an alternative approach [6, 11, 49, 48, 7, 9] based on an external view in which record structures are described by relations to others. The internal view was modeled...
...constraints is efficiently decidable. More about the logic and algorithmic properties of record and tuple constraints can be found in [15, 3, 1, 2]. 3 The Actor Model The actor model is the informal computation model underlying Oz. It can be seen as a computational metaphor for...
Cited by: More
A Calculus for Higher-order Concurrent Constraint Programming.. - Smolka (1994)
(Correct)
Operational Semantics of Constraint Logic Programs with.. - Podelski, Gert (1995)
(Correct)
Feature Automata and Recognizable Sets of Feature Trees - Niehren, Podelski (1993)
(Correct)
Similar documents (at the sentence level):
60.4%: A Feature Constraint System for Logic Programming with.. - Aït-Kaci, Podelski, Smolka (1992)
(Correct)
Active bibliography (related documents): More All
0.5: A Feature-based Constraint System for Logic.. - Hassan Aït-Kaci.. (1992)
(Correct)
0.1: Feature Automata and Sets of Feature Trees - Niehren, Podelski (1993)
(Correct)
0.1: Records for Logic Programming - Smolka, Treinen (1994)
(Correct)
Similar documents based on text: More All
1.0: Ordering Constraints over Feature Trees - Müller, Niehren (1999)
(Correct)
0.8: Ordering Constraints over Feature Trees Expressed in.. - Müller, Niehren
(Correct)
0.7: The First-Order Theory of Ordering Constraints over Feature .. - Müller, Niehren, Treinen
(Correct)
Related documents from co-citation: More All
8: Records for logic programming
- Smolka, Treinen - 1994
7: Towards the meaning of LIFE
- Ait-Kaci, Podelski - 1991
6: Logic semantics for a class of committed-choice programs (context) - Maher - 1987
BibTeX entry: (Update)
Hassan At-Kaci, Andreas Podelski, and Gert Smolka. A feature-based constraint system for logic programming with entailment. In Proceedings of the 5th International Conference on Fifth Generation Computer Systems, pages 1012--1022, Tokyo, Japan (June 1992). ICOT. (Full paper to appear in Theoretical Computer Science). http://citeseer.ist.psu.edu/81966.html More
@misc{ at-kaci92featurebased,
author = "H. At-Kaci and A. Podelski and G. Smolka",
title = "A feature-based constraint system for logic programming with entailment",
text = "Hassan At-Kaci, Andreas Podelski, and Gert Smolka. A feature-based constraint
system for logic programming with entailment. In Proceedings of the 5th
International Conference on Fifth Generation Computer Systems, pages 1012--1022,
Tokyo, Japan (June 1992). ICOT. (Full paper to appear in Theoretical Computer
Science).",
year = "1992",
url = "citeseer.ist.psu.edu/81966.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
166
Unification revisited (context) - Lassez, Maher et al. - 1988 ACM DBLP
151
Logic semantics for a class of committedchoice programs (context) - Maher - 1987
94
Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984 DBLP
93
Feature constraint logics for unification grammars
- Smolka - 1992
86
Attribute-Value Logic and the Theory of Grammar (context) - Johnson - 1988
80
Functional grammar (context) - Kay - 1979
72
Kernel Andorra Prolog and its computation model
- Haridi, Janson - 1990 ACM DBLP
63
German Research Center for Artificial Intelligence (context) - Backofen, Smolka et al. - 1992
52
Towards a Meaning of LIFE (context) - At-Kaci, Podelski - 1991
45
A complete logical calculus for record structures representi.. (context) - Rounds, Kasper - 1986 DBLP
35
An algebraic semantics approach to the effective resolution .. (context) - At-Kaci - 1986 ACM DBLP
29
Inheritance hierarchies: Semantics and unification (context) - Smolka, At-Kaci - 1989 ACM DBLP
21
A constraint sequent calculus (context) - Lassez, McAloon - 1990 ACM DBLP
19
Technology and Science of Informatics (context) - Colmerauer, Kanoui et al. - 1983
18
LOGIN:A logic programming language with built-in inheritance (context) - At-Kaci, Nasr - 1986
17
Constraint Logic Programming and the Unification of Informat.. (context) - Mukai - 1991
16
Lisp and Symbolic Computation (context) - At-Kaci, Nasr et al. - 1989
11
Partially specified terms in logic programming for linguisti.. (context) - Mukai - 1988
7
Elements of a theory of tree codes (context) - Nivat - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.isg.sfu.ca/life/): More
Our Mandate - Investigate And
(Correct)
The Typed Polymorphic Label-Selective lambda-Calculus - Garrigue, Aït-Kaci (1993)
(Correct)
LIFE - A Natural Language for Natural Language - Aït-Kaci, Lincoln (1989)
(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