Feature-constraint logics for unification grammars
From MaRDI portal
Publication:3992236
DOI10.1016/0743-1066(92)90039-6zbMath0754.68108OpenAlexW1965144055MaRDI QIDQ3992236
Publication date: 13 August 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(92)90039-6
knowledge representationlogic programmingsatisfiability checkingfeature termsunification grammarsfeature algebrasconstraint solving methodfeature constraintsfeature graphsfeature-description languagesphrase structure rules
Related Items
Feature automata and recognizable sets of feature trees, Fibred semantics for feature-based grammar logic, Interleaving natural language parsing and generation through uniform processing, Logics for unordered trees with data constraints, Constructing infinitary quotient-inductive types, A complete and recursive feature theory, On subsumption and semiunification in feature algebras, An improved lower bound for the elementary theories of trees, Automata for unordered trees, The KL-ONE family, Subsumption computed algebraically, Regular path expressions in feature logic, Attributive concept descriptions with complements, How to win a game with features, Combining Horn rules and description logics in CARIN, How to win a game with features, A modal perspective on the computational complexity of attribute value grammar, On the expressivity of feature logics with negation, functional uncertainty, and sort equations, A feature constraint system for logic programming with entailment, Order-sorted logic programming with predicate hierarchy