Ordering constraints over feature trees expressed in second-order monadic logic.

DOI10.1006/inco.2000.2878zbMath1046.68645OpenAlexW1543119249MaRDI QIDQ1854347

Yanyan Li

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00536798/file/SWSJournal99.pdf

zbMATH Keywords

language FT\(\leqslant\)

Mathematics Subject Classification ID

Logic of natural languages (03B65) Knowledge representation (68T30) Natural language processing (68T50)

Related Items (1)

Logics for unordered trees with data constraints

Uses Software

• Oz

Cites Work

• A complete and recursive feature theory
• An algebraic semantics approach to the effective resolution of type equations
• Reasoning and revision in hybrid representation systems
• On subsumption and semiunification in feature algebras
• A feature constraint system for logic programming with entailment
• Regular path expressions in feature logic
• Ordering constraints over feature trees
• Tree acceptors and some of their applications
• A complete axiomatization of a theory with feature and arity constraints
• Login: a logic programming language with built-in inheritance
• The Logic of Typed Feature Structures
• Records for logic programming
• An improved lower bound for the elementary theories of trees
• Towards a meaning of life
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ordering constraints over feature trees expressed in second-order monadic logic.