A complete and recursive feature theory

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

Gert Smolka, Rolf Backofen

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 formalismsfeature descriptionslogic programming languages

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item