Pricing policy is a sensitive and critical issue in today's competitive and dynamic market environment. This is especially true in the analysis of price structure in a supply chain where uncertainty in many factor...
详细信息
Pricing policy is a sensitive and critical issue in today's competitive and dynamic market environment. This is especially true in the analysis of price structure in a supply chain where uncertainty in many factors can have a profound effect on the supply chain performance. In this paper, we propose a novel approach to determine the price in a supply chain model in which several uncertain factors such as cost, inventory level, and competitors' prices have been considered. The objective here is to seek a coordinating, flexible pricing policy under uncertainty to maximize profit while meeting customer demand. As a result, artificial intelligence tools such as fuzzy logic have been applied to determine the price and the demand. A mathematical programming model has been used to find the optimal profit. Results showed that the dynamic pricing policy under uncertainty is an effective way to coordinate the price and supply chain channel and to improve the profit of the overall system. Fuzzy inferencing and mathematical modeling provided an efficient solution to the problem.
We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in the context of fixed priorities preemptive sched...
详细信息
We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lattices together with a library of lattice functors ...
详细信息
The popularity of animated simulation as a tool for modeling and analyzing business processes is growing. This is due to the fact that it offers a number of benefits for modeling such processes, among which the abilit...
The popularity of animated simulation as a tool for modeling and analyzing business processes is growing. This is due to the fact that it offers a number of benefits for modeling such processes, among which the ability to capture their stochastic character, represent the changes in their characteristics in the course of time and model and visualize their dynamic behavior. The current research focuses on the application of animated simulation for the modeling of ICT (Information and Communication Technology) management processes. A number of issues in building simulation models of such processes are identified, which include the lack of generally adopted concepts and approaches and the low degree of comparability and reusability of the results of simulation studies. In order to address these issues a conceptual framework, a set of reusable simulation constructs and a step-by-step approach for simulating ICT management processes were developed as part of this research. The conceptual framework allows for capturing relevant characteristics of these processes, among which the tasks carried out as part of the processes, the workplaces at which they are carried out, the exchanged information and the used equipment. The simulation constructs, implemented as a simulation template in the ARENA simulation environment, provide the programming definitions and logic necessary to represent these characteristics in a simulation model. The step-by-step approach describes the steps that have to be taken to build such a model using the developed conceptual framework and simulation constructs. The way in which the conceptual framework, the simulation template and the step-by-step approach can be applied for building ICT management simulation models is described based on two test cases carried out in two organizations in The Netherlands.
Submission deadline: January 10, 2002The past decade has seen dramatic growth in the application of model checking techniques to the validation and verification of correctness properties of hardware, and more recently...
Submission deadline: January 10, 2002The past decade has seen dramatic growth in the application of model checking techniques to the validation and verification of correctness properties of hardware, and more recently software systems. One of the methods is to model a hardware or software system as a finite, labelled transition system which is then exhaustively explored to decide whether a given temporal specification holds. Recently, there has been increasing interest in applying logicprogramming techniques to model checking in particular and verification in general. For example, table-based logicprogramming can be used as an efficient means of performing explicit model checking. Other research has successfully exploited set-based logic program analysis, constraint logicprogramming, and logic program transformation *** aim of this special issue is to attract high-quality research papers on the interplay between verification techniques (e.g. model checking, reduction and abstraction) and logicprogramming techniques (e.g. constraints, abstract interpretation, program transformation).
Oz is a multiparadigm language that supports logicprogramming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (logic, functional, constraint, object-orie...
详细信息
Oz is a multiparadigm language that supports logicprogramming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (logic, functional, constraint, object-oriented, sequential, concurrent, etc.) with equal ease. This paper has two goals: to give a tutorial of logicprogramming in Oz;and to show how logicprogramming fits naturally into the wider context of multiparadigm programming. Our experience shows that there are two classes of problems, which we call algorithmic and search problems, for which logicprogramming can help formulate practical solutions. Algorithmic problems have known efficient algorithms. Search problems do not have known efficient algorithms but can be solved with search. The Oz support for logicprogramming targets these two problem classes specifically, using the concepts needed for each. This is in contrast to the Prolog approach, which targets both classes with one set of concepts, which results in less than optimal support for each class. We give examples that can be run interactively on the Mozart system, which implements Oz, To explain the essential difference between algorithmic and search programs, we define the Oz execution model. This model subsumes both concurrent logicprogramming (committed-choice-style) and search-based logicprogramming (Prolog-style). Furthermore, as consequences of its multiparadigm nature, the model supports new abilities such as first-class top levels, deep guards, active objects, and sophisticated control of the search process. Instead of Horn clause syntax, Oz has a simple, fully compositional, higher-order syntax that accommodates the abilities of the language. We give a brief history of Oz that traces the development of its main ideas and we summarize the lessons learned from this work. Finally, we give many entry points into the Oz literature.
In this paper, we suggest an architecture for a software agent which operates a physical device and is capable of making observations and of testing and repairing the device's components. We present simplified def...
详细信息
In this paper, we suggest an architecture for a software agent which operates a physical device and is capable of making observations and of testing and repairing the device's components. We present simplified definitions of the notions of symptom, candidate diagnosis, and diagnosis which are based on the theory of action language A L. The definitions allow one to give a simple account of the agent's behavior in which many of the agent's tasks are reduced to computing stable models of logic programs.
Constructor-Based Conditional Rewriting logic is a general framework for integrating first-order functional and logicprogramming which gives an algebraic semantics for non-deterministic functional-logic programs. In ...
详细信息
Constructor-Based Conditional Rewriting logic is a general framework for integrating first-order functional and logicprogramming which gives an algebraic semantics for non-deterministic functional-logic programs. In the context of this formalism, we introduce a simple notion of program module as an open program which can be extended together with several mechanisms to combine them. These mechanisms are based on a reduced set of operations. However, the high expressiveness of these operations enable us to model typical constructs for program modularization like hiding, export/import, genericity/instantiation, and inheritance in a simple way. We also deal with the semantic aspects of the proposal by introducing an immediate consequence operator, and studying several alternative semantics for a program module, based on this operator, in the line of logicprogramming: the operator itself, its least fixpoint (the least model of the module), the set of its pre-fixpoints (term models of the module), and some other variations in order to find a compositional and fully abstract semantics w.r.t. the set of operations and a natural notion of observability.
暂无评论