Anytime argumentative and abductive reasoning

This article presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm can be interrupted at any time returning the solution found so far. The quality of the approximation increases monotonically when more computational resources are available. The method is based on cost functions and returns lower and upper bounds.Research supported by (1) Alexander von Humboldt Foundation, (2) German Federal Ministry of Education and Research, (3) German Program for the Investment in the future.     

Communicating sequential processes for distributed constraint satisfaction

CSPCONS is a programming language that supports program execution over multiple Prolog processes with constraints. The language is an extended version of Csp-ii, a version of Prolog that supports channel-based communicating processes and TCP/IP communication, that is based on the CSP model introduced by Hoare. Cspcons inherits all the advanced features of Csp-ii and extends it by introducing constraint solving capabilities to the processes. In Cspcons each Prolog process has one or more solvers attached and each solver is independent from the others, following the original Csp-ii model, thus resulting to a communicating sequential constraint logic programming system. Such a model can facilitate greatly the implementation of distributed CLP applications. This paper describes the original Csp-ii system along with details of the extensions that resulted to the Cspcons system and presents an example demonstrating the applicability of the system to distributed constraint satisfaction problems.     

A multi-viewpoint system to support abductive reasoning

The paper proposes a multi-viewpoint system to support human abductive reasoning for diagnosis, prognosis and trial-and-error activities for supervising automated systems. This multi-viewpoint approach interprets the same set of events from the different viewpoints in this set. The algorithms for managing these viewpoints and the set of events are related to hypothetical reasoning, and they use several main functions to (1) select or reject certain events, (2) cancel or recover these events, and (3) manage the consistency of the viewpoints. This approach is applied to diagnosis and trial-and-error activities related to the phone troubleshooting problem.     

Compiling a default reasoning system into Prolog

Artificial intelligence researchers have been designing representation systems for default and abductive reasoning. Logic Programming researchers have been working on techniques to improve the efficiency of Horn clause deduction systems This paper describes how one such default and abductive reasoning system (namelyTheorist) can be translated into Horn clauses (with negation as failure), so that we can use the clarity of abductive reasoning systems and the efficiency of Horn clause deduction systems. We thus show how advances in expressive power that artificial intelligence workers are working on can directly utilise advances in efficiency that logic programming researchers are working on. Actual code from a running system is given.     

A framework for a distributed CAD system

The DIJA project is a web-based CAD system accessible to any user (from neophyte to expert) and from a simple desktop computer. Its modeling approach is based on a top-down methodology and takes into account trade information. In this paper, we propose a network architecture based on a replication process and a multi-level language to manage the consistency between the client model and the server model. The whole CAD system is based on a modular architecture communicating with messages exchanges and provides a general architecture for all trade CAD applications.     

Abduction in logic programming: A new definition and an abductive procedure based on rewriting

A long outstanding problem for abduction in logic programming has been on how minimality might be defined. Without minimality, an abductive procedure is often required to generate exponentially many subsumed explanations for a given observation. In this paper, we propose a new definition of abduction in logic programming where the set of minimal explanations can be viewed as a succinct representation of the set of all explanations. We then propose an abductive procedure where the problem of generating explanations is formalized as rewriting with confluent and terminating rewrite systems. We show that these rewrite systems are sound and complete under the partial stable model semantics, and sound and complete under the answer set semantics when the underlying program is so-called odd-loop free. We discuss an application of abduction in logic programming to a problem in reasoning about actions and provide some experimental results.     

Private local automation clouds built by CPS: Potential and challenges for distributed reasoning

The employment of cyber-physical systems allows the control of processes in modern production lines. On the other hand, several research works have recently presented how ontology-based knowledge representation can be a suitable method for modelling industrial systems. However, system models are located far away from where the data is generated which adds complexity for cross-domain communications and resource management. Current embedded devices can encapsulate ontological models that can be accessed as local resources. This article presents the integration of interconnected devices as the computational nodes of a cloud which is private and local. In this way, functionalities, such as knowledge management and process control can be performed closer to the industrial equipment. Moreover, this research work discusses the potential and challenges for performing distributed reasoning in the private local automation cloud. In addition, the article describes main aspects of the system architecture and the behaviour of the networked embedded devices in the cloud. The research work results will be used as a high-level roadmap for further system implementation.     

A fuzzy-rough approach for the maintenance of distributed case-based reasoning systems

Case-based reasoning (CBR) means reasoning from prior examples and it has considerable potential for building intelligent assistant system for the World Wide Web. In order to develop successful Web-based CBR systems, we need to select a set of representative cases for the client side case-base such that this thin client is competence in problem solving. This paper proposes a fuzzy-rough method of selecting cases for such a distributed CBR system, i.e., a thin client system (a smaller case-base with rules) connected to a comparatively more powerful server system (the entire original case-base). The methodology is mainly based on the idea that an original case-base can be transformed into a smaller case-base together with a group of fuzzy adaptation rules, which could be generated using our fuzzy-rough approach. As a result, the smaller case-base with a group of fuzzy rules will almost have the same problem coverage as the entire original case-base. The method proposed in this paper, consists of four steps. First of all, an approach of learning feature weights automatically is used to evaluate the importance of different features in a given case-base. Secondly, clustering of cases is carried out to identify different concepts in the case-base using the acquired feature weights. Thirdly, fuzzy adaptation rules are mined for each concept using a fuzzy-rough method. Finally, a selection strategy which based on the concepts of case coverage and reachability is used to select representative cases. The effectiveness of our method is demonstrated experimentally using some testing data in the travel domain. This project is supported by the Hong Kong Polytechnic University Grant G-V957 and H-ZJ90.     

