Pure dominance constraints

DOI10.1007/3-540-45841-7_23MaRDI QIDQ4736847zbMATH OpenFDO

Authors Manuel Bodirsky, Martin Kuetz

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850287.htm

zbMATH Keywords

constraint satisfactionEfficient algorithmstree descriptions

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• An efficient graph algorithm for dominance constraints
• Dominance constraints: algorithms and complexity
• An efficient algorithm for the configuration problem of dominance graphs
• A new algorithm for normal dominance constraints
• Dominance constraints with set operators

Cited in

(8)

• Determining the consistency of partial tree descriptions
• Configuration of labeled trees under lexicalized constraints and principles
• Dominance constraints with Boolean connectives: A model-eliminative treatment
• Dominance constraints: algorithms and complexity
• An efficient algorithm for the configuration problem of dominance graphs
• An efficient graph algorithm for dominance constraints
• A new algorithm for normal dominance constraints
• Constraint Satisfaction Problems with Infinite Templates

This page was built for publication: Pure dominance constraints

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