Combining Nonstably Infinite Theories

The Nelson–Oppen combination method combines decision procedures for first-order theories over disjoint signatures into a single decision procedure for the union theory. In order to be correct, the method requires that the component theories be stably infinite. This restriction makes the method inapplicable to many interesting theories such as, for instance, theories having only finite models. In this paper, we describe two extensions of the Nelson–Oppen method that address the problem of combining theories that are not stably infinite. In our extensions, the component decision procedures exchange not only equalities between shared variables but also certain cardinality constraints. Applications of our results include the combination of theories having only finite models, as well as the combination of nonstably infinite theories with the theory of equality, the theories of total and partial orders, and the theory of lattices with maximum and minimum. Calogero G. Zarba: Work done by this author at Stanford University and later at LORIA and INRIA-Lorraine.     

Composite decision support by combining cost-benefit and multi-criteria decision analysis

This paper concerns composite decision support based on combining cost-benefit analysis (CBA) with multi-criteria decision analysis (MCDA) for the assessment of economic as well as strategic impacts within transport projects. Specifically a composite model for assessment (COSIMA) is presented as a decision support system (DSS). This COSIMA DSS ensures that the assessment is conducted in a systematic, transparent and explicit way. The modelling principles presented are illuminated with a case study concerning a complex decision problem. The outcome demonstrates the approach as a valuable DSS, and it is concluded that appraisals of large transport projects can be effectively supported using a combination of CBA and MCDA. Finally, perspectives of the future modelling work are given.     

Decision procedures for elementary sublanguages of set theory

In this paper we prove the decidability of the class of unquantified formulae of set theory involving the operators , , , \, {·}, pred _< and the predicates =, , , Finite, where pred _<(s) denotes the collection of all sets having rank strictly less than the rank of s.This work generalizes and combines earlier results published in the same series of papers.This work has been partially supported by ENI and ENIDATA within the AXL project.     

A framework for systems analysis for decision support systems

Comprehensive and elaborate systems analysis techniques have been developed in the past of routine and operational information systems. Developing support systems for organizational decision-making requires new tools and methodologies. We present a new framework for data collection and decision analysis which is useful for developing decision support systems. This task analysis methodology encompasses (1) event analysis, (2) participant analysis, and (3) decision content analysis. With a proper coding manual, it provides a framework for collecting relevant and detailed information required for decision support design and implementation. Further research is suggested for application and evaluation of the methodology in real-life DSS environments.     

Theory decision by decomposition

The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formula in such a way that its definitional part, including the theory, can be compiled by a rewrite-based first-order theorem prover, and the residual problem can be decided by an SMT-solver, based on the Davis–Putnam–Logemann–Loveland procedure. The resulting decision by stages mechanism may unite the complementary strengths of first-order provers and SMT-solvers. We demonstrate its practicality by giving decision procedures for the theories of records, integer offsets and arrays, with or without extensionality, and for combinations including such theories.     

Special section on advances in reachability analysis and decision procedures: contributions to abstraction-based system verification

Reachability analysis asks whether a system can evolve from legitimate initial states to unsafe states. It is thus a fundamental tool in the validation of computational systems—be they software, hardware, or a combination thereof. We recall a standard approach for reachability analysis, which captures the system in a transition system, forms another transition system as an over-approximation, and performs an incremental fixed-point computation on that over-approximation to determine whether unsafe states can be reached. We show this method to be sound for proving the absence of errors, and discuss its limitations for proving the presence of errors, as well as some means of addressing this limitation. We then sketch how program annotations for data integrity constraints and interface specifications—as in Bertrand Meyer’s paradigm of Design by Contract—can facilitate the validation of modular programs, e.g., by obtaining more precise verification conditions for software verification supported by automated theorem proving. Then we recap how the decision problem of satisfiability for formulae of logics with theories—e.g., bit-vector arithmetic—can be used to construct an over-approximating transition system for a program. Programs with data types comprised of bit-vectors of finite width require bespoke decision procedures for satisfiability. Finite-width data types challenge the reduction of that decision problem to one that off-the-shelf tools can solve effectively, e.g., SAT solvers for propositional logic. In that context, we recall the Tseitin encoding which converts formulae from that logic into conjunctive normal form—the standard format for most SAT solvers—with only linear blow-up in the size of the formula, but linear increase in the number of variables. Finally, we discuss the contributions that the three papers in this special section make in the areas that we sketched above.     

