How to win a game with features

DOI10.1007/BFb0016863zbMath1495.68045MaRDI QIDQ5096316

Rolf Backofen, Ralf Treinen

Publication date: 16 August 2022

Published in: Constraints in Computational Logics (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic in computer science (03B70) Model theory of finite structures (03C13) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Combination of constraint solvers for free and quasi-free structures ⋮ Combination of constraint systems II: Rational amalgamation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete and recursive feature theory
• Equational problems and disunification
• A feature constraint system for logic programming with entailment
• Regular path expressions in feature logic
• An application of games to the completeness problem for formalized theories
• Feature-constraint logics for unification grammars
• Records for logic programming

This page was built for publication: How to win a game with features