Answer set planning

V Lifschitz - Logic Programming and Nonmonotonic Reasoning: 5th …, 1999 - Springer
Abstract In “answer set programming”[5, 7] solutions to a problem are represented by
answer sets (known also as stable models), and not by answer substitutions produced in …

Constraints-driven scheduling and resource assignment

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 …

Lazy clause generation reengineered

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 …

Declarative approach to cyclic steady state space refinement: periodic process scheduling

G Bocewicz, ZA Banaszak - The International Journal of Advanced …, 2013 - Springer
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 …

Logic programming in the context of multiparadigm programming: the Oz experience

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 …

Optimizing supply chain waste management through the use of RFID technology

I Nielsen, M Lim, P Nielsen - 2010 IEEE International …, 2010 - ieeexplore.ieee.org
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 …

[PDF][PDF] The University of Chicago

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 …

[PDF][PDF] Knowledge based and CP-driven approach applied to multi product small-size production flow

I Bach, G Bocewicz, ZA Banaszak… - Control and …, 2010 - bibliotekanauki.pl
Constraint Programming (CP) is an emergent software technology for declarative description
and effective solving of large combinatorial problems, especially in the area of integrated …

The complexity of integer bound propagation

L Bordeaux, G Katsirelos, N Narodytska… - Journal of Artificial …, 2011 - jair.org
Bound propagation is an important Artificial Intelligence technique used in Constraint
Programming tools to deal with numerical constraints. It is typically embedded within a …

[PDF][PDF] Concepts, Techniques, and Models of Computer Programming

P Van Roy, S Haridi - Helion, Gliwice, 2005 - e-reading.co.uk
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 …