A decision support system for cellular manufacturing system design

With the growth of competitive pressure in the global markets, there has been an increase in demand in industry for cellular manufacturing systems (CMSs) in order to improve productivity and process flexibility. The design of CMSs for industrial applications is a complex and knowledge intensive process as it involves the consideration of many factors including production data and process characteristics. This paper describes the development and implementation of a decision support system for the feasibility and conceptual design of CMSs. The system is based on the knowledge-based system approach, and is able to make recommendations of system feasibility, cell formation techniques and cell types. A case study is also presented to demonstrate the capability of the decision support system.     

A conceptual framework for society-oriented decision support

Inspired by the operation of human social organisation, this paper presents a new architecture—a pyramid-committee—for developing society-oriented intelligence, whose structure imitates the organisation of human society in its decision making. The system takes a pyramid-like hierarchical structure with links in the pyramid forming a semi-lattice, which relate not only to nodes in the same layer, but also to others in different layers. The output of the system is a result of the negotiation and balancing of different interests. For such a system to function, the main difficulties concern the complicated relationships between different factors or agents. Focussing on the airport environment audit, we discuss the development of a model framework and the role of neural networks.     

A framework for dynamic multiple-criteria decision making

The classic multiple-criteria decision making (MCDM) model assumes that, when taking a decision, the decision maker has defined a fixed set of criteria and is presented with a clear picture of all available alternatives. The task then reduces to computing the score of each alternative, thus producing a ranking, and choosing the one that maximizes this value.However, most real-world decisions take place in a dynamic environment, where the final decision is only taken at the end of some exploratory process. Exploration of the problem is often beneficial, in that it may unveil previously unconsidered alternatives or criteria, as well as render some of them unnecessary.In this paper we introduce a flexible framework for dynamic MCDM, based on the classic model, that can be applied to any dynamic decision process and which is illustrated by means of a small helicopter landing example. In addition, we outline a number of possible applications in very diverse fields, to highlight its versatility.     

Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs

This paper gives a decision procedure for the class of set-theoretic formulae in the unquantified language involving Boolean set operators, set equality and membership, domain and range operators, direct and inverse image operators, as well as the predicates SINGLEVALUED, INJECTIVE, and INV (for inverse).This paper was written while the first author was a Visiting Professor at Courant Institute, New York University, U.S.A.     

Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators

The class of unquantified formulae of set theory involving Boolean operators, the powerset and singleton operators, and the equality and membership predicates is shown to have a solvable satisfiability problem.It is shown that whenever a formula in the above class is satisfiable there exists a hereditarily finite model of , whose rank is bounded by a doubly exponential expression in the number of variables occurring in .This paper was written while the author was a Visiting Professor at Courant Institute of Mathematical Sciences, New York University, U.S.A.     

A text-based decision support system for financial sequence prediction

Although most quantitative financial data are analyzed using traditional statistical, artificial intelligence or data mining techniques, the abundance of online electronic financial news articles has opened up new possibilities for intelligent systems that can extract and organize relevant knowledge automatically in a usable format. Most information extraction systems require a hand-built dictionary of templates and thus need continual modification to accommodate new patterns that are observed in the text. In this research, we propose a novel text-based decision support system (DSS) that (i) extracts event sequences from shallow text patterns, and (ii) predicts the likelihood of the occurrence of events using a classifier-based inference engine. The prediction relies on two major, but complementary, feature sets: adjacent events and a set of information-theoretic functions. In contrast to other approaches, the proposed text-based DSS gives explanatory hypotheses about its predictions from a coalition of intimations learned from the inference engine, while preserving robustness and without indulging in formalism. We investigate more than 2000 financial reports with 28,000 sentences. Experiments show that the prediction accuracy of our model outperforms similar statistical models by 7% for the seen data while significantly improving the prediction accuracy for the unseen data. Further comparisons substantiate the experimental findings.     

