A complete axiomatization of a theory with feature and arity constraints

DOI10.1016/0743-1066(95)00033-GzbMATH Open0866.68014MaRDI QIDQ3125892FDOQ3125892

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)

Cited In (13)

• A complete theory with arbitrarily large minimality ranks
• How to win a game with features
• TYPE INFERENCE FOR FIRST-CLASS MESSAGES WITH FEATURE CONSTRAINTS
• Interpreting first-order theories into a logic of records
• A new generic scheme for functional logic programming with constraints
• An improved lower bound for the elementary theories of trees
• Theories with the independence property
• Decision procedures for term algebras with integer constraints
• Ordering constraints over feature trees expressed in second-order monadic logic.
• Solving quantified linear arithmetic by counterexample-guided instantiation
• Title not available (Why is that?)
• Towards Complete Reasoning about Axiomatic Specifications
• A complete and recursive feature theory

Uses Software

• Oz

   Recommendations

• Title not available (Why is that?) 👍 👎
• On completeness theorems for feature logics 👍 👎
• Title not available (Why is that?) 👍 👎
• Towards Complete Reasoning about Axiomatic Specifications 👍 👎
• Title not available (Why is that?) 👍 👎
• Finitely axiomatizable theories 👍 👎
• Title not available (Why is that?) 👍 👎
• Arithmetically complete modal theories 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A complete axiomatization of a theory with feature and arity constraints

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