Dominance constraints with Boolean connectives: A model-eliminative treatment

DOI10.1016/S0304-3975(01)00350-4zbMath1025.68098MaRDI QIDQ1870570

Denys Duchier

Publication date: 14 May 2003

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

zbMATH Keywords

tree descriptionssatisfactionconstraint propagationconstraintconstraint programmingdominance constraintsfinite set constraints

Mathematics Subject Classification ID

Natural language processing (68T50)

Uses Software

• CHIP
• Mozart
• Oz

Cites Work

• A first-order axiomatization of the theory of finite trees
• Records for logic programming
• The constraint language for lambda structures
• Towards the use of automated reasoning in discourse disambiguation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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