Martin Müller, Joachim Niehren, Ralf Treinen  Home/Search
Context
Related
Links: ACM DBLP | ps.unisb.de/Paper...bTheoryLICS98.ps ps.unisb.de/Papers...FTSubTheory98.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: The system FT of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT and its fragments, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We determine the complexity of the entailment problem of FT with existential... (Update)
Similar documents (at the sentence level):
41.9%: The First-Order Theory of Ordering Constraints over Feature .. - Müller, Niehren, Treinen (2001) (Correct)
16.8%: The First-Order Theory of Ordering Constraints over.. - Müller, Niehren.. (Correct)
Active bibliography (related documents): More All
0.8: Ordering Constraints over Feature Trees Expressed in.. - Müller, Niehren (Correct)
0.5: Programming Constraint Services - Schulte (2002) (Correct)
0.5: Ordering Constraints over Feature Trees - Müller, Niehren, Podelski (1997) (Correct)
Similar documents based on text: More All
0.7: A Feature-based Constraint System for Logic Programming .. - Aït-Kaci, Podelski.. (1992) (Correct)
0.7: Dominance Constraints: Algorithms and Complexity - Koller, Niehren, Treinen (1998) (Correct)
0.6: Feature Trees over Arbitrary Structures - Treinen (1997) (Correct)
BibTeX entry: (Update)
@misc{ ller-firstorder,
author = "Martin Müller and Joachim Niehren and Ralf Treinen",
title = "The First-Order Theory of Ordering Constraints over Feature Trees",
url = "citeseer.ist.psu.edu/581889.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
620 Head-Driven Phrase Structure Grammar - Pollard, Sag - 1994
344 Concurrent Constraint Programming (context) - Saraswat - 1993 ACM DBLP
246 Lexical-functional grammar: A formal system for grammatical .. (context) - Kaplan, Bresnan - 1982
243 An Introduction to Unification-based Approaches to Grammar (context) - Shieber - 1986
241 Decidability of second-order theories and automata on infini.. (context) - Rabin - 1969
151 Logic semantics for a class of committedchoice programs (context) - Maher - 1987
105 Records for logic programming - Smolka, Treinen - 1994 DBLP
93 Feature constraint logics for unification grammars - Smolka - 1992
81 Generalized finite automata theory with an application to a .. (context) - Thatcher, Wright - 1968
79 A logical semantics for feature structures - Kasper, Rounds - 1986 ACM
68 Subtyping constrained types - Trifonov, Smith - 1996 ACM DBLP
57 The Logic of Typed Feature Structures - with Applications to.. (context) - Carpenter - 1992
52 Simplifying subtyping constraints - Pottier - 1996 ACM DBLP
42 Feature logics - Rounds - 1997
36 A practical subtyping system for Erlang - Marlow, Wadler - 1997 ACM DBLP
36 Efficient inference of object types - Palsberg - 1994
31 On subsumption and semiunification in feature algebras (context) - Dorre, Rounds - 1990 ACM DBLP
30 A new method for undecidability proofs of first order theori.. - Treinen - 1992 ACM DBLP
29 The complexity of subtype entailment for simple types - Henglein, Rehof - 1997 ACM DBLP
25 Type checking higher-order polymorphic multi-methods - Bourdoncle, Merz - 1997 ACM
23 A complete axiomatization of a theory with feature and arity.. - Backofen - 1995
21 An improved lower bound for the elementary theories of trees - Vorobyov - 1996
21 A feature-based constraint system for logic programming with.. (context) - At-Kaci, Podelski et al. - 1994
15 Theoretical Computer Science (context) - Backofen, Smolka et al. - 1995 ACM
14 Feature logics with weak subsumption constraints - Dorre - 1991
13 Constraint automata and the complexity of recursive subtype .. - Henglein, Rehof - 1998 ACM DBLP
9 Feature trees over arbitrary structures - Treinen - 1997 ACM
9 Ordering constraints over feature trees expressed in second-.. (context) - Muller, Niehren - 1998
7 Ordering constraints over feature trees (context) - Muller, Niehren et al. - 1997 ACM DBLP
5 Set-based Failure Diagnosis for Concurrent Constraint Progra.. (context) - Muller - 1998
4 Ordering constraints over feature trees with ordered sorts (context) - Muller - 1997
2 Integrating efficient records into concurrent constraint pro.. - Van Roy, Mehl et al. - 1996 ACM DBLP
http://www.ps.uni-sb.de/Papers/
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