Comparison of multi-criteria decision analytical software for supporting environmental planning processes

In this paper, we analyze 23 multi-criteria decision analysis software tools in terms of their applicability to support environmental planning processes. Our aim is to survey what kind of software is available, and compare the features they provide to meet the characteristics of environmental problems. Our focus is on useful or innovative features of the software from the viewpoint of supporting practitioners to systematically analyze and compare alternatives in environmental planning. The results can be utilized for selecting the most suitable software for supporting the needs of the environmental cases, but also for identifying good practices and innovative implementation solutions for software development.     

基于禁忌搜索的启发式任务路径规划算法

基于启发式搜索和禁忌搜索技术,提出一种用于解决有限资源、不同重要性要求的任务路径规划问题的有效算法,通过对不同重要程度的任务进行分层调度,得到较为满意的决策结果.该算法具有搜索空间小、求解速度快的优点.仿真结果验证了算法的有效性.     

Implementation and evaluation of an Asbru-based decision support system for adjuvant treatment in breast cancer

The domain of cancer treatment is a promising field for the implementation and evaluation of a protocol-based clinical decision support system, because of the algorithmic nature of treatment recommendations. However, many factors can limit such systems’ potential to support the decision of clinicians: technical challenges related to the interoperability with existing electronic patient records and clinical challenges related to the inherent complexity of the decisions, often collectively taken by panels of different specialists. In this paper, we evaluate the performances of an Asbru-based decision support system implementing treatment protocols for breast cancer, which accesses data from an oncological electronic patient record. Focusing on the decision on the adjuvant pharmaceutical treatment for patients affected by early invasive breast cancer, we evaluate the matching of the system's recommendations with those issued by the multidisciplinary panel held weekly in a hospital.     

An assessment of the effectiveness of decision tree methods for land cover classification

Choice of a classification algorithm is generally based upon a number of factors, among which are availability of software, ease of use, and performance, measured here by overall classification accuracy. The maximum likelihood (ML) procedure is, for many users, the algorithm of choice because of its ready availability and the fact that it does not require an extended training process. Artificial neural networks (ANNs) are now widely used by researchers, but their operational applications are hindered by the need for the user to specify the configuration of the network architecture and to provide values for a number of parameters, both of which affect performance. The ANN also requires an extended training phase.In the past few years, the use of decision trees (DTs) to classify remotely sensed data has increased. Proponents of the method claim that it has a number of advantages over the ML and ANN algorithms. The DT is computationally fast, make no statistical assumptions, and can handle data that are represented on different measurement scales. Software to implement DTs is readily available over the Internet. Pruning of DTs can make them smaller and more easily interpretable, while the use of boosting techniques can improve performance.In this study, separate test and training data sets from two different geographical areas and two different sensors—multispectral Landsat ETM+ and hyperspectral DAIS—are used to evaluate the performance of univariate and multivariate DTs for land cover classification. Factors considered are: the effects of variations in training data set size and of the dimensionality of the feature space, together with the impact of boosting, attribute selection measures, and pruning. The level of classification accuracy achieved by the DT is compared to results from back-propagating ANN and the ML classifiers. Our results indicate that the performance of the univariate DT is acceptably good in comparison with that of other classifiers, except with high-dimensional data. Classification accuracy increases linearly with training data set size to a limit of 300 pixels per class in this case. Multivariate DTs do not appear to perform better than univariate DTs. While boosting produces an increase in classification accuracy of between 3% and 6%, the use of attribute selection methods does not appear to be justified in terms of accuracy increases. However, neither the univariate DT nor the multivariate DT performed as well as the ANN or ML classifiers with high-dimensional data.     

