How to win a game with features

DOI10.1006/inco.1997.2691zbMath0912.68018OpenAlexW2177567396MaRDI QIDQ1271569

Ralf Treinen, Rolf Backofen

Publication date: 10 November 1998

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

Full work available at URL: https://semanticscholar.org/paper/8b66eca60d860cf8c8fb8539445ab42bc7eb414f

zbMATH Keywords

quantifier eliminationmodel completenessfeature theory

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

An improved lower bound for the elementary theories of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete and recursive feature theory
• Fundamental properties of infinite trees
• Equational problems and disunification
• A feature constraint system for logic programming with entailment
• Equational formulae with membership constraints
• The first-order theory of lexicographic path orderings is undecidable
• A complete axiomatization of a theory with feature and arity constraints
• An application of games to the completeness problem for formalized theories
• An Efficient Unification Algorithm
• Feature-constraint logics for unification grammars
• Records for logic programming