A complete axiomatization of a theory with feature and arity constraints

DOI10.1016/0743-1066(95)00033-GzbMath0866.68014MaRDI QIDQ3125892

Rolf Backofen

Publication date: 20 March 1997

Published in: The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

natural language processingCFT

Mathematics Subject Classification ID

Logic programming (68N17) Natural language processing (68T50)

Related Items

A new generic scheme for functional logic programming with constraints, Solving quantified linear arithmetic by counterexample-guided instantiation, Decision procedures for term algebras with integer constraints, An improved lower bound for the elementary theories of trees, Theories with the independence property, How to win a game with features, TYPE INFERENCE FOR FIRST-CLASS MESSAGES WITH FEATURE CONSTRAINTS, Ordering constraints over feature trees expressed in second-order monadic logic.

Uses Software

• Oz