## Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic (1998)

Venue: | Information and Computation |

Citations: | 8 - 4 self |

### BibTeX

@INPROCEEDINGS{Müller98orderingconstraints,

author = {Martin Müller and Joachim Niehren},

title = {Ordering Constraints over Feature Trees Expressed in Second-order Monadic Logic},

booktitle = {Information and Computation},

year = {1998},

pages = {196--210},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

The language FT of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. While the first-order theory of FT is well understood, only few decidability results are known for the first-order theory of FT . We introduce a new method for proving the decidability of fragments of the first-order theory of FT . This method is based on reduction to second order monadic logic that is decidable according to Rabin's famous tree theorem. The method applies to any fragment of the first-order theory of FT for which one can change the model towards sufficiently labeled feature trees -- a class of trees that we introduce. As we show, the first order-theory of ordering constraints over sufficiently labeled feature trees is equivalent to second-order monadic logic (S2S for infinite and WS2S for finite feature trees). We apply our method for proving that entailment of FT with existential quantifiers j 1 j=9x 1 : : :9x n j 2 is decidable. Previous results were restricted to entailment without existential quantifiers which can be solved in cubic time. Meanwhile, entailment with existential quantifiers has been shown PSPACE-complete (for finite and infinite feature trees respectively).

### Citations

11605 |
Johnson: Computers and Intractability: A guide to theory of NP hardness, Feeman and
- Garey, S
- 1979
(Show Context)
Citation Context ... coNP-hardness result of the previous section by the encoding discussed here applied to star-free regular languages. whose inclusion problem is known to be coNP-complete (e.g., see problem set AL9 in =-=[8]-=-). We nonetheless think that our proof is an interesting variation on Henglein and Rehofs idea which is worth being presented. 6 Lemma 6. The formula Q(x;S) has size linear in the size of S. Lemma 7. ... |

4178 |
J.D.: Introduction to Automata Theory, Languages, and Computation
- Hopcroft, Ullman
- 1979
(Show Context)
Citation Context ...s We show how to linearly reduce the inclusion problem between regular languages over finite words to the entailment problem j j= 9xj 0 over FT . Since this problem is wellknown to be PSPACE-complete =-=[10, 20]-=-, we obtain PSPACE-hardness of entailment. Theorem 4. Over infinite trees, the entailment problem of FT with existential quantificationsj j= 9xj 0 is PSPACE-hard. Proof. Follows from Proposition 5 bel... |

839 | The complexity of theorem-proving procedures
- Cook
- 1971
(Show Context)
Citation Context ...x). 4 3.1 Finite Trees We show that the entailment problem of FT with existential quantifiers over finite trees is coNP-hard by reducing the complement of the propositional satisfiability problem SAT =-=[6]-=- to it. Our encoding is based on an idea by Henglein's and Rehof's in [9]. They have considered entailment between ordering constraints over constructor trees (atomic subtyping) without existential qu... |

556 | Lexical-Functional Grammar: A formal system for grammatical representation - Kaplan, Bresnan - 1982 |

517 | Automata on Infinite Objects - Thomas - 1990 |

455 | An introduction to unification-based approaches to grammar - Shieber - 1986 |

313 | The Oz programming model - Smolka - 1995 |

302 | Decidability of second-order theories and automata on infinite trees - Rabin - 1969 |

212 | Reasoning and Revision in Hybrid Representation Systems - Nebel - 1990 |

203 | automata and logic - Thomas - 1997 |

194 | The tractability of subsumption in framebased description languages - Brachman, Levesque - 1984 |

186 | Construction Grammar - Kay - 1995 |

182 | Tree acceptors and some of their applications - Doner - 1970 |

173 | Generalized finite automata theory with an application to a decision problem of second-order logic - Thatcher, Wright - 1968 |

101 | Equations and Inequations on Finite and Infinite Trees - Colmerauer - 1984 |

99 | Records for logic programming - Smolka, Treinen - 1994 |

81 | The Formalism and Implementation f PATR-II - Shieber, Uszkoreit, et al. - 1983 |

78 |
Deciding equivalence of finite tree automata
- Seidl
- 1990
(Show Context)
Citation Context ...s We show how to linearly reduce the inclusion problem between regular languages over finite words to the entailment problem j j= 9xj 0 over FT . Since this problem is wellknown to be PSPACE-complete =-=[10, 20]-=-, we obtain PSPACE-hardness of entailment. Theorem 4. Over infinite trees, the entailment problem of FT with existential quantificationsj j= 9xj 0 is PSPACE-hard. Proof. Follows from Proposition 5 bel... |

71 | A feature-based constraint system for logic programming with entailment - Aït-Kaci, Podelski, et al. - 1994 |

55 | Representation and reasoning with attributive descriptions - Smolka, Nebel - 1989 |

35 | On subsumption and semiunification in feature algebras - Dörre, Rounds - 1990 |

34 | Feature logics - Rounds - 1997 |

33 | The Logic of Typed Feature Structures, volume 32 of Cambridge Tracts in Theoretical - Carpenter - 1992 |

32 | Towards a meaning of LIFE - At-Kaci, Podelski - 1993 |

28 | The complexity of subtype entailment for simple types
- Henglein, Rehof
- 1997
(Show Context)
Citation Context ...ith existential quantifiers is at least coNP-hard. We prove this result by encoding the complement of the SAT-Problem of Boolean formulas. Here, we adapt a proof idea introduced by Henglein and Rehof =-=[9]-=-. We prove that the entailment problem of FT with existential quantifiers j j= 9x 1 : : :9x n j 0 is decidable, both in the case of finite trees and in the case of infinite trees. In the case of finit... |

26 | G.: A complete and recursive feature theory - Backofen, Smolka - 1995 |

26 | An improved lower bound for the elementary theories of trees - Vorobyov - 1996 |

23 | Login: A logic programming language with built-in inheritance - At-Kaci, Nasr - 1986 |

22 | A Complete Axiomatization of a Theory with Feature and Arity Constraints - Backofen - 1995 |

19 | The first-order theory of ordering constraints over feature trees - Müller, Niehren, et al. - 1998 |

17 | An algebraic semantics approach to the effective resolution of type equations - At-Kaci - 1986 |

13 | Ordering constraints over feature trees - Müller, Niehren, et al. - 2000 |

8 | Partially specified terms in logic programming for linguistic analysis - Mukai |

7 | second-order monadic logic and tree automata - Sequentiality - 1995 |

7 | Feature logics with weak subsumption constraints - Dörre - 1991 |

6 | Expressivity and Decidability of First-order Languages over Feature Trees. Doctoral Dissertation. Universität des Saarlandes, Technische Fakultät, 66041 - Backofen - 1994 |

3 | Ordering constraints over feature trees with ordered sorts - Müller - 1997 |

3 | Entailment for Set Constraints is not Feasible - Muller, Niehren - 1997 |

2 | Feature-Logik und Semiunfikation - Dorre - 1993 |

1 | Remi Gilleron, Denis Lugiez, Sophie Tison, & Marc Tommasi. Tree automata: Techniques and applications - Comon, Dauchet - 1998 |