Ralf Treinen  Home/Search
Context Related
| ps.unisb.de/Papers/...FeatArbStruct.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 presents a family of first order feature tree theories, indexed by the theory of the feature labels used to build the trees. A given feature label theory, which is required to carry an appropriate notion of sets, is conservatively extended to a theory of feature trees with the predicates x[t]y (feature t leads from the root of tree x to the tree y), where we have to require t to be a ground term, and xt# (feature t is defined at the root of tree x). In the latter case, t might... (Update)
Context of citations to this paper: More
.... constraints have been introduced in [31] A decidable feature logic where feature symbols have first class status has been investigated in [34]. 3.4 Inductive Properties We start this section by a demonstration of the expressivity of FT and show that we can express in FT...
.... been introduced in [28] A decidable feature logic where feature and label symbols have first class status has been investigated in [31]. The next formula is crucial for our undecidability proof. A tree t satisfies this formula iff fe;cg D t fcg and all its nodes are...
Cited by: More
On Relational Analysis of Algebraic Datatypes - Kuncak, Jackson (Correct)
Structural Subtyping of Non-Recursive Types is Decidable - Kuncak, Rinard (2003) (Correct)
The First-Order Theory of Ordering Constraints over Feature .. - Müller, Niehren, Treinen (Correct)
Similar documents (at the sentence level):
56.5%: Feature Trees over Arbitrary Structures - Treinen (1997) (Correct)
Active bibliography (related documents): More All
0.8: Ordering Constraints over Feature Trees Expressed in.. - Müller, Niehren (Correct)
0.7: Ordering Constraints over Feature Trees - Müller, Niehren (1999) (Correct)
0.5: Type Inference for First-Class Messages with Feature Constraints - Müller, al. (Correct)
Similar documents based on text: More All
0.5: Records for Logic Programming - Smolka, Treinen (1994) (Correct)
0.4: How to Win a Game with Features - Backofen, Treinen (1994) (Correct)
0.4: An Improved Lower Bound for the Elementary Theories of Trees - Vorobyov (1996) (Correct)
Related documents from co-citation: More All
4: Complete axiomatizations of the algebras of finite (context) - Maher - 1988
4: A complete axiomatization of a theory with feature and arity constraints - Backofen - 1995
4: The Computational Complexity of Logical Theories (context) - Ferrante, Rackoff - 1979
BibTeX entry: (Update)
Ralf Treinen. Feature trees over arbitrary structures. In Patrick Blackburn and Maarten de Rijke, editors, Specifying Syntactic Structures, chapter 7, pages 185--211. CSLI Publications and FoLLI, 1997. http://citeseer.ist.psu.edu/treinen97feature.html More
@misc{ treinen97feature,
author = "R. Treinen",
title = "Feature trees over arbitrary structures",
text = "Ralf Treinen. Feature trees over arbitrary structures. In Patrick Blackburn
and Maarten de Rijke, editors, Specifying Syntactic Structures, chapter
7, pages 185--211. CSLI Publications and FoLLI, 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/treinen97feature.html" }
Citations (may not include all citations):374 Automata on infinite objects (context) - Thomas ACM DBLP
221 Constraint logic programming (context) - Jaffar, Lassez - 1987 ACM DBLP
176 a decision method in restricted second order arithmetic (context) - Buchi - 1960
151 An Introduction to Mathematical Logic and Type Theory: To Tr.. (context) - Andrews - 1986 ACM
119 LOGIN: A logic programming language with built-in inheritanc.. (context) - Ait-Kaci, Nasr - 1986
117 Semantic domains - Gunter, Scott ACM DBLP
105 Records for logic programming - Smolka, Treinen - 1994 DBLP
93 Feature constraint logics for unification grammars - Smolka - 1992
86 Attribute-Value Logic and the Theory of Grammar (context) - Johnson - 1988
78 Handbook of Theoretical Computer Science (context) - van Leeuwen - 1990 ACM
75 Object-oriented concurrent constraint programming in Oz - Henz, Smolka et al. - 1995 ACM DBLP
70 Equational problems and disunification (context) - Comon, Lescanne - 1989 ACM DBLP
45 A complete logical calculus for record structures representi.. (context) - Rounds, Kasper - 1986 DBLP
44 Encyclopedia of Mathematics and its Applications (context) - Hodges - 1993 ACM
35 An algebraic semantics approach to the effective resolution .. (context) - Ait-Kaci - 1986 ACM DBLP
31 On subsumption and semiunification in feature algebras (context) - Dorre, Rounds - 1992 ACM DBLP
29 Inheritance hierarchies: Semantics and unification (context) - Smolka, Ait-Kaci - 1989 ACM DBLP
28 The definition of Kernel Oz - Smolka - 1995 ACM DBLP
23 A complete axiomatization of a theory with feature and arity.. - Backofen - 1995 DBLP
16 Feature constraints with first-class features - Treinen - 1993
15 Theoretical Computer Science (context) - Backofen, Smolka et al. ACM
14 Feature-logic with weak subsumption constraints - Dorre - 1994
12 Towards a meaning of LIFE - Ait-Kaci, Podelski - 1991 DBLP
11 A feature-based constraint system for logic programming with.. - Ait-Kaci, Podelski et al. - 1994 DBLP
11 Decidability of second-order theories and automata on infini.. (context) - Rabin - 1969
11 How to win a game with features - Backofen, Treinen - 1994 ACM DBLP
8 Regular path expressions in feature logic - Backofen - 1994 ACM DBLP
7 A decidability result for a second order process logic (context) - Parikh - 1978 DBLP
3 Philosophische Fakultat der Universitat Stuttgart (context) - Dorre, Semiunfikation - 1993
3 A new method for undecidability proofs of first order theori.. - Treinen - 1992
1 Expressivity and Decidability of First-Order Theories over F.. (context) - Backofen - 1994
1 Axiomatizable classes of locally free algebras of various ty.. (context) - Malc'ev - 1936
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