Dominance constraints with set operators

DOI10.1007/3-540-44957-4_22MaRDI QIDQ2767066zbMATH OpenFDO

Authors Denys Duchier, Joachim Niehren

Publication date 28 April 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44957-4_22

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• Dominance constraints: algorithms and complexity
• Dominance constraints with Boolean connectives: A model-eliminative treatment
• Set constraints and logic programming
• An efficient graph algorithm for dominance constraints
• A new algorithm for normal dominance constraints

Cited in

(9)

• Dominance constraints with Boolean connectives: A model-eliminative treatment
• Set constraints with intersection
• Dominance constraints: algorithms and complexity
• Dominance constraints in context unification
• An efficient algorithm for the configuration problem of dominance graphs
• XMG 2: describing description languages
• An efficient graph algorithm for dominance constraints
• scientific article; zbMATH DE number 2086393 (Why is no real title available?)
• A new algorithm for normal dominance constraints

This page was built for publication: Dominance constraints with set operators

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