Conflict-Driven Clause Learning (CDCL) SAT solvers can automatically solve very large real-world problems. IntSat is a new technique extending CDCL to Integer Linear programming (ILP). For some conflicts, IntSat gener...
详细信息
Conflict-Driven Clause Learning (CDCL) SAT solvers can automatically solve very large real-world problems. IntSat is a new technique extending CDCL to Integer Linear programming (ILP). For some conflicts, IntSat generates no strong enough ILP constraint, and the backjump has to be done based on the conflicting set of bounds. The techniques given in this article precisely analyze how and when that set can be translated into the required new ILP constraint. Moreover, this can be done efficiently. This obviously strengthens learning and significantly improves the performance of IntSat (as confirmed by our experiments). We also briefly discuss extensions and other applications.
We argue in favour of teaching modern programming to students of "non-scientific" undergraduate disciplines (humanities), considering that computer-assisted learning should not be reduced to the usage of too...
详细信息
ISBN:
(纸本)9789897581793
We argue in favour of teaching modern programming to students of "non-scientific" undergraduate disciplines (humanities), considering that computer-assisted learning should not be reduced to the usage of tools, but provides some answers to the question: how the knowledge is built. The computer science should be treated as an inherent part of their culture. We advocate the teaching of Logic programming languages: Prolog, and of the constraint programming languages, such as CHR. Logic programming permits to formulate the computational problems and their solutions in a form more close to human reasoning than several other languages, and adaptable to the domains of interest of the learners.
The need for Service Level Agreements (SLAs) to supervise the consumption of services is increasing in business applications and Cloud scenarios due to the penalties that can apply for violation of SLA terms. Such a n...
详细信息
The need for Service Level Agreements (SLAs) to supervise the consumption of services is increasing in business applications and Cloud scenarios due to the penalties that can apply for violation of SLA terms. Such a need for SLAs boosts the importance and complexity of SLA lifecycle supporting systems (SLA-driven solutions). In our work we propose to improve the current support to develop SLA-driven solutions by enhancing both, the SLA specifications and automated analysis techniques. Furthermore, we have applied our proposal to creating and monitoring agreement solutions.
The goal of this paper is to find optimal release dates for products and different manufacturing locations in semiconductor industry. The underlying scheduling problem is solved by constraint programming (CP). Lange [...
详细信息
ISBN:
(纸本)9781509013890
The goal of this paper is to find optimal release dates for products and different manufacturing locations in semiconductor industry. The underlying scheduling problem is solved by constraint programming (CP). Lange [9] describes, that the scheduling problem is too complex to solve it with mixed integer programming and that CP also deals with requirements that makes scheduling complex. All this is applicable in this paper and that is the reason why CP is used. Different objectives are observed and the goodness of the computed suboptimal release dates is tested by a discrete simulation model. For the tests a simplified model of a backend test facility is used. At least the results are compared with dispatching and simulation based methods. All this is done under the aspect of rolling horizon planning.
Searchlight [9] enables search and exploration of large, multidimensional data sets interactively. It allows users to explore by specifying rich constraints for the "objects" they are interested in identifyi...
详细信息
ISBN:
(纸本)9781450335317
Searchlight [9] enables search and exploration of large, multidimensional data sets interactively. It allows users to explore by specifying rich constraints for the "objects" they are interested in identifying. constraints can express a variety of properties, including a shape of the object (e.g., a waveform interval of length 10-100ms), its aggregate properties (e.g., the average amplitude of the signal over the interval is greater than 10), and similarity to another object (e.g., the distance between the interval's waveform and the query waveform is less than 5). Searchlight allows users to specify an arbitrary number of such constraints, with mixing different types of constraints in the same query. Searchlight enhances the query execution engine of an array DBMS (currently SciDB) with the ability to perform sophisticated search using the power of constraint programming (CP). This allows an existing CP solver from Or Tools (an open-source suite of operations research tools from Google) to directly access data inside the DBMS without the need to extract and transform it. This demo will illustrate the rich search and exploration capabilities of Searchlight, and its innovative technical features, by using the real-world MIMIC II data set, which contains waveform data for multi-parameter recordings of ICU patients, such as ABP (Arterial Blood Pressure) and ECG (electrocardiogram). Users will be able to search for interesting waveform intervals by specifying aggregate properties of the corresponding signals. In addition, they will be able to search for intervals similar to already found, where similarity is defined as a distance between the signal sequences.
constraint programming is a powerful paradigm that allows for solving optimization and constraint satisfaction problems (CSPs). In this context, a main concern of this technology is that the efficient problem resoluti...
详细信息
ISBN:
(纸本)9789899843462
constraint programming is a powerful paradigm that allows for solving optimization and constraint satisfaction problems (CSPs). In this context, a main concern of this technology is that the efficient problem resolution usually relies on the employed solving strategy. Unfortunately, selecting the proper one is known to be complex as the behavior of strategies is commonly unpredictable. Recently, Autonomous Search appeared as a new technique to tackle this concern. The idea is to let the solver adapt its strategy during solving time in order to improve performance. This task is controlled by a choice function which decides, based on performance information, how the strategy must be updated. In this paper, we evaluate the impact on the solving phase of 16 different choice functions. We employ as test bed a set of well-known benchmarks that collect general features present on most CSPs. Interesting experimental results are obtained in order to provide the best-performing choice functions for solving CSPs.
Embedded system designers often face a large number of design alternatives when designing complex systems. A designer must select an alternative which satisfies application constraints (e.g. timing requirements) while...
详细信息
ISBN:
(纸本)9791092279177
Embedded system designers often face a large number of design alternatives when designing complex systems. A designer must select an alternative which satisfies application constraints (e.g. timing requirements) while optimizing system level objectives such as overall energy consumption. The size of design space is often very large giving rise to the need for systematic Design Space Exploration (DSE) methods. In this paper we address the DSE problem for real-time applications that belong to two different domains: (i) streaming applications modeled using the synchronous dataflow graphs;(ii) feedback control tasks modeled using the periodic task model. We consider a heterogeneous multiprocessor platform in which processors communicate through a predictable bus architecture. We present our DSE tool in which the DSE problem is modeled as a constraint satisfaction problem, and it is solved using a constraint programming solver. This approach provides a modular framework in which different constraints such as deadline, throughput and energy consumption can easily be plugged depending on the system being designed.
Business processes and IT infrastructure have become a cornerstone for the management of organizations. Nevertheless, business processes are ever threatened by problems due to the exposure of these processes to extern...
详细信息
Business processes and IT infrastructure have become a cornerstone for the management of organizations. Nevertheless, business processes are ever threatened by problems due to the exposure of these processes to external and third parties outside the control of the organizations. Risk management is mostly overlooked or is taken into consideration separately from business process management with a complete lack of formalization and automation. In this work, innovative and relevant contributions based on model-based diagnosis and constraint programming techniques are proposed for enhancement the dependability of business process management from design to run-time.
Picat (***) is a logic-based multi-paradigm programming language that integrates logic programming, functional programming, constraint programming, and scripting. Picat takes many features from other languages, includ...
详细信息
ISBN:
(纸本)9783319420196;9783319420189
Picat (***) is a logic-based multi-paradigm programming language that integrates logic programming, functional programming, constraint programming, and scripting. Picat takes many features from other languages, including logic variables, unification, backtracking, pattern-matching rules, functions, list/array comprehensions, loops, assignments, tabling for dynamic programming and planning, and constraint solving with CP (constraint programming), SAT (satisfiability), and MIP (mixed integer programming). These features make Picat more convenient than Prolog for scripting and modeling, and more suitable than functional languages (such as Haskell and F#) and scripting languages (such as Python and Ruby) for symbolic computations. This article provides a quick introduction to Picat using examples from Google Code Jam (GCJ).
The hardware address translation mechanism is an essential part of modern microprocessor memory management. The ever-growing demand for performance and low power of integrated circuits makes this mechanism exceptional...
详细信息
ISBN:
(纸本)9783319449531;9783319449524
The hardware address translation mechanism is an essential part of modern microprocessor memory management. The ever-growing demand for performance and low power of integrated circuits makes this mechanism exceptionally complex, and its verification requires sophisticated test generation tools. This paper presents a solution, based on constraint satisfaction, to generate stimuli for testing address translation. The address translation process passes through a sequence of steps and can therefore be naturally described as a directed acyclic graph. We developed a framework that we call graph-based constraint satisfaction problems (GCSP). These problems consist of a directed graph, combined with a CSP, where each variable and constraint of the CSP is linked to a particular node or edge of the graph. A solution to the problem is a path in the graph, such that all constraints defined along this path must be satisfied. We base our algorithm for solving GCSPs on conditional CSP. We successfully used this technology to verify the memory management units of several industrial microprocessors.
暂无评论