K Kuchcinski - ACM Transactions on Design Automation of Electronic …, 2003 - dl.acm.org
This paper describes a new method for modeling and solving different scheduling and resource assignment problems that are common in high-level synthesis (HLS) and system …
T Feydy, PJ Stuckey - International Conference on Principles and Practice …, 2009 - Springer
Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy clause …
Problems of cyclic scheduling are usually observed in flexible manufacturing systems which produce multitype parts where the automated guided vehicle system plays the role of a …
P Van Roy, P Brand, D Duchier, S Haridi… - Theory and practice of …, 2003 - cambridge.org
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming …
This paper presents a Decision Support System framework based on Constrain Logic Programming and offers suggestions for using RFID technology to improve several of the …
H Liu - United States, 2020 - knowledge.uchicago.edu
How should a monopolistic seller (she) sell an item to a buyer (he), when the buyer's later demands are affected by the earlier allocations he receives? For example, consider an …
Constraint Programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems, especially in the area of integrated …
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a …
Six blind sages were shown an elephant and met to discuss their experience.“It's wonderful,” said the first,“an elephant is like a rope: slender and flexible.”“No, no, not at all,” said the …