scientific article; zbMATH DE number 4166931

MaRDI QIDQ3493317zbMATH OpenFDO

Authors Francesca Rossi, Ugo Montanari

Publication date 1989

zbMATH Keywords

context-free graph production systemsknowledge representation methodnetworks of constraintsperfect relaxation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 4049150
• Computing leximin-optimal solutions in constraint networks
• scientific article; zbMATH DE number 4137620
• Simultaneous approximation of constraint satisfaction problems
• A note on resolving infeasibility in linear programs by constraint relaxation
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Linear programs for constraint satisfaction problems
• Exact solutions to linear programming problems

Cited in

(4)

• Constraint relaxation may be perfect
• scientific article; zbMATH DE number 4049150 (Why is no real title available?)
• Using artificial neural networks for constraint satisfaction problem
• Fine-grained conflict resolution in constraint satisfaction 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 Q3493317)