Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Markov-Chain (MC) based constraints have been shown to be an effective QoS measure for a class of real-time systems, particularly those arising from control applications. Scheduli...
Donglin Liu, Xiaobo Sharon Hu, Michael D. Lemmon, ...
In safety-critical systems, certain safety constraints must be satisfied before an operation can be performed. Such constraints typically depend on the state of the system at the ...
Object-based knowledge representation systems bene t from the declarative power of the object formalism for modeling, organizing and storing large amounts of knowledge. They also ...