A knowledge based decision support system for computer performance management

Computer systems managers make decisions about hardware and software selection, performance evaluation, capacity planning, and other resource variables on the basis of factual data, accounting data, subjective judgements, and assumptions about the resource consumption of the jobs being run. The importance of computer resource planning calls for effective support methods. A Knowledge-Based DSS (KBDSS) will be able to assist managers in making these policy decisions by utilizing knowledge of the existing configuration and its capabilities, the organizational computing environment, available external resources, and their suppliers. Combining procedural and declarative methods, such a KBDSS may provide early warning of possible bottlenecks, forecast growth of hardware usage, and employ knowledge based inferencing to suggest suitable remedial actions to the systems manager. This paper presents a KBDSS for supporting computer resource planning decisions using a procedural/declarative framework, and illustrates the system's usage aspects.     

Neuro-fuzzy approach versus rough-set inspired methodology for intelligent decision support

One of the two goals of this paper is to briefly present two different methodologies that can be used to the design of intelligent decision support systems, in particular, from the field of medicine. The first approach, combining artificial neural networks and fuzzy sets, yields a neuro-fuzzy classifier that can be trained with both purely numerical data as well as qualitative, linguistic, fuzzy data that describe the decision-making process. The second approach – resulting in a rough classifier – combines all positive aspects of rule induction systems with the flexibility of statistical techniques for classification. The second goal of this paper is to perform a broad comparative analysis of both proposed methodologies (and two others) applied to: (a) the problem of selecting surgical and non-surgical cases in the veterinary domain of equine colic, (b) the problem of diagnosing benign and malign types of breast cancer, and (c) the problem of corporate bankruptcy prediction (corporate ‘financial health'). Several aspects of comparison have been considered including the accuracy of the systems, diversity of the data processed, transparency and the form of decisions made.     

GIS-based decision support for solar energy planning in urban environments

This paper describes the development of a solar energy planning system, consisting of a methodology and decision support software for planners and energy advisers. Intended primarily to predict and realise the potential of solar energy on an urban scale, the system will support decisions in relation to the key solar technologies: solar water heating, photovoltaics and passive solar gain. The prototype discussed here relates to the first of these. Based on a methodology for predicting the solar energy potential of domestic housing stock, it is implemented as a relational database application linked to a customised geographical information system (GIS). The methodology takes into account baseline energy consumption and projected energy saving benefits. To support this, the system incorporates a domestic energy model and addresses the major problem of data collection in two ways. Firstly, it provides a comprehensive set of default values derived from a new dwelling classification scheme that builds on previous research. Secondly, novel GIS tools enable key data to be extracted from digital urban maps in different operational modes. The paper concludes with a discussion of possible planning scenarios to illustrate how the system may be deployed at various levels of granularity to assist targeting of individual properties or city neighbourhoods, or for whole-city projections.     

A decision support system for product design in concurrent engineering

Compared with the traditional sequential design method, concurrent engineering is a systematic approach to integrate concurrent design of products and their related processes. One of the key factors to successfully implement concurrent engineering is information technology. In order to design a product and its manufacturing process simultaneously, information on product features, manufacturing requirements, and customer demands must be processed while the design is concurrently going on. There is an increased understanding of the importance of the correct decisions being made at the conceptual design and development stages that involve many complex evaluation and decision-making tasks. In order to promote the efficiency in concurrent product development, appropriate evaluation and decision tools need to be provided. In this paper, the characteristics of fuzzy, multi-stage evaluation and decision making in concurrent product development process are analyzed and a decision support system for product design in concurrent engineering is presented. An example is given to illustrate the application of the system.