Қанағаттандыру мәселесі
Related Papers
Computational Complexity in Two-Level Morphology
Morphological analysis must take into account the spelling-change processes of a language as well as its possi- ble configurations of stems, affixes, and inflectional mark- ings. The computational difficulty of …...
Feature Logic With Weak Subsumption Constraints
In the general framework of a constraint-based grammar formalism often some sort of feature logic serves as the constraint language to de- scribe linguistic objects. We investigate the ex- tension …...
Decidability and Undecidability in stand-alone Feature Logics
This paper investigates the complexity of the satisfiability problem for feature logics strong enough to code entire grammars un- aided. We show that feature logics capable of both enforcing re-entrancy …...
A Polynomial-Time Fragment of Dominance Constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify the natural fragment of …...