Declarative Modeling for Deploying a Container Platform

Author(s):  
Giuseppe Attardi ◽  
Alex Barchiesi ◽  
Alberto Colla ◽  
Roberto Di Lallo ◽  
Fulvio Galeazzi
Keyword(s):  
Author(s):  
Sergey Paramonov ◽  
Matthijs van Leeuwen ◽  
Marc Denecker ◽  
Luc De Raedt
Keyword(s):  

2011 ◽  
Vol 12 (S1) ◽  
Author(s):  
Hugo Cornelis ◽  
Allan C Coop ◽  
Armando L Rodriguez ◽  
David Beeman ◽  
James M Bower
Keyword(s):  

2014 ◽  
Vol 6 (3) ◽  
pp. 7-24 ◽  
Author(s):  
Zbigniew Banaszak ◽  
Grzegorz Bocewicz

Abstract A declarative framework enabling to determine conditions as well as to develop decision-making software supporting small- and medium-sized enterprises aimed at unique, multi-project-like and mass customized oriented production is discussed. A set of unique production orders grouped into portfolio orders is considered. Operations executed along different production orders share available resources following a mutual exclusion protocol. A unique product or production batch is completed while following a given activity’s network order. The problem concerns scheduling a newly inserted project portfolio subject to constraints imposed by a multi-project environment The answers sought are: Can a given project portfolio specified by its cost and completion time be completed within the assumed time period in a manufacturing system in hand? Which manufacturing system capability guarantees the completion of a given project portfolio ordered under assumed cost and time constraints? The considered problems regard finding a computationally effective approach aimed at simultaneous routing and allocation as well as batching and scheduling of a newly ordered project portfolio subject to constraints imposed by a multi-project environment. The main objective is to provide a declarative model enabling to state a constraint satisfaction problem aimed at multi-project-like and mass customized oriented production scheduling. Multiple illustrative examples are discussed.


Robotica ◽  
1984 ◽  
Vol 2 (2) ◽  
pp. 105-109
Author(s):  
Richard M. Salter

SUMMARYThe production system has been used extensively in Artificial Intelligence systems due, possibly, to a lack of a prior procedural orientation towards the knowledge embedded within it. As a result, this paradigm is especially useful in modeling domains in which a strong procedural correlation of data would not naturally appear. The production system is therefore an appropriate tool for designing models of systems of independent processes whose interactions can be defined in terms of system state.We are interested in modeling continuous, concurrent processes for simulating robot activities, and present a description of a system which is capable of representing such processes as symbolic expressions within a production system database. This system implements a world model which acts as a continuous function of time, and a set of rules written in a language capable of specifying time-dependent properties of the model. In addition, rules may specify new rules, thus permitting processes to be mapped out over time as sequences of events.The methodology presented in this paper is an attempt to utilize the power of symbolic programming in a design for world modeling, and a characterization of the requirements for applying such systems to problem domains which contain a continuous parameter, such as time. We believe that the technique of embedding time used here is appropriate for expressing the dynamic evolution of these models.


2016 ◽  
Vol 13 (2) ◽  
pp. 30-33 ◽  
Author(s):  
Sebastian Altmeyer ◽  
Nicolas Navet

Sign in / Sign up

Export Citation Format

Share Document