Decidable Fragment

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 …...