Network fault diagnosis using a realistic abductive reasoning model

This paper proposes a method to solve the network fault diagnosis problem using the Realistic Abductive Reasoning Model. This model uses an abductive inference mechanism based on the parsimonious covering theory, and adds some new features to the general model of diagnostic problem-solving. The network fault-diagnosis knowledge is assumed to be represented in the form of causal chaining, namely, a hyper-bipartite graph. A layered graph is constructed from the given hyper-bipartite graph by the addition of a few dummy nodes. Then the diagnostic problem is solved, starting from the lowest layer of the layered graph, as a series of bipartite graphs, until the top-most layer is reached. The inference mechanism uses a Realistic Abductive Reasoning Model to diagnose the faults in a communication network, which is symptom-driven, based on some application programs. The hypothesis-test paradigm is used to refine the solution space. The fault-diagnostic capability of the proposed inference model is demonstrated by considering one node of a given network where the management information would be used to diagnose its local problems and the connectivity of the node in the network. The results obtained by the proposed model substantiate its effectiveness in solving network fault-diagnostic problems.     

Explanation and prediction: an architecture for default and abductive reasoning

Although there are many arguments that logic is an appropriate tool for artificial intelligence, there has been a perceived problem with the monotonicity of classical logic. This paper elaborates on the idea that reasoning should be viewed as theory formation where logic tells us the consequences of our assumptions. The two activities of predicting what is expected to be true and explaining observations are considered in a simple theory formation framework. Properties of each activity are discussed, along with a number of proposals as to what should be predicted or accepted as reasonable explanations. An architecture is proposed to combine explanation and prediction into one coherent framework. Algorithms used to implement the system as well as examples from a running implementation are given.     

Influence-based model decomposition for reasoning about spatially distributed physical systems

Many important science and engineering applications, such as regulating the temperature distribution over a semiconductor wafer and controlling the noise from a photocopy machine, require interpreting distributed data and designing decentralized controllers for spatially distributed systems. Developing effective computational techniques for representing and reasoning about these systems, which are usually modeled with partial differential equations (PDEs), is one of the major challenge problems for qualitative and spatial reasoning research.

This paper introduces a novel approach to decentralized control design, influence-based model decomposition, and applies it in the context of thermal regulation. Influence-based model decomposition uses a decentralized model, called an influence graph, as a key data abstraction representing influences of controls on distributed physical fields. It serves as the basis for novel algorithms for control placement and parameter design for distributed systems with large numbers of coupled variables. These algorithms exploit physical knowledge of locality, linear superposability, and continuity, encapsulated in influence graphs representing dependencies of field nodes on control nodes. The control placement design algorithms utilize influence graphs to decompose a problem domain so as to decouple the resulting regions. The decentralized control parameter optimization algorithms utilize influence graphs to efficiently evaluate thermal fields and to explicitly trade off computation, communication, and control quality. By leveraging the physical knowledge encapsulated in influence graphs, these control design algorithms are more efficient than standard techniques, and produce designs explainable in terms of problem structures.     

Toward a cloud-based manufacturing execution system for distributed manufacturing

This paper illustrates the needs and challenges for the management of distributed manufacturing in a multi-company supply chain and processes these further as features of new IT systems. Requirements are collected from manufacturing companies and combined with insights from literature in the field of current ERP/MES system drawbacks, advantages, needs and challenges. The findings show that the needs and challenges in data integration inside SME networks are closely related to the limitations of current supply chain solutions. Current ERP-solutions lack extended enterprise support and a shared cloud-based approach. On the other hand, current MES solutions can operate the manufacturing process, but not for distributed manufacturing. As an answer to the requirements, we made a proposal for the core of architecture for next generation of MES solution in this position paper. Moreover, a pilot software tool has been developed to support the needs related to real time, cloud-based, light weight operation.     

Mariposa: a wide-area distributed database system

The requirements of wide-area distributed database systems differ dramatically from those of local-area network systems. In a wide-area network (WAN) configuration, individual sites usually report to different system administrators, have different access and charging algorithms, install site-specific data type extensions, and have different constraints on servicing remote requests. Typical of the last point are production transaction environments, which are fully engaged during normal business hours, and cannot take on additional load. Finally, there may be many sites participating in a WAN distributed DBMS. In this world, a single program performing global query optimization using a cost-based optimizer will not work well. Cost-based optimization does not respond well to site-specific type extension, access constraints, charging algorithms, and time-of-day constraints. Furthermore, traditional cost-based distributed optimizers do not scale well to a large number of possible processing sites. Since traditional distributed DBMSs have all used cost-based optimizers, they are not appropriate in a WAN environment, and a new architecture is required. We have proposed and implemented an economic paradigm as the solution to these issues in a new distributed DBMS called Mariposa. In this paper, we present the architecture and implementation of Mariposa and discuss early feedback on its operating characteristics. Edited by Henry F. Korth and Amith Sheth. Received November 1994 / Revised June 1995 / Accepted September 14, 1995     

Execution system for distributed business processes in a virtual enterprise

New cooperative approaches for manufacturing and service industries, as represented by the virtual enterprise paradigm, are enabled by the recent advances in communication technologies, computer networks, and logistics. The implantation of this paradigm requires the design and development of a flexible execution environment to support the distributed business processes that materialize the cooperation in a network of enterprises. A configurable architecture for such execution system is proposed focusing the support for multi-level process coordination. A set of examples to illustrate the adopted concepts and developed tools are discussed.     

A distributed graphics library system

We present a set of library routines that allow easily parallelized graphics rendering routines that require no communication between each parallel task, such as ray-tracing, to be run efficiently in an environment of distributed workstations. The presentation of the paper focuses on the problems encountered in implementing a distributed system under Unix and proposes solutions to each problem. Specifically, we discuss the challenges involved in overcoming the limits of communicating with a large number of processes in Unix and in providing fault tolerance when using sockets. Technical aspects of the implementation and some additional problems that were encountered are discussed. Finally, we compare the rendering times for a complex image with a renderer using the library and show that the library routines are able to exploit much of the existing parallelism. The library is presented using a graphics application, though the concepts are generic enough to be of use in designing any distributed system under Unix.     

The Vidboard: A video capture and processing peripheral for a distributed multimedia system

This paper describes a network-based video capture and processing peripheral, called the Vidboard, for a distributed multimedia system centered around a 1-Gbit/s asynchronous transfer mode (ATM) network. The Vidboard is capable of generating full-motion video streams having a range of presentation (picture size, color space, etc.) and network (traffic, transport, etc.) characteristics. The board is also capable of decoupling video from the real-time constraints of the television world, which allows easier integration of video into the software environment of computer systems. A suite of ATM-based protocols has been developed for transmitting video from the Vidboard to a workstation, and a series of experiments are presented in which video is transmitted to a workstation for display.     

Necessary and sufficient conditions for transaction-consistent global checkpoints in a distributed database system

Checkpointing and rollback recovery are well-known techniques for handling failures in distributed systems. The issues related to the design and implementation of efficient checkpointing and recovery techniques for distributed systems have been thoroughly understood. For example, the necessary and sufficient conditions for a set of checkpoints to be part of a consistent global checkpoint has been established for distributed computations. In this paper, we address the analogous question for distributed database systems. In distributed database systems, transaction-consistent global checkpoints are useful not only for recovery from failure but also for audit purposes. If each data item of a distributed database is checkpointed independently by a separate transaction, none of the checkpoints taken may be part of any transaction-consistent global checkpoint. However, allowing individual data items to be checkpointed independently results in non-intrusive checkpointing. In this paper, we establish the necessary and sufficient conditions for the checkpoints of a set of data items to be part of a transaction-consistent global checkpoint of the distributed database. Such conditions can also help in the design and implementation of non-intrusive checkpointing algorithms for distributed database systems.     

Mos: A multicomputer distributed operating system

This paper describes the goals and the internal structure of MOS, a Multicomputer distributed Operating System. MOS is a general-purpose time-sharing operating system which makes a cluster of loosely connected independent homogeneous computers behave as a single-machine UNIX system. The main goals of the system include network transparency, decentralized control, site autonomy and dynamic process migration. The main objective in the design of the system was to reduce the complexity of the system, while maintaining good performance. The internal structure of the system can be characterized by modularity, a high degree of information hiding, hierarchical organization and remote procedure calls.     

A flexible communications protocol for a distributed surveillance system

On-line surveillance for safety and security is a major requirement of public transport and other public places to address the modern demands of mobility in major urban areas and to effect improvements in quality of life and environment protection. The surveillance task is a complex one involving technology, management procedures and people. Visual surveillance based on Closed Circuit Television system is an important part of such systems, but visual processing is not sufficient and the geographical distribution of devices and management has to be taken into account. In this paper we present a surveillance architecture that reflects the distributed nature of the monitoring task and allows for distributed detection processes, not only dealing with visual processing but also with devices such as acoustic signature detection and mobile smart cards, actuators and a range of other possible sensors. The design uses ideas from control engineering and distributed communications networks resulting in a communications architecture based on CORBA and XML messaging. We have shown how to define a generic device/sensor model appropriate for the surveillance task and sufficiently flexible so as to allow for scalability, expansion and customisation of a practical surveillance task. The paper gives sufficient details on the protocols to show how intelligent detection modules can be integrated as part of this kind of system. The system components have been implemented and integrated in two major successful trials in metropolitan railway stations in London and in Paris, as part of a major EU-funded project (PRISMATICA).