Feature-constraint logics for unification grammars

DOI10.1016/0743-1066(92)90039-6MaRDI QIDQ3992236zbMATH OpenOpenAlexFDO

Authors Gert Smolka

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

zbMATH Keywords

constraint solving methodfeature algebrasfeature constraintsfeature graphsfeature termsfeature-description languagesknowledge representationlogic programmingphrase structure rulessatisfiability checkingunification grammars

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42) Artificial intelligence (68T99)

Recommendations

• The Logic of Typed Feature Structures
• Highly constrained unification grammars
• The Logic of Typed Feature Structures
• On the semantics of unification grammars
• Fibred semantics for feature-based grammar logic
• scientific article; zbMATH DE number 2090557
• Selective Unification in (Constraint) Logic Programming*
• scientific article; zbMATH DE number 1488208

Cited in

(42)

• Highly constrained unification grammars
• Interleaving natural language parsing and generation through uniform processing
• On subsumption and semiunification in feature algebras
• The KL-ONE family
• Subsumption computed algebraically
• How to win a game with features
• Combining Horn rules and description logics in CARIN
• 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
• Regular path expressions in feature logic
• A rational reconstruction of the domain of feature structures
• Fibred semantics for feature-based grammar logic
• Constructing infinitary quotient-inductive types
• Speeding up operations on feature terms using constraint programming and variable symmetry
• Logics for unordered trees with data constraints
• scientific article; zbMATH DE number 1615233 (Why is no real title available?)
• scientific article; zbMATH DE number 4092797 (Why is no real title available?)
• scientific article; zbMATH DE number 43017 (Why is no real title available?)
• scientific article; zbMATH DE number 67840 (Why is no real title available?)
• scientific article; zbMATH DE number 67967 (Why is no real title available?)
• The Logic of Typed Feature Structures
• scientific article; zbMATH DE number 1330429 (Why is no real title available?)
• scientific article; zbMATH DE number 569753 (Why is no real title available?)
• scientific article; zbMATH DE number 1104360 (Why is no real title available?)
• scientific article; zbMATH DE number 1104366 (Why is no real title available?)
• scientific article; zbMATH DE number 1948985 (Why is no real title available?)
• scientific article; zbMATH DE number 1488208 (Why is no real title available?)
• An improved lower bound for the elementary theories of trees
• scientific article; zbMATH DE number 784364 (Why is no real title available?)
• Feature automata and recognizable sets of feature trees
• Regular path expressions in feature logic
• How to win a game with features
• Automata for unordered trees
• Phrase generation in lexical functional grammars and unification grammars
• The Logic of Typed Feature Structures
• A set-theoretic approach to linguistic feature structures and unification algorithms. I.
• A set-theoretic approach to linguistic feature structures and unification algorithms. II
• On the bounded theories of finite trees
• A complete and recursive feature theory
• Attributive concept descriptions with complements
• Order-sorted logic programming with predicate hierarchy

This page was built for publication: Feature-constraint logics for unification grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992236)