scientific article; zbMATH DE number 2086393

MaRDI QIDQ4736847zbMATH OpenFDO

Authors Manuel Bodirsky, Martin Kuetz

Publication date 11 August 2004

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
• scientific article; zbMATH DE number 1689581
• An efficient algorithm for the configuration problem of dominance graphs
• A new algorithm for normal dominance constraints
• scientific article; zbMATH DE number 1696805

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
• scientific article; zbMATH DE number 1689581 (Why is no real title available?)
• 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:

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