Pages that link to "Item:Q3992236"
From MaRDI portal
The following pages link to Feature-constraint logics for unification grammars (Q3992236):
Displaying 21 items.
- Automata for unordered trees (Q515668) (← links)
- A complete and recursive feature theory (Q673135) (← links)
- Attributive concept descriptions with complements (Q749235) (← links)
- Order-sorted logic programming with predicate hierarchy (Q814621) (← links)
- Interleaving natural language parsing and generation through uniform processing (Q1128613) (← links)
- On subsumption and semiunification in feature algebras (Q1194340) (← links)
- The KL-ONE family (Q1202629) (← links)
- Subsumption computed algebraically (Q1202639) (← links)
- How to win a game with features (Q1271569) (← links)
- Combining Horn rules and description logics in CARIN (Q1274681) (← links)
- A modal perspective on the computational complexity of attribute value grammar (Q1314274) (← links)
- On the expressivity of feature logics with negation, functional uncertainty, and sort equations (Q1314281) (← links)
- A feature constraint system for logic programming with entailment (Q1314426) (← links)
- Fibred semantics for feature-based grammar logic (Q1923842) (← links)
- Constructing infinitary quotient-inductive types (Q2200826) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- An improved lower bound for the elementary theories of trees (Q4647523) (← links)
- Feature automata and recognizable sets of feature trees (Q5044748) (← links)
- Regular path expressions in feature logic (Q5055790) (← links)
- How to win a game with features (Q5096316) (← links)
- On the bounded theories of finite trees (Q6560360) (← links)
