scientific article; zbMATH DE number 1689581

MaRDI QIDQ2762872zbMATH OpenFDO

Authors Alexander Koller, Joachim Niehren, Ralf Treinen

Publication date 13 January 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2014/20140106

zbMATH Keywords

complexityconstraint programmingcomputational linguisticsunderspecificationDominance constraints

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50)

Recommendations

• An efficient graph algorithm for dominance constraints
• An efficient algorithm for the configuration problem of dominance graphs
• scientific article; zbMATH DE number 2086393
• A new algorithm for normal dominance constraints
• scientific article; zbMATH DE number 1696805

Cited in

(16)

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Algorithmic aspects of majority domination
• scientific article; zbMATH DE number 1689586 (Why is no real title available?)
• The Complexity of Eliminating Dominated Strategies
• Efficient Computation of Dominance in Component Systems (Short Paper)
• Dominance constraints with Boolean connectives: A model-eliminative treatment
• Dominance constraints in stratified context unification
• An efficient algorithm for the configuration problem of dominance graphs
• The constraint language for lambda structures
• Reference-set constraints as linear tree transductions via controlled optimality systems
• scientific article; zbMATH DE number 2086393 (Why is no real title available?)
• A new algorithm for normal dominance constraints
• An efficient graph algorithm for dominance constraints
• scientific article; zbMATH DE number 975414 (Why is no real title available?)
• scientific article; zbMATH DE number 1696805 (Why is no real title available?)
• Automata for unordered trees

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 Q2762872)