scientific article; zbMATH DE number 1689581

zbMATH Open0976.68154MaRDI QIDQ2762872FDOQ2762872

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

complexityconstraint programmingcomputational linguisticsunderspecificationDominance constraints

Mathematics Subject Classification ID

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

Cited In (16)

• Algorithmic aspects of majority domination
• Title not available (Why is that?)
• 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
• The constraint language for lambda structures
• An efficient algorithm for the configuration problem of dominance graphs
• Reference-set constraints as linear tree transductions via controlled optimality systems
• Title not available (Why is that?)
• A new algorithm for normal dominance constraints
• An efficient graph algorithm for dominance constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata for unordered trees
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

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)