How to win a game with features
type: Item
instance of: scholarly article
title: How to win a game with features
zbMATH Open document ID: 0912.68018
author: Rolf Backofen
author: Ralf Treinen
published in: Information and Computation
publication date: 1998-11-10T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1220927
zbMATH Keywords: model completeness
zbMATH Keywords: feature theory
zbMATH Keywords: quantifier elimination
MaRDI profile type: Publication
OpenAlex ID: W2177567396
cites work: A feature constraint system for logic programming with entailment
cites work: A complete and recursive feature theory
cites work: A complete axiomatization of a theory with feature and arity constraints
cites work: Equational formulae with membership constraints
cites work: Equational problems and disunification
cites work: The first-order theory of lexicographic path orderings is undecidable
cites work: Fundamental properties of infinite trees
cites work: Q4385532
cites work: An application of games to the completeness problem for formalized theories
cites work: Q3220545
cites work: Q4003410
cites work: Q4023900
cites work: An Efficient Unification Algorithm
cites work: Q5534205
cites work: Records for logic programming
cites work: Feature-constraint logics for unification grammars
DOI: 10.1006/INCO.1997.2691
Recommended article: How to win a game with features
Recommended article: Games and winning strategies
Recommended article: Q3692554
Recommended article: How to win some simple iteration games
Recommended article: Q4433634
Recommended article: Synthesising features by games
description: scientific article; zbMATH DE number 1220927