A complete and recursive feature theory

DOI10.1016/0304-3975(94)00188-OzbMath0873.68024arXivcmp-lg/9406019MaRDI QIDQ673135

Rolf Backofen, Gert Smolka

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cmp-lg/9406019

zbMATH Keywords

constraint-based grammar formalisms; feature descriptions; logic programming languages

Mathematics Subject Classification ID

68Q42: Grammars and rewriting systems

68N17: Logic programming

Related Items

Combination of constraint systems II: Rational amalgamation, A new generic scheme for functional logic programming with constraints, Anti-patterns for rule-based languages, Theories with the independence property, How to win a game with features, Ordering constraints over feature trees expressed in second-order monadic logic., A rational reconstruction of the domain of feature structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algebraic semantics approach to the effective resolution of type equations
• On the expressivity of feature logics with negation, functional uncertainty, and sort equations
• A feature constraint system for logic programming with entailment
• The logic of unification in grammar
• Login: a logic programming language with built-in inheritance
• Feature-constraint logics for unification grammars
• The Logic of Typed Feature Structures
• Records for logic programming
• Towards a meaning of life