Pages that link to "Item:Q673135"
From MaRDI portal
The following pages link to A complete and recursive feature theory (Q673135):
Displaying 17 items.
- A new generic scheme for functional logic programming with constraints (Q880985) (← links)
- Anti-patterns for rule-based languages (Q968527) (← links)
- Theories with the independence property (Q993495) (← links)
- How to win a game with features (Q1271569) (← links)
- On completeness theorems for feature logics (Q1353907) (← links)
- Ordering constraints over feature trees expressed in second-order monadic logic. (Q1854347) (← links)
- Interpreting first-order theories into a logic of records (Q1868253) (← links)
- A rational reconstruction of the domain of feature structures (Q1903084) (← links)
- Logics for unordered trees with data constraints (Q2424682) (← links)
- Feature system of quantification structures in natural language (Q3993001) (← 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)
- Basic theory of feature trees (Q5277702) (← links)
- A fixed-point semantics for feature type systems (Q5881298) (← links)
- Combination of constraint systems II: Rational amalgamation (Q5958755) (← links)