Dominance constraints with Boolean connectives: A model-eliminative treatment

DOI10.1016/S0304-3975(01)00350-4MaRDI QIDQ1870570zbMATH OpenFDO

Authors Denys Duchier

Publication date 14 May 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

constraintconstraint programmingsatisfactionconstraint propagationtree descriptionsdominance constraintsfinite set constraints

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 1696805
• scientific article; zbMATH DE number 1689581
• An efficient graph algorithm for dominance constraints
• scientific article; zbMATH DE number 1689586
• scientific article; zbMATH DE number 2086393

Cites work

• scientific article; zbMATH DE number 1689581 (Why is no real title available?)
• scientific article; zbMATH DE number 1696805 (Why is no real title available?)
• scientific article; zbMATH DE number 1088219 (Why is no real title available?)
• A first-order axiomatization of the theory of finite trees
• An efficient algorithm for the configuration problem of dominance graphs
• Records for logic programming
• The constraint language for lambda structures
• Towards the use of automated reasoning in discourse disambiguation

Cited in

(2)

• scientific article; zbMATH DE number 1689586 (Why is no real title available?)
• scientific article; zbMATH DE number 1696805 (Why is no real title available?)

Describes a project that uses

Uses Software

• Oz
• Mozart
• CHIP

This page was built for publication: Dominance constraints with Boolean connectives: A model-eliminative treatment

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