On the relations between SAT and CSP enumerative algorithms

AbstractWe show the equivalence between the so-called Davis–Putnam procedure (Davis et al., Comm. ACM 5 (1962) 394–397; Davis and Putnam (J. ACM 7 (1960) 201–215)) and the Forward Checking of Haralick and Elliot (Artificial Intelligence 14 (1980) 263–313). Both apply the paradigm choose and propagate in two different formalisms, namely the propositional calculus and the constraint satisfaction problems formalism. They happen to be strictly equivalent as soon as a compatible instantiation order is chosen. This equivalence is shown considering the resolution of the clausal expression of a CSP by the Davis–Putnam procedure

Replanning in Predictive-reactive Scheduling

Abstract Achieving optimal results in real-life production scheduling is precluded by a number of problems. One such problem is dynamics of environments with unavailable resources (such as machine breakdowns and ill workers) and new demands (e.g. new orders) coming during the schedule execution. Traditional approach to react to unexpected events occurring on the shop floor is generating a new schedule from scratch. Complete rescheduling, however, may require excessive computation time. Moreover, the recovered schedule may deviate a lot from the ongoing schedule. Some work has focused on tackling these shortcomings, but none of the existing approaches tries to substitute jobs that cannot be executed with a set of alternative jobs. This paper reviews techniques related to predictive-reactive scheduling and suggests the future goal, which is to propose algorithms for dealing with unexpected events using the possibility of alternative processes

A Hybrid Method for Modeling and Solving Supply Chain Optimization Problems with Soft and Logical Constraints

This paper presents a hybrid method for modeling and solving supply chain optimization problems with soft, hard, and logical constraints. Ability to implement soft and logical constraints is a very important functionality for supply chain optimization models. Such constraints are particularly useful for modeling problems resulting from commercial agreements, contracts, competition, technology, safety, and environmental conditions. Two programming and solving environments, mathematical programming (MP) and constraint logic programming (CLP), were combined in the hybrid method. This integration, hybridization, and the adequate multidimensional transformation of the problem (as a presolving method) helped to substantially reduce the search space of combinatorial models for supply chain optimization problems. The operation research MP and declarative CLP, where constraints are modeled in different ways and different solving procedures are implemented, were linked together to use the strengths of both. This approach is particularly important for the decision and combinatorial optimization models with the objective function and constraints, there are many decision variables, and these are summed (common in manufacturing, supply chain management, project management, and logistic problems). The ECLiPSe system with Eplex library was proposed to implement a hybrid method. Additionally, the proposed hybrid transformed model is compared with the MILP-Mixed Integer Linear Programming model on the same data instances. For illustrative models, its use allowed finding optimal solutions eight to one hundred times faster and reducing the size of the combinatorial problem to a significant extent

Improved Adaptation and Survivability via Dynamic Service Composition of Ubiquitous Computing Middleware

These days, ubiquitous computing has radically changed the way users access and interact with services and content on the Internet: novel smart mobile devices and broadband wireless communication channels allow users to seamlessly access them anytime and anywhere. Middleware infrastructures to support ubiquitous computing need to support an extremely dynamic and ever-changing scenario, where novel contents/services, devices, formats, and media channels become available. Service-oriented architectures and service composition techniques have proven to be the key in designing flexible and extensible platforms that are able to reliably support ubiquitous computing. However, current trends in service composition for ubiquitous computing tend to be either too formal and, therefore, poorly used by average final users, or too vertical and poorly flexible and extensible. This paper proposes novel service composition middleware for ubiquitous computing that relies on a translucent composition model to achieve a flexible, extensible, highly-available, but also easily understandable and usable platform. The proposed system has been widely tested, benchmarked, and deployed on a number of different and heterogeneous ubiquitous scenarios

An analysis of paperclip arbitrage

While bartering is arguably the world's oldest form of trade there are still many instances where it surprises us. One such case is the remarkable story of Kyle MacDonald who, by means of a sequence of bartering exchanges between July 2005 and July 2006, managed to trade a small red paperclip for a full sized house in the town of Kipling Saskatchewan. Although there are many factors to consider in this achievement, his feat raises basic questions about the nature of the trades made and to what extent they are repeatable by others. Furthermore, it raises issues as to whether such events could occur in Agent–based Electronic Environments – and under what conditions. In this paper we provide an intuitive model for the type of trading environment experienced Kyle and study its consequences. In particular the work is focused on understanding whether such trading phenomena require altruistic agents to be present in the environment and under what conditions agents can reach their individual goals. Results cover both the case of a singlePostprint (published version

Constraint Based System-Level Diagnosis of Multiprocessors

Massively parallel multiprocessors induce new requirements for system-level fault diagnosis, like handling a huge number of processing elements in an inhomogeneous system. Traditional diagnostic models (like PMC, BGM, etc.) are insufficient to fulfill all of these requirements. This paper presents a novel modelling technique, based on a special area of artificial intelligence (AI) methods: constraint satisfaction (CS). The constraint based approach is able to handle functional faults in a similar way to the Russel-Kime model. Moreover, it can use multiple-valued logic to deal with system components having multiple fault modes. The resolution of the produced models can be adjusted to fit the actual diagnostic goal. Consequently, constrint based methods are applicable to a much wider range of multiprocessor architectures than earlier models. The basic problem of system-level diagnosis, syndrome decoding, can be easily transformed into a constraint satisfaction problem (CSP). Thus, the diagnosis algorithm can be derived from the related constraint solving algorithm. Different abstraction leveles can be used for the various diagnosis resolutions, employing the same methodology. As examples, two algorithms are described in the paper; both of them is intended for the Parsytec GCel massively parallel system. The centralized method uses a more elaborate system model, and provides detailed diagnostic information, suitable for off-line evaluation. The distributed method makes fast decisions for reconfiguration control, using a simplified model. Keywords system-level self-diagnosis, massively parallel computing systems, constraint satisfaction, diagnostic models, centralized and distributed diagnostic algorithms

Informed selection and use of training examples for knowledge refinement.

Knowledge refinement tools seek to correct faulty rule-based systems by identifying and repairing faults indicated by training examples that provide evidence of faults. This thesis proposes mechanisms that improve the effectiveness and efficiency of refinement tools by the best use and selection of training examples. The refinement task is sufficiently complex that the space of possible refinements demands a heuristic search. Refinement tools typically use hill-climbing search to identify suitable repairs but run the risk of getting caught in local optima. A novel contribution of this thesis is solving the local optima problem by converting the hill-climbing search into a best-first search that can backtrack to previous refinement states. The thesis explores how different backtracking heuristics and training example ordering heuristics affect refinement effectiveness and efficiency. Refinement tools rely on a representative set of training examples to identify faults and influence repair choices. In real environments it is often difficult to obtain a large set of training examples, since each problem-solving task must be labelled with the expert's solution. Another novel aspect introduced in this thesis is informed selection of examples for knowledge refinement, where suitable examples are selected from a set of unlabelled examples, so that only the subset requires to be labelled. Conversely, if a large set of labelled examples is available, it still makes sense to have mechanisms that can select a representative set of examples beneficial for the refinement task, thereby avoiding unnecessary example processing costs. Finally, an experimental evaluation of example utilisation and selection strategies on two artificial domains and one real application are presented. Informed backtracking is able to effectively deal with local optima by moving search to more promising areas, while informed ordering of training examples reduces search effort by ensuring that more pressing faults are dealt with early on in the search. Additionally, example selection methods achieve similar refinement accuracy with significantly fewer examples