Dominance constraints with Boolean connectives: A model-eliminative treatment

DOI10.1016/S0304-3975(01)00350-4zbMATH Open1025.68098MaRDI QIDQ1870570FDOQ1870570

Authors: Denys Duchier 

Publication date: 14 May 2003

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

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

zbMATH Keywords

constraintconstraint programmingsatisfactionconstraint propagationtree descriptionsdominance constraintsfinite set constraints

Mathematics Subject Classification ID

Natural language processing (68T50)

Cites Work

• The constraint language for lambda structures
• Title not available (Why is that?)
• Records for logic programming
• Title not available (Why is that?)
• A first-order axiomatization of the theory of finite trees
• An efficient algorithm for the configuration problem of dominance graphs
• Title not available (Why is that?)
• Towards the use of automated reasoning in discourse disambiguation

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• CHIP
• Mozart
• Oz

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)