Multiagent reasoning with probability,time, and beliefs

Any agent interacting with the real world must be able to reason about uncertainty in the world, about the actions that may occur in the world (either due to the agent or those initiated by other agents), about the (probabilistic) beliefs of other agents, and how these (probabilistic) beliefs are changing over time. In this article, we develop a family of logics that a reasoning agent may use to perform successively more sophisticated types of reasoning in such environments. We also characterize different types of agents. Furthermore, we provide a logic that enables a systems designer (who may have populated an environment with a collection of such autonomous agents) to reason about the system of agents as a whole. © 1995 John Wiley & Sons, Inc.     

Reasoning in inconsistent knowledge bases

Databases and knowledge bases could be inconsistent in many ways. For example, during the construction of an expert system, we may consult many different experts. Each expert may provide us with a group of rules and facts which are self-consistent. However, when we coalesce the facts and rules provided by these different experts, inconsistency may arise. Alternatively, knowledge bases may be inconsistent due to the presence of some erroneous information. Thus, a framework for reasoning about knowledge bases that contain inconsistent information is necessary. However, existing frameworks for reasoning with inconsistency do not support reasoning by cases and reasoning with the law of excluded middle (“everything is either true or false”). In this paper, we show how reasoning with cases, and reasoning with the law of excluded middle may be captured. We develop a declarative and operational semantics for knowledge bases that are possibly inconsistent. We compare and contrast our work with work on explicit and non-monotonic modes of negation in logic programs and suggest under what circumstances one framework may be preferred over another     

Protected completions of first-order general logic programs

Minker and Perlis [15] have made the important observation that in certain circumstances, it might be desirable to prevent the inference of A when A is in the finite failure set of a logic program P. In this paper, we investigate the model-theoretic aspects of their proposal and develop a Fitting-style [5] declarative semantics for protected completions of general logic programs (containing function symbols). This extends the Minker-Perlis proposal which applies to function-free pure logic programs. In addition, an operational semantics is proposed and it is proven to be sound for existentially quantified positive queries and negative ground queries to general, canonical protected logic programs. Completeness issues are investigated and completeness is proved for positive existential queries and negative ground queries for the following classes of programs: (1) function-free general protected logic programs (the Minker-Perlis operational semantics apply to function-free pure protected logic programs), (2) pure protected logic programs (with function symbols) and (3) protected general logic programs that do not contain any internal variables (though they may contain function symbols).     

Effect of adhesive‐coated glass fiber in natural rubber (NR), acrylonitrile rubber (NBR), and ethylene–propylene–diene rubber (EPDM) formulations. II. Effect of cyclic loading,abrasion, and accelerated aging

Treated glass fibers (RICS, 3 and 6 mm in length) were added at a concentrations of 10, 20, and 30 phr in natural rubber (NR), nitrile rubber (NBR), and ethylene–propylene–diene comonomer (EPDM) formulations, in both plain and carbon black mixes. The compounds were mixed in two‐roll mill and were evaluated for their resistance to hot‐air aging, abrasion, compression set, Goodrich heat buildup, De Mattia fatigue, and for NR mixes, adhesion in the tensile mode. The vulcanizates of the three rubbers showed resistance to hot‐air aging. Abrasion resistance was poor for NR, and it improved with carbon black addition in the presence of treated glass fiber in NBR. In carbon‐black‐added EPDM vulcanizates, the abrasion resistance and fatigue resistance were better. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 91: 1124–1135, 2004     

Retrieval schedules based on resource availability and flexible presentation specifications

A distributed multimedia document presentation involves retrieval of objects from one or more document servers and their presentation at the client system. The presentation of the multimedia objects has to be carried out in accordance with the specification of temporal relationships between the objects. The retrieval of multimedia objects from the document server(s) is influenced by factors such as temporal specification of objects presentations, throughput offered by the network service provider, and the buffer resources on the client system. Flexibility in the temporal specification of the multimedia document may help in deriving an object retrieval schedule that can handle variations in network throughput and buffer resource availability. In this paper, we develop techniques for deriving a flexible object retrieval schedule for a distributed multimedia document presentation. The schedule is based on flexible temporal specification of the multimedia document using the difference constrai nts approach. We show how the derived retrieval schedule can be validated and modified to ensure that it can work with the offered network throughput and the available buffer resources.     

Handling Updates and Crashes in VoD Systems

Though there have been several recent efforts to develop disk based video servers, these approaches have all ignored the topic of updates and disk server crashes. In this paper, we present a priority based model for building video servers that handle two classes of events: user events that could include enter, play, pause, rewind, fast-forward, exit, as well assystem events such as insert, delete, server-down, server-up that correspond to uploading new movie blocks onto the disk(s), eliminating existing blocks from the disk(s), and/or experiencing a disk server crash. We will present algorithms to handle such events. Our algorithms are provably correct, and computable in polynomial time. Furthermore, we guarantee that under certain reasonable conditions, continuing clients experience jitter free presentations. We further justify the efficiency of our techniques with a prototype implementation and experimental results.     

Effect of adhesive‐coated glass fiber in natural rubber (NR), acrylonitrile rubber (NBR), and ethylene–propylene–diene rubber (EPDM) formulations. I. Effect of adhesive‐coated glass fiber on the curing and tensile properties of NR,NBR, and EPDM formulations

Adhesive‐coated glass fibers (3 and 6 mm in length) were added at loadings of 10, 20, and 30 phr in natural rubber (NR), nitrile rubber (NBR), and ethylene–propylene–diene comonomer (EPDM) formulations in both plain and carbon black mixes. The compounds were mixed in a two‐roll mill and were characterized for their cure properties, tensile, tear, and Mullin's effect. In NR mixes, all of the formulations showed reversion in cure behavior, suggesting that NR remained unaffected. In NBR and EPDM mixes, almost all of the mechanical properties of the fiber improved. The result was more significant in EPDM than in NBR. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 91: 1111–1123, 2004     

Computing the fault tolerance of multi-agent deployment

A deployment of a multi-agent system on a network refers to the placement of one or more copies of each agent on network hosts, in such a manner that the memory constraints of each node are satisfied. Finding the deployment that is most likely to tolerate faults (i.e. have at least one copy of each agent functioning and in communication with other agents) is a challenge. In this paper, we address the problem of finding the probability of survival of a deployment (i.e. the probability that a deployment will tolerate faults), under the assumption that node failures are independent. We show that the problem of computing the survival probability of a deployment is at least NP-hard. Moreover, it is hard to approximate. We produce two algorithms to accurately compute the probability of survival of a deployment—these algorithms are expectedly exponential. We also produce five heuristic algorithms to estimate survival probabilities—these algorithms work in acceptable time frames. We report on a detailed set of experiments to determine the conditions under which some of these algorithms perform better than the others.     

Creating Shared Information Spaces to Support Collaborative Design Work

The provision of computer support for collaborative work is a central concern for Information Systems (IS) research and practice. In this paper we present the details of an information flow study undertaken in the household division of a large European design and manufacturing company (Delta). The goal of the study was to elicit user requirements for a computer system to facilitate the collaborative work of new product design teams. These requirements form the basis for the design and development of a Web-based LIRÉ (Living Repository) prototype system, the functionalities, features, and rationale of which are discussed. We also present the results of the evaluation of LIRÉ by the users at Delta and our observations on enhancing the sophistication and usefulness of this class of system. A production version based on the prototype but using commercially available software is currently in use by the New Product Development group at Delta.