ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (173)
  • Blackwell Publishing Ltd  (173)
  • 1995-1999  (152)
  • 1980-1984  (21)
  • 1925-1929
  • Computer Science  (173)
  • 1
    Electronic Resource
    Electronic Resource
    Applications of artificial neural networks to the nonlinear combination of forecasts (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: This paper proposes artificial neural networks (ANN) as a tool for nonlinear combination of forecasts. In this study, three forecasting models are used for individual forecasts, and then two linear combining methods are used to compare with the ANN combining method. The comparative experiment using real-world data shows that the prediction by the ANN method outperforms those by linear combining methods. The paper suggests that the ANN method can be used as an alternative to conventional linear combining methods to achieve greater forecasting accuracy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00119.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Book Reviews (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The Handbook of Brain Theory and Neural Networks Michael A. Arbib (Ed.)Virtual Reality Systems John VinceThe Uncertain Reasoner's Companion J. B. Paris
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00122.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    News (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00188.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Book Reviews (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Open Distributed Systems Jon Crowcrofi
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00128.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A generic, object-oriented case-knowledge representation scheme, and its integration into a wider information management scenario (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: A knowledge base management system (KBMS) realises a combination of techniques found in database management systems and knowledge-based systems. At the data model and knowledge representation level, many systems of this kind constitute a marriage of the relational data model and the rule-based reasoning. Experience has shown that either approach is restricted in the way it can express the demanding information and knowledge structures required for applications like decision support systems. Two new technologies offer an exciting new integrated approach to knowledge management. Object-oriented database management systems (OODBMS) provide an object model that supports powerful abstraction mechanisms to facilitate the modelling of highly structured information. Whereas case-based reasoning (CBR) systems are knowledge bases which organise their capabilities around a memory of past cases and the notion of similarity. Both types of system are built upon two fundamental concepts: 1) the retrieval of entities with potentially complex structure, called objects in the former, and cases in the latter type of system; 2) the organisation of those entities in collections with common characteristics. In an OODBMS such collections are termed extents, and in CBR they are usually called categories. In either system, the conceptual meta notion to represent both, objects as well as extents, and cases as well as categories, is the class.Revolving around a Conceptual Case Class and extending a standard object model, this paper proposes a novel and general approach to represent case-knowledge and to build KBMSs. The work presented here is a spin-off of the design of an object query language within the ESPRIT project Lynx.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00121.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Standardising the elimination of unnecessary data from interview transcripts for the purposes of knowledge-based systems — a case study (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Although knowledge elicitation, the process of extracting knowledge from human experts to be incorporated into a knowledge-based system, has been the subject of some notable studies, less attention has been paid to the methods of analysing the raw data once it has been extracted from the expert. When knowledge elicitation sessions are interview-based, the resultant form of raw data is usually a transcript of the interviewee's utterances. This paper describes an investigation into the preliminary stage of analysing such transcripts. It outlines the development of an approach to eliminate unnecessary detail from interview transcripts, thus enabling attention to be focused upon the remaining, more relevant data via a simple technique based upon cheap and readily available technology. The paper then outlines a rapid-prototyping approach for evaluating this method, the results of which were felt to be very encouraging.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00279.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Reimbursements up, coding time down (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00273.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Call for Papers (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00278.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Negotiation in a knowledge-based concurrent engineering design environment (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Computational support for concurrent engineering design presents a number of issues in the design of knowledge-based systems. A fundamental concern is the need to provide the life-cycle perspective in recommending design alternatives. It is argued that such a complex knowledge-based system should be distributed, due to the inherent problems with large knowledge bases and the maintenance of consistency. Inconsistent local views of a problem and different priorities on design issues are expected between different knowledge-based design perspectives. These inconsistencies and different priorities will lead inherently to conflict which has to be resolved. This paper addresses the issues and key variables in conflict resolution and presents a strategy that can be applied for managing the conflict resolution process. We propose negotiation as the method of analysing a conflict situation, applying an appropriate conflict resolution strategy and monitoring its performance. We present an overview of the nature of conflict and some conflict resolution strategies, and see in what situations certain strategies are appropriate.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00046.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Computers learn to smell and taste (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: They all stink: food and drink, perfumery, household products, soaps, shampoos, paints, manufacturing processes, printing processes, waste products, contaminated air, and automotive emissions and environmental testing. In every case, small is a criterion of quality.Automated techniques to ‘smell’ or ‘taste’ liquids using mass spectrometry and gas chromatography are time consuming, require skilled personnel and often do not give the information required for qualitative ‘testing’. A new technique is now available due to the advances in neural computing technology and multi-sensor array technology. The combination of these two approaches tries to simulate the human olfactory system in a simplified form. This paper shows that the recognition ability of an odour sensor array will be significantly improved using a neural computing approach in order to discriminate between similar odours.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00048.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 11
    Electronic Resource
    Electronic Resource
    Applications (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00051.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    Languages (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00059.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    Tools (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00058.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    Designing for flexibility: a case study (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Expert systems have traditionally been designed with one particular purpose in mind, whether problem-solving, critiquing etc. When the system is intended for users with varying background knowledge it becomes necessary to provide different facilities for different groups of users, which in turn puts demands on how the knowledge must be represented. This paper describes an industrial prototype—Protein Purification Advisor (PPA)—in the area of protein purification, and how a suitable choice of knowledge representation has allowed us to use the same knowledge for a number of purposes including those mentioned above. Particular interest is laid on the topic of how to represent the heuristic knowledge and how to use it in actual decision-making.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00023.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 15
    Electronic Resource
    Electronic Resource
    Knowledge acquisition and adaptation: a genetic approach (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: A genetic algorithm-based (GA-based) system (GAPOLE) is used to evolve a self-learning, self-optimising control strategy for a typical inherently unstable, dynamic system—a simulated pole-cart system. The dynamics of the system are unknown to GAPOLE. The only information for evaluating performance is a signal indicating that the pole-cart system is out of control. This presents a genuinely difficult credit assignment problem. We present some evidence which shows that GAPOLE compares well with the best alternative methods, but it is noteworthy that it is most robust. It is argued that maintaining a population of partial solutions offers some advantages: GA-based algorithms can deliver more than one good solution at a time; they are able to adapt better in complex changing conditions. Results characterising the performance of the method as population size is varied are also presented. The results show that GAPOLE performed best with a population size of 300. Therefore it is suggested that this parameter, like other GA parameters, may have to be tailored to a particular application. This appears to contradict an earlier claim that a population size in the range of 60–110 is optimal for genetic algorithm-based applications (Grefenstette 1986) across domains.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00021.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 16
    Electronic Resource
    Electronic Resource
    Intelligent agents (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00032.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 17
    Electronic Resource
    Electronic Resource
    Languages (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00036.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 18
    Electronic Resource
    Electronic Resource
    Fuzzy logic (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00040.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 19
    Electronic Resource
    Electronic Resource
    Countermatch in the community (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00050.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 20
    Electronic Resource
    Electronic Resource
    Neural networks (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00053.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 21
    Electronic Resource
    Electronic Resource
    Virtual reality tools (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00057.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 22
    Electronic Resource
    Electronic Resource
    Applying KADS to KADS: knowledge-based guidance for knowledge engineering (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: The KADS methodology (Schreiber et al. 1993; Tansley & Hayball 1993) and its successor, CommonKADS (Wielinga et al. 1992) have proved to be very useful approaches for modelling the various transformations involved between eliciting knowledge from an expert and encoding this knowledge in a computer program. These transformations are represented in a series of models. While it is widely agreed that these methods are excellent approaches from a theoretical viewpoint, the documentation provided concentrates on defining what models should be produced, with only general guidance on how the models should be produced. This has the advantage of making KADS and CommonKADS widely applicable, but it also means that considerable training and experience is required to become proficient in them. This paper reviews three projects that investigated the feasibility of producing specific guidance for certain decisions which are required when using KADS or CommonKADS to develop a knowledge-based system. Guidance was produced for the identification of the generic task addressed by a knowledge-based system; for the selection of appropriate AI techniques for implementing the analysed knowledge; and for selecting a suitable tool for implementing the system. Each set of guidance was encoded in its own knowledge-based system, which was itself developed with the assistance of KADS or CommonKADS. These projects therefore both studied and applied KADS and CommonKADS in order to produce knowledge-based guidance for knowledge engineers. The projects showed that it was feasible to produce heuristic guidance which could be understood, applied and occasionally overridden by knowledge engineers. The guidance provides reasonably experienced knowledge engineers with a framework for making the key decisions required by CommonKADS, in the same way that CommonKADS provides knowledge engineers with a framework for representing knowledge. The projects also produced some new insights about CommonKADS domain modelling and about the process of task identification.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00022.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 23
    Electronic Resource
    Electronic Resource
    Virtual reality applications (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00033.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 24
    Electronic Resource
    Electronic Resource
    Conferences, courses, seminars (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00042.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 25
    Electronic Resource
    Electronic Resource
    Hardware (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00038.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 26
    Electronic Resource
    Electronic Resource
    Development of an expert system (1984)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 1 (1984), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1984.tb00438.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 27
    Electronic Resource
    Electronic Resource
    ISIS—a knowledge-based system for factory scheduling (1984)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 1 (1984), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Analysis of the job shop scheduling domain has indicated that the crux of the scheduling problem is the determination and satisfaction of a large variety of constraints. Schedules are influenced by such diverse and conflicting factors as due date requirements, cost restrictions, production levels, machine capabilities and substitutability, alternative production processes, order characteristics, resource requirements, and resource availability. This paper describes ISIS, a scheduling system capable of incorporating all relevant constraints in the construction of job shop schedules. We examine both the representation of constraints within ISIS, and the manner in which these constraints are used in conducting a constraint-directed search for an acceptable schedule. The important issues relating to the relaxation of constraints are addressed. Finally, the interactive scheduling facilities provided by ISIS are considered.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1984.tb00424.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 28
    Electronic Resource
    Electronic Resource
    Knowledge types: a practical approach to guide knowledge engineering in domains of building design (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: This paper presents experiences and findings achieved through several expert system projects in domains of technical buiding design. The main focus is on knowledge acquisition and knowledge decomposition. Different approaches are presented and discussed. Four types of knowledge are presented: object knowledge, performance knowledge, event knowledge and metaknowledge, and the applicability of this classification to building design is justified. The paper includes a listing of experiences gained by real world testing of an expert system, and finally we outline guidelines to knowledge engineering in the domain of technical building
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00186.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 29
    Electronic Resource
    Electronic Resource
    Citation-based journal rankings for expert system research (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Research into the development and impacts of expert systems has accumulated to a point where it may be said to constitute a distinct field of study. As such, the evolution, organisation and dissemination of expert system research are themselves topics for investigation. Here we focus on the dissemination aspect, providing objective rankings of journals that have had the greatest impacts on recent expert system research. Our study examines the citation patterns of all research published in five expert systems journals during the past five years. Over 14 000 citations to more than 800 journals are analysed under two kinds of ranking schemes. These are based on cumulative citation counts and normalised citation counts. The latter adjusts for the number of years a journal article has been available to be cited. The reported rankings will be of interest to all who want to know where scientific developments that influence expert system research are reported: those who conduct, support, evaluate and study expert system research.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00268.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 30
    Electronic Resource
    Electronic Resource
    The MD Shell and its use to develop Dust-Expert (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: In this paper we describe TheMD (The Methods Designer) shell and its use in the development of an expert system, known as Dust-Expert, for the relief of dust explosions. We begin by providing the motivation for the development of TheMD Shell by evaluating a prototype implementation of Dust-Expert using a conventional shell. This evaluation is carried out in terms of the transparency, reliability and extensibility of the system.The lessons learned from this evaluation have led to the development of TheMD Shell. We describe the main features of the shell which include more appropriate schemas, more complete explanation capabilities, a ranking scheme and equation-solving capabilities. We illustrate the use of the schemas and the importance of the equation-solving capabilities by examples from the domain of dust explosions. We also provide a formal specification of the ranking scheme that we adopt. We conclude by highlighting the benefits of our approach in comparison to the usual process of developing knowledge-based systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00112.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 31
    Electronic Resource
    Electronic Resource
    A bibliography of neural network business applications research: 1988–September 1994 (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: The purpose of this research is to present a comprehensive bibliography of neural network application research in business. One hundred and twenty-seven neural network application papers and reports are identified through exhaustive literature searches. A classification of these articles by application area reveals that neural networks are being used for a diverse range of corporate functional activities, particularly in the areas of production/operations and finance. Information on the neural network development language/tool, the learning paradigm and the computer operating environment as reported in each article is included. Those journals which have published the most neural network business applications are also presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00114.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 32
    Electronic Resource
    Electronic Resource
    Book Reviews (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Subjective Probability George Wright and Peter Ayton (Eds.)Knowledge-based Information Systems D. Partridge and K. M. HussainIntelligent Agents: the New Revolution in Software Christine Guilfoyle and Ellie WarnerHigh Performance Computing Demystified D. Loshin, AP ProfessionalKnowledge Processing and Applied Artificial Intelligence Soumitra Dutta
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00116.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 33
    Electronic Resource
    Electronic Resource
    News (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00117.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 34
    Electronic Resource
    Electronic Resource
    A neural network-based real-time robot tracking controller using position sensitive detectors (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: A real-time visual servo tracking system for an industrial robot has been developed. Instead of a charge coupled device (CCD), a position sensitive detector (PSD) is used as the real-time vision sensor due to its fast response (the light position is transduced to analogue current). A neural network learns the complex association between the 3D object position and its sensor reading, and uses it to track that object, either moving or stationary. It also turns out that this scheme lends itself to a user-friendly way to teach workpaths for industrial robots. Furthermore, for real-time use of the neural net, an efficient neural network architecture has been developed based on the concept of input space partitioning and local learning. Real experiments indicate the system's characteristics of fast processing and learning as well as optimal usage of network resources.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00044.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 35
    Electronic Resource
    Electronic Resource
    Fuzzy temporal reasoning for process supervision (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Process supervision consists of following the temporal evolution (change) of process behaviours. This task has usually been performed based on the knowledge and experience of domain experts and operators. Actually, these experts and operators almost always express their experience and knowledge about process evolution in an imprecise, fuzzy and vague way. A good supervision system should be capable of dealing at once with two different kinds of knowledge: time and uncertainty.For many years, time and uncertainty have been two of the most important topics in Artificial Intelligence research and applications. Many approaches have been proposed to deal with either one or the other. Among the various approaches for time, reified logic has been considered as the most influent one. Possibilistic logic, on the other hand, has shown its ability to handle uncertain knowledge and information. This paper describes an approach for managing temporal uncertainty based on fuzzy logic and possibility theory. A fuzzy temporal expert system shell has been developed to perform process supervision tasks.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00045.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 36
    Electronic Resource
    Electronic Resource
    Intelligent agents (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00054.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 37
    Electronic Resource
    Electronic Resource
    History spot (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00062.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 38
    Electronic Resource
    Electronic Resource
    Best Practice Guidelines for neural computing (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00026.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 39
    Electronic Resource
    Electronic Resource
    A word of expert advice for Swedish VAT advisors (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00025.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 40
    Electronic Resource
    Electronic Resource
    Parallel implementation of the fuzzy ARTMAP neural network paradigm on a hypercube (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: The recent surge of interest in connectionist models arose through the availability of high speed parallel supercomputers and the advent of new learning algorithms. The computations performed on concurrent architectures are less costly than similar ones performed on sequential machines. In this paper, the design and implementation of a parallel version of fuzzy ARTMAP (Carpenter et al. 1992), which encompasses both neural and fuzzy logic, is discussed. Fuzzy ARTMAP is a supervised learning algorithm utilising two fuzzy ART modules and an associated mapping network. A simplified version of fuzzy ARTMAP (SFAM) was designed by incorporating a simplification of the match tracking concept on unsupervised fuzzy ART paradigms. The proposed simplified version consists of only one fuzzy ART module and an associated mapping network. A parallel fuzzy ARTMAP (PFAM) algorithm is then designed and implemented on a hypercube simulator (iPSC). The algorithm is parallelised for any architecture and, with the exception of issues related to communications, the implementation remains the same on any type of parallel machine. PFAM enjoys the advantage of reduced training time that makes the algorithm a successful candidate for applications that require both online testing and training. Such applications can range from underwater sonar detection and chemical plant processing control to nuclear reactor process control, flexible manufacturing and systems analysis.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00024.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 41
    Electronic Resource
    Electronic Resource
    Curtain call for the disabled (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00028.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 42
    Electronic Resource
    Electronic Resource
    Expert systems (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00030.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 43
    Electronic Resource
    Electronic Resource
    Speech recognition (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00037.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 44
    Electronic Resource
    Electronic Resource
    Company news (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00041.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 45
    Electronic Resource
    Electronic Resource
    NOTE OF APPRECIATION FROM THE EDITORS (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00274.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 46
    Electronic Resource
    Electronic Resource
    COMPUTATION OF BEST BOUNDS OF PROBABILITIES FROM UNCERTAIN DATA (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: An uncertainty reasoning method is presented in this article. The method can be used to compute from a given set of conditional probabilities the best lower bounds and the best upper bounds of those conditional probabilities that are not explicitly provided. The computation of the best upper(lower) bound of such a conditional probability relies on solution of a linear programming problem. Some reduction techniques are proposed in this article to improve the efficiency of our uncertainty reasoning method. As illustrated in Section 4.3, for many uncertainty reasoning problems in medical diagnosis, by using our reduction techniques, the best range of a conditional probability, which is specified by a lower bound and an upper bound, can be computed in polynomial time in terms of the number of basic events involved in the reasoning.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00276.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 47
    Electronic Resource
    Electronic Resource
    INCREMENTAL CONCEPT FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The Galois (or concept) lattice produced from a binary relation has proved useful for many applications. Building the Galois lattice can be considered a conceptual clustering method because it results in a concept hierarchy. This article presents incremental algorithms for updating the Galois lattice and corresponding graph, resulting in an incremental concept formation method. Different strategies are considered based on a characterization of the modifications implied by such an update. Results of empirical tests are given in order to compare the performance of the incremental algorithms to three other batch algorithms. Surprisingly, when the total time for incremental generation is used, the simplest and less efficient variant of the incremental algorithms outperforms the batch algorithms in most cases. When only the incremental update time is used, the incremental algorithm outperforms all the batch algorithms. Empirical evidence shows that, on the average, the incremental update is done in time proportional to the number of instances previously treated. Although the worst case is exponential, when there is a fixed upper bound on the number of features related to an instance, which is usually the case in practical applications, the worst-case analysis of the algorithm also shows linear growth with respect to the number of instances.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00031.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 48
    Electronic Resource
    Electronic Resource
    VAGUENESS AND UNCERTAINTY: A ROUGH SET PERSPECTIVE (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Vagueness and uncertainty have attracted the attention of philosophers and logicians for many years. Recently, AI researchers contributed essentially to this area of research. Fuzzy set theory and the theory of evidence are seemingly the most appealing topics. On this note we present a new approach, based on the rough set theory, for looking to these problems. The theory of rough sets seems a suitable mathematical tool for dealing with problems of vagueness and uncertainty. This paper is a modified version of the author's lecture titled “An inquiry into vagueness and uncertainty,” which was delivered at the AI Conference in Wigry (Poland), 1994.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00029.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 49
    Electronic Resource
    Electronic Resource
    ESTIMATING DBLEARN'S POTENTIAL FOR KNOWLEDGE DISCOVERY IN DATABASES (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We propose a procedure for estimating DBLEARN's potential for knowledge discovery, given a relational database and concept hierarchies. This procedure is most useful for evaluating alternative concept hierarchies for the same database. The DBLEARN knowledge discovery program uses an attribute-oriented inductive-inference method to discover potentially significant high-level relationships in a database. A concept forest, with at most one concept hierarchy for each attribute, defines the possible generalizations that DBLEARN can make for a database. The potential for discovery in a database is estimated by examining the complexity of the corresponding concept forest. Two heuristic measures are defined based on the number, depth, and height of the interior nodes. Higher values for these measures indicate more complex concept forests and arguably more potential for discovery. Experimental results using a variety of concept forests and four commercial databases show that in practice both measures permit quite reliable decisions to be made; thus, the simplest may be most appropriate.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00033.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 50
    Electronic Resource
    Electronic Resource
    A FRAMEWORK FOR LOGICS OF EXPLICIT BELIEF (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The epistemic notions of knowledge and belief have most commonly been modeled by means of possible worlds semantics. In such approaches an agent knows (or believes) all logical consequences of its beliefs. Consequently, several approaches have been proposed to model systems of explicit belief, more suited to modeling finite agents or computers. In this paper a general framework is developed for the specification of logics of explicit belief. A generalization of possible worlds, called situations, is adopted. However the notion of an accessibility relation is not employed; instead a sentence is believed if the explicit proposition expressed by the sentence appears among a set of propositions associated with an agent at a situation. Since explicit propositions may be taken as corresponding to “belief contexts” or “frames of mind,” the framework also provides a setting for investigating such approaches to belief. The approach provides a uniform and flexible basis from which various issues of explicit belief may be addressed and from which systems may be contrasted and compared. A family of logics is developed using this framework, which extends previous approaches and addresses issues raised by these earlier approaches. The more interesting of these logics are tractable, in that determining if a belief follows from a set of beliefs, given certain assumptions, can be accomplished in polynomial time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00023.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 51
    Electronic Resource
    Electronic Resource
    EFFICIENT TEMPORAL REASONING IN THE CACHED EVENT CALCULUS (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This article deals with the problem of providing Kowalski and Sergot's event calculus, extended with context dependency, with an efficient implementation in a logic programming framework. Despite a widespread recognition that a positive solution to efficiency issues is necessary to guarantee the computational feasibility of existing approaches to temporal reasoning, the problem of analyzing the complexity of temporal reasoning programs has been largely overlooked. This article provides a mathematical analysis of the efficiency of query and update processing in the event calculus and defines a cached version of the calculus that (i) moves computational complexity from query to update processing and (ii) features an absolute improvement of performance, because query processing in the event calculus costs much more than update processing in the proposed cached version.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00267.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 52
    Electronic Resource
    Electronic Resource
    INTERACTIVE SEMANTIC ANALYSIS OF TECHNICAL TEXTS (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Sentence syntax is the basis for organizing semantic relations in TANKA, a project that aims to acquire knowledge from technical text. Other hallmarks include an absence of precoded domain-specific knowledge; significant use of public-domain generic linguistic information sources; involvement of the user as a judge and source of expertise; and learning from the meaning representations produced during processing. These elements shape the realization of the TANKA project: implementing a trainable text processing system to propose correct semantic interpretations to the user. A three-level model of sentence semantics, including a comprehensive Case system, provides the framework for TANKA's representations. Text is first processed by the DIPETT parser, which can handle a wide variety of unedited sentences. The semantic analysis module HAIKU then semi-automatically extracts semantic patterns from the parse trees and composes them into domain knowledge representations. HAIKU's dictionaries and main algorithm are described with the aid of examples and traces of user interaction. Encouraging experimental results are described and evaluated.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00263.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 53
    Electronic Resource
    Electronic Resource
    SOLVING NINE MEN'S MORRIS (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The game of Nine Men's Morris is a draw. We obtained this result using a combination of endgame databases (1010 states) and search. Our improved algorithm for computing endgame databases allowed the game to be solved on a personal computer. Other games have been solved using knowledge-based methods to dramatically prune the search tree. Nine Men's Morris does not seem to profit from such methods, making it the first nontrivial game solved in which almost the entire state space has to be considered.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00251.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 54
    Electronic Resource
    Electronic Resource
    PLANNING TO FIND THE REFERENTS OF NOUN PHRASES (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Finding the referent of a definite noun phrase is a classic problem in natural language processing. Most work assumes that when a program begins to analyze an utterance, it already has the knowledge it needs for identifying referents. If a robot accepts commands in natural language, this assumption may not hold. Suppose a user says, “Go get the book on the table in room 3,” but the robot has never been in room 3, so it lacks the knowledge it needs to identify the referent of “the book on the table in room 3.” To gain this knowledge, the robot must travel to room 3 and search. This article describes a simulated robot that accepts commands in English and actively searches for the referents of definite descriptions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00051.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 55
    Electronic Resource
    Electronic Resource
    ON THE CONSTRUCTION OF A PROLOG-BASED VERIFIER FOR SYSTOLIC ARRAY DESIGNS (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this paper, we present VSTA, our Prolog-based verifier, for formal specification and verification of systolic architectures. VSTA allows users to design systolic array architectures in the STA specification language (STA was developed earlier by Ling for formal description and reasoning of systolic designs) and semi-automatically verifies these designs The implementation of VSTA is based on a standard Prolog system. Its interface uses Motif system calls based on the X11 and UNIX environments. VSTA provides facilities to assist the user in the design of systolic array specifications. The system allows a formal proof to be derived interactively with suggestions from the user. The proof techniques used are mathematical induction and rewriting. The induction technique is adopted to exploit the regularity and locality nature of systolic array architectures. A number of verification tactics are developed and their operational rules are used in the verifier. Using the powerful symbolic computation ability of Prolog, particularly pattern matching, automatic backtracking, and depth-first searching, the verifier performs efficiently in the construction of proofs. We also describe the strategies we used in proving a matrix multiplication systolic array and an LU decomposition systolic array.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00027.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 56
    Electronic Resource
    Electronic Resource
    SIMPSON'S PARADOX IN ARTIFICIAL INTELLIGENCE AND IN REAL LIFE (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: “Simpson's paradox,” first described nearly a century ago, is an anomaly that sometimes arises from pooling data. Dramatic instances of the paradox have occurred in real life in the domains of epidemiology and admissions policies. Many writers have recently described hypothetical examples of the paradox arising in other areas of life and it seems possible that the paradox may occur frequently in mundane domains but with less serious implications. Thus, it is not surprising that the paradox should arise in commonsense reasoning, that subarea of artificial intelligence that seeks to axiomatize reasoning in such mundane domains. It arises as the problem “approximate proof by cases” and the question of whether to accept it may well depend on whether we wish to construct performance or competence models of reasoning. This article gives a brief history of the paradox and discusses its occurrence in our own discipline. It argues that if the paradox occurs frequently but undramatically in real life, every uncertain reasoning system will have to deal with the problem in some way.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00021.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 57
    Electronic Resource
    Electronic Resource
    AN EPISTEMIC LOGIC WITH QUANTIFICATION OVER NAMES (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Sentential theories of belief hold that propositions (the things that agents believe and know) are sentences of a representation language. To analyze quantification into the scope of attitudes, these theories require a naming map a function that maps objects to their names in the representation language. Epistemic logics based on sentential theories usually assume a single naming map, which is built into the logic. I argue that to describe everyday knowledge, the user of the logic must be able to define new naming maps for particular problems. Since the range of a naming map is usually an infinite set of names, defining a map requires quantification over names. This paper describes an epistemic logic with quantification over names, presents a theorem-proving algorithm based on translation to first-order logic, and proves soundness and completeness. The first version of the logic suffers from the problem of logical omniscience; a second version avoids this problem, and soundness and completeness are proved for this version also.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00045.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 58
    Electronic Resource
    Electronic Resource
    COMPLEXITY RESULTS FOR SAS+ PLANNING (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We have previously reported a number of tractable planning problems defined in the SAS+ formalism. This article complements these results by providing a complete map over the complexity of SAS+ planning under all combinations of the previously considered restrictions. We analyze the complexity of both finding a minimal plan and finding any plan. In contrast to other complexity surveys of planning, we study not only the complexity of the decision problems but also the complexity of the generation problems. We prove that the SAS+-PUS problem is the maximal tractable problem under the restrictions we have considered if we want to generate minimal plans. If we are satisfied with any plan, then we can generalize further to the SAS+-US problem, which we prove to be the maximal tractable problem in this case.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00052.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 59
    Electronic Resource
    Electronic Resource
    DESIGNING AND BUILDING A NEGOTIATING AUTOMATED AGENT (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Negotiations are very important in a multiagenl environment, particularly, in an environment where there are conflicts between the agents, and cooperation would be beneficial. We have developed a general structure for a Negotiating Automated Agent that consists of five modules: a Prime Minister, a Ministry of Defense, a Foreign Office, a Headquarters and Intelligence. These modules are implemented using a dynamic set of local agents belonging to the different modules. We used this structure to develop a Diplomacy player. Diplomat. Playing Diplomacy involves a certain amount of technical skills as in other board games, but the capacity to negotiate, explain, convince, promise, keep promises or break them, is an essential ingredient in good play. Diplomat was evaluated and consistently played better than human players.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00026.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 60
    Electronic Resource
    Electronic Resource
    VALIDATION OF FIRST-ORDER RULE-BASED SYSTEMS (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Knowledge base validation and knowledge base refinement aim to help the expert to improve an existing knowledge base. They deal with the final knowledge acquisition phase and rely on a quality measurement of an existing knowledge base. We present our approach to knowledge base refinement, which is based on results in the domain of knowledge base validation. Our approach is based on a general consistency definition of a knowledge base and on a study of causes of knowledge base inconsistency. Our approach relies significantly on a differentiation of sure and expert knowledge in the knowledge base. We have implemented a system that has two phases: one computational phase decides on the consistency of a knowledge base, and, if necessary, a second phase helps the expert to interactively update the knowledge base. We present some related work in the domain. We illustrate the use of our system with an example.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00275.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 61
    Electronic Resource
    Electronic Resource
    DOMAIN-INDEPENDENT TEMPORAL REASONING WITH RECURRING EVENTS (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Numerous examples of temporal reasoning involve a process of abstraction from the number of times an event is to occur or the number of times events stand in a temporal relation. For example, scheduling a recurring event such as one's office hours may consider things like the relative temporal ordering of the office hours and a number of other events in a given work day. The number of times office hours will actually be held may be unknown, even irrelevant, at the time of scheduling them. The objective of this article is to formulate a domain-independent framework for reasoning about recurring events and their relations. To achieve this end, we propose an ontology of recurrence based on the model-theoretic structure underlying collective predication using plural noun phrases. We offer a calculus of binary temporal relations for temporal collections based on a well-defined transformation of interval temporal relations into recurrence relations. Finally, we describe a reasoning framework based on manipulating knowledge stored in temporal relation networks, which is in turn a specialization of the CSP (constraint satisfaction problem) framework. The reasoner manipulates recurrence relations in the network to determine the network's consistency or to generate scenarios.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00271.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 62
    Electronic Resource
    Electronic Resource
    LOCALIZED TEMPORAL REASONING USING SUBGOALS AND ABSTRACT EVENTS (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We are concerned with temporal reasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence consistent with a given set of ordering constraints to achieve a goal. Previous research shows that the associated decision problems are hard even for very restricted cases. In this article, we investigate locality in event ordering and causal dependencies. We present a localized temporal reasoning algorithm that uses subgoals and abstract events to exploit locality. The computational efficiency of our algorithm for a problem instance is quantified by the inherent locality in the instance. We theoretically demonstrate the substantial improvement in performance gained by exploiting locality. This work provides solid evidence of the usefulness of localized reasoning in exploiting locality.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00270.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 63
    Electronic Resource
    Electronic Resource
    INTRACTABILITY IN THE ALLEN AND KOOMEN PLANNER (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The Allen and Koomen planner is intractable in two ways: the Allen interval algebra is an intractable temporal reasoner, and the collapsing problem introduces a large branching factor in the search space for a solution plan. We define independence and dependence for networks to address both problems. Independence is used to find a decomposition of an interval network, and dependence is used to focus search when faced with the collapsing problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00049.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 64
    Electronic Resource
    Electronic Resource
    ON COMPUTING THE MINIMAL LABELS IN TIME POINT ALGEBRA NETWORKS (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We analyze the problem of computing the minimal labels for a network of temporal relations in point algebra. Van Beek proposes an algorithm for accomplishing this task, which takes O(max(n3, n2 m)) time (for n points and m ≠-relations). We show that the proof of the correctness of this algorithm given by van Beek and Cohen is faulty, and we provide a new proof showing that the algorithm is indeed correct.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00043.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 65
    Electronic Resource
    Electronic Resource
    ROUGH SET REDUCTION OF ATTRIBUTES AND THEIR DOMAINS FOR NEURAL NETWORKS (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper presents an empirical study of the use of the rough set approach to reduction of data for a neural network classifying objects described by quantitative and qualitative attributes. Two kinds of reduction are considered: reduction of the set of attributes and reduction of the domains of attributes. Computational tests were performed with five data sets having different character, for original and two reduced representations of data. The learning time acceleration due to data reduction is up to 4.72 times. The resulting increase of misclassification error does not exceed 11.06%. These promising results let us claim that the rough set approach is a useful tool for preprocessing of data for neural networks.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00036.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 66
    Electronic Resource
    Electronic Resource
    A LOGIC OF ARGUMENTATION FOR REASONING UNDER UNCERTAINTY (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: We present the syntax and proof theory of a logic of argumentation, LA. We also outline the development of a category theoretic semantics for LA. LA is the core of a proof theoretic model for reasoning under uncertainty. In this logic, propositions are labeled with a representation of the arguments which support their validity. Arguments may then be aggregated to collect more information about the potential validity of the propositions of interest. We make the notion of aggregation primitive to the logic, and then define strength mappings from sets of arguments to one of a number of possible dictionaries. This provides a uniform framework which incorporates a number of numerical and symbolic techniques for assigning subjective confidences to propositions on the basis of their supporting arguments. These aggregation techniques are also described with examples.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00025.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 67
    Electronic Resource
    Electronic Resource
    ON TEMPORAL DEDUCTIVE DATABASES (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This article introduces a temporal deductive database system featuring a logic programming language and an algebraic front-end. The language, called Temporal DATALOG, is an extension of DATALOG based on a linear-time temporal logic in which the flow of time is modeled by the set of natural numbers. Programs of Temporal DATALOG are considered as temporal deductive databases, specifying temporal relationships among data and providing base relations to the algebraic front-end. The minimum model of a given Temporal DATALOG program is regarded as the temporal database the program models intensionally. The algebraic front-end, called TRA, is a point-wise extension of the relational algebra upon the set of natural numbers. When needed during the evaluation of TRA expressions, slices of temporal relations over intervals can be retrieved from a given temporal deductive database by bottom-up evaluation strategies.A modular extension of Temporal DATALOG is also proposed, through which temporal relations created during the evaluation of TRA expressions may be fed back to the deductive part for further manipulation. Modules therefore enable the algebra to have full access to the deductive capabilities of Temporal DATALOG and to extend it with nonstandard algebraic operators. This article also shows that the temporal operators of TRA can be simulated in Temporal DATALOG by program clauses.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00261.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 68
    Electronic Resource
    Electronic Resource
    GO-MOKU SOLVED BY NEW SEARCH TECHNIQUES (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Many decades ago, Japanese professional Go-Moku players stated that Go-Moku (five-in-a-row on a horizontally placed 15×15 board) is a won game for the player to move first. So far, this claim has never been substantiated by (a tree of) variations or by a computer program. Meanwhile, many variants of Go-Moku with slightly different rules have been developed. This paper shows that for two common variants, the game-theoretical value has been established.Moreover, the Go-Moku program Victoria is described. It uses two new search techniques: threat-space search and proof-number search. One of the results is that Victoria is bound to win against any (optimal) counterplay if it moves first. Furthermore, it achieves good results as a defender against nonoptimally playing opponents. In this contribution we focus on threat-space search and its advantages compared to conventional search algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00250.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 69
    Electronic Resource
    Electronic Resource
    A PLANNING APPROACH TO DECLARER PLAY IN CONTRACT BRIDGE (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Although game-tree search works well in perfect-information games, it is less suitable for imperfect-information games such as contract bridge. The lack of knowledge about the opponents’ possible moves gives the game tree a very large branching factor, making it impossible to search a significant portion of this tree in a reasonable amount of time.This paper describes our approach for overcoming this problem. We represent information about bridge in a task network extended to represent multi-agency and uncertainty. Our game-playing procedure uses this task network to generate game trees in which the set of alternative choices is determined not by the set of possible actions, but by the set of available tactical and strategic schemes.We have tested this approach on declarer play in the game of bridge, in an implementation called Tignum 2. On 5000 randomly generated notrump deals, Tignum 2 beat the strongest commercially available program by 1394 to 1302, with 2304 ties. These results are statistically significant at the α= 0.05 level. Tignum 2 searched an average of only 8745.6 moves per deal in an average time of only 27.5 seconds per deal on a Sun SPARCstation 10. Further enhancements to Tignum 2 are currently underway.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00255.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 70
    Electronic Resource
    Electronic Resource
    EVENT TRACKING IN A DYNAMIC MULTIAGENT ENVIRONMENT (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In a dynamic, multiagent environment, an automated intelligent agent is often faced with the possibility that other agents may instigate events that hinder or help the achievement of its own goals. To act intelligently in such an environment, an automated agent needs an event tracking capability to continually monitor the occurrence of such events and the temporal relationships among them. This capability enables an agent to infer the occurrence of important unobserved events as well as to obtain a better understanding of the interaction among events. This article focuses on event tracking in one complex and dynamic multiagent environment: the air-combat simulation environment. It analyzes the challenges that an automated pilot agent must face when tracking events in this environment. This analysis reveals three new issues that have not been addressed in previous work in this area: (i) tracking events generated by agents’ flexible and reactive behaviors, (ii) tracking events in the context of continuous agent interactions, and (iii) tracking events in real time. This article proposes one solution to address these issues. One key idea in this solution is that the (architectural) mechanisms that an agent employs in generating its own flexible and reactive behaviors can be used to track other agents’ flexible and reactive behaviors in real time. A second key idea is the use of a world-centered representation for modeling agent interactions. The solution is demonstrated using an implementation of an automated pilot agent.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00273.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 71
    Electronic Resource
    Electronic Resource
    INTELLIGENT BEHAVIOR IN MACHINES EMERGING FROM A COLLECTION OF INTERACTIVE CONTROL STRUCTURES (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Control strategies that decompose the competence of an agent into independent, task-achieving control structures are emerging as viable alternatives to the notion that a robot is an explicit symbol processing device with input and output extensions in the form of sensors and actuators. This approach draws inspiration from ethology and the cognitive sciences, where the competence of biological creatures is seen to be a result of the successful combination of several distinct behavior patterns that enable them to interact effectively with their environments.The distinction between classical approaches that view intelligent behavior as the outcome of symbolic manipulations and an alternate approach that asserts that it is the careful integration of distributed, goal-competent control structures that lead to intelligent behavior is analyzed in detail. It is found that this dichotomy can be said to arise from the paradigm that is chosen to represent the knowledge at the disposal of the agent. Structurally encoded knowledge requiring an active interpreter for the knowledge to be exhibited in action leads to the symbol processing paradigm for intelligent behavior, whereas the interactive model for knowledge representation assumes that the knowledge at the disposal of an active agent resides within goal-competent, interactive control structures.A formalism is developed for representing the goal-directed nature of these interactive control structures with clear control-module boundaries. An implementation is then presented to demonstrate some of the basic features of this methodology.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00050.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 72
    Electronic Resource
    Electronic Resource
    TIME, ACTION-TYPES, AND CAUSATION: AN INTEGRATED ANALYSIS (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this paper we focus on the temporal constraints between causes and effects of causal relations, and, to deal correctly with such relations, we stress the importance of analyzing the action-types (aspectual category) of causes and effects. In particular, we propose a domain-independent ontology in which the distinctions between action-types (e.g., the distinction between durative and punctual situations) are dealt with, and different types of causal relations are distinguished, on the basis of (i) the temporal constraints they impose between causes and effects (these constraints are expressed in a temporal formalism that extends Vilain's point interval algebra) and (ii) the action-types of their causes and effects. Our ontology allows one to capture precisely the temporal constraints imposed by causation and the action-types of the related situations. Moreover, in case the user has no accurate knowledge about the action-types of some situations and/or the types of some causal connections to be dealt with, our formalism allows the user to leave the descriptions underspecified, and more specific pieces of information may be inferred. Inferences provide a flow of information about action-types to information about temporal constraints in causation and vice versa, and demonstrate that a deep integration of time and causation is provided also at the inferential level.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00047.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 73
    Electronic Resource
    Electronic Resource
    THE USEFULNESS OF A MACHINE LEARNING APPROACH TO KNOWLEDGE ACQUISITION (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper presents results of experiments showing how machine learning methods arc useful for rule induction in the process of knowledge acquisition for expert systems. Four machine learning methods were used: ID3, ID3 with dropping conditions, and two options of the system LERS (Learning from Examples based on Rough Sets): LEM1 and LEM2. Two knowledge acquisition options of LERS were used as well. All six methods were used for rule induction from six real-life data sets. The main objective was to lest how an expert system, supplied with these rule sets, performs without information on a few attributes. Thus an expert system attempts to classify examples with all missing values of some attributes. As a result of experiments, it is clear that all machine learning methods performed much worse than knowledge acquisition options of LERS. Thus, machine learning methods used for knowledge acquisition should be replaced by other methods of rule induction that will generate complete sets of rules. Knowledge acquisition options of LERS are examples of such appropriate ways of inducing rules for building knowledge bases.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00032.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 74
    Electronic Resource
    Electronic Resource
    LEARNING IN RELATIONAL DATABASES: A ROUGH SET APPROACH (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Knowledge discovery in databases, or dala mining, is an important direction in the development of data and knowledge-based systems. Because of the huge amount of data stored in large numbers of existing databases, and because the amount of data generated in electronic forms is growing rapidly, it is necessary to develop efficient methods to extract knowledge from databases. An attribute-oriented rough set approach has been developed for knowledge discovery in databases. The method integrates machine-learning paradigm, especially learning-from-examples techniques, with rough set techniques. An attribute-oriented concept tree ascension technique is first applied in generalization, which substantially reduces the computational complexity of database learning processes. Then the cause-effect relationship among the attributes in the database is analyzed using rough set techniques, and the unimportant or irrelevant attributes are eliminated. Thus concise and strong rules with little or no redundant information can be learned efficiently. Our study shows that attribute-oriented induction combined with rough set theory provide an efficient and effective mechanism for knowledge discovery in database systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00035.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 75
    Electronic Resource
    Electronic Resource
    GENERAL GAME-PLAYING AND REINFORCEMENT LEARNING (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper provides a blueprint for the development of a fully domain-independent single-agent and multiagent heuristic search system. It gives a graph-theoretic representation of search problems based on conceptual graphs and outlines two different learning systems. One, an “informed learner”, makes use of the graph-theoretic definition of a search problem or game in playing and adapting to a game in the given environment. The other, a “blind learner”, is not given access to the rules of a domain but must discover and then exploit the underlying mathematical structure of a given domain. Relevant work of others is referenced within the context of the blueprint.To illustrate further how one might go about creating general game-playing agents, we show how we can generalize the understanding obtained with the Morph chess system to all games involving the interactions of abstract mathematical relations. A monitor for such domains has been developed, along with an implementation of a blind and informed learning system known as Morphll. Performance results with MorphK are preliminary but encouraging and provide a few more data points with which to understand and evaluate the blueprint.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00257.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 76
    Electronic Resource
    Electronic Resource
    PERFECT RECALL AND PRUNING IN GAMES WITH IMPERFECT INFORMATION (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Games with imperfect information are an interesting and important class of games. They include most card games (e.g., bridge and poker) as well as many economic and political models. Here we investigate algorithms for findi ng the simplest form of a solution (a pure-strategy equilibrium point) to imperfect information games expressed in their extensive (game tree) form. We introduce to the artificial intelligence community a classic algorithm, due to Wilson, that solves one-player games with perfect recall. Wilson's algorithm, which we call iMP-minimax, runs in time linear in the size of the game-tree searched. In contrast to Wilson's result, Koller and Meggido have shown that finding a pure-strategy equilibrium point in one-player games without perfect recall is NP-hard. Here, we provide another contrast to Wilson's result–we show that in games with perfect recall but more than one player, finding a pure-strategy equilibrium point, given that such an equilibrium point exists, is NP-hard.Our second contribution is to present a pruning technique for Wilson's IMP-minimax algorithm to make the latter more tractable. We call this new algorithm IMP-alpha-beta. We provide a theoretical framework (model) and analyze IMP-alpha-beta in that model. IMP-alpha-beta is of direct value for one-player, perfect-recall games. It also has strong potential for other imperfect information games, as it is a natural (but as yet untested) heuristic in those cases.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00256.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 77
    Electronic Resource
    Electronic Resource
    A STRATEGIC METAGAME PLAYER FOR GENERAL CHESS-LIKE GAMES (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 12 (1996), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper introduces METAGAMER, the first program designed within the paradigm of Metagame-playing (Metagame). This program plays games in the class of symmetric chess-like games, which includes chess, Chinese chess, checkers, draughts, and Shogi. METAGAMER takes as input the rules of a specific game and analyzes those rules to construct an efficient representation and an evaluation function for that game; they are used by a generic search engine. The strategic analysis performed by METAGAMER relates a set of general knowledge sources to the details of the particular game. Among other properties, this analysis determines the relative value of the different pieces in a given game. Although METAGAMER does not learn from experience, the values resulting from its analysis are qualitatively similar to values used by experts on known games and are sufficient to produce competitive performance the first time METAGAMER plays a new game. Besides being the first Metagame-playing program, this is the first program to have derived useful piece values directly from analysis of the rules of different games. This paper describes the knowledge implemented in METAGAMER, illustrates the piece values METAGAMER derives for chess and checkers, and discusses experiments with METAGAMER on both existing and newly generated games.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1996.tb00258.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 78
    Electronic Resource
    Electronic Resource
    NOTE OF APPRECIATION FROM THE EDITORS (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00048.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 79
    Electronic Resource
    Electronic Resource
    A NEW METHOD FOR INFLUENCE DIAGRAM EVALUATION (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: As influence diagrams become a popular representational tool for decision analysis, influence diagram evaluation attracts more and more research interests. In this article, we present a new, two-phase method for influence diagram evaluation. In our method, an influence diagram is first mapped onto a decision graph and then the analysis is carried out by evaluating the decision graph. Our method is more efficient than Howard and Matheson's because, among other reasons, our method generates a much smaller decision graph for the same influence diagram. Like those most recent algorithms reported in the literature, our method also provides a clean interface between influence diagram evaluation and Bayesian net evaluation. Consequently, various well-established algorithms for Bayesian net evaluation can be used in influence diagram evaluation. Furthermore, our method has a few unique merits. First, it takes advantage of asymmetry in influence diagrams to avoid unnecessary computation. Second, by using heuristic search techniques, it provides an explicit mechanism for using heuristic information that may be available in a domain-specific form. These additional merits make our method more efficient than the current algorithms in general. Finally, by using decision graphs as an intermediate representation, the value of perfect information can be computed in a more efficient way.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00046.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 80
    Electronic Resource
    Electronic Resource
    INTRODUCTION TO THE SPECIAL ISSUE ON ROUGH SETS AND KNOWLEDGE DISCOVERY (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00028.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 81
    Electronic Resource
    Electronic Resource
    EXTENSION OF THE RELATIONAL DATABASE AND ITS ALGEBRA WITH ROUGH SET TECHNIQUES (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper describes a database model based on the original rough sets theory. Its rough relations permit the representation of a rough set of tuples not definable in terms of the elementary classes, except through use of lower and upper approximations. The rough relational database model also incorporates indiscernibility in the representation and in all the operators of the rough relational algebra. This indiscernibility is based strictly on equivalence classes which must be defined for every attribute domain.There are several obvious applications for which the rough relational database model can more accurately model an enterprise than does the standard relational model. These include systems involving ambiguous, imprecise, or uncertain data. Retrieval over mismatched domains caused by the merging of one or more applications can be facilitated by the use of indiscernibility, and naive system users can achieve greater recall with the rough relational database. In addition, applications inherently “rough” could be more easily implemented and maintained in the rough relational database.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00030.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 82
    Electronic Resource
    Electronic Resource
    HANDLING INFORMATION LOGICS IN A GRAPHICAL PROOF EDITOR (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 11 (1995), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In order to provide a background for rough set modeling of uncertainty, two types of incompleteness of information are discussed. Representation of uncertain knowledge acquired from incomplete information is outlined within the framework of information logics. Relational proof theory for the information logics is presented. It is shown how these logics and their proof systems can be handled in the GLEFATINF (Graphical & Logical Editing Framework) system. This computer program is a key component of the inference laboratory Atelier d'Inféence (ATINF) developed at LIFIA-IMAG, our lab. It provides a general framework, independent of logic and proof systems, for combining inference tools, editing, and checking proofs. The basic principles of its design and implementation are given and its capabilities are discussed. Its application to define the information logics and their proof systems and to present proofs in these proof systems is discussed and illustrated.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1995.tb00034.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 83
    Electronic Resource
    Electronic Resource
    A comparison of knowledge elicitation methods (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: This paper describes a computer based approach to comparing data obtained for Knowledge Based Systems via established but very varied knowledge elicitation (KE) techniques. It describes not only the detailed comparison of different KE methods (in this case ‘scaling’ and ‘non-scaling’) but also investigates the use of ‘demonstration’ or ‘evaluation’ systems, as a variation on the more established rapid prototyping approaches to the elicitation and evaluation of knowledge for KBS construction, in this case by focusing upon the quality and relevance of the elicited knowledge from the perspective of the expert himself. Preliminary results from the study reported here suggest that non-scaling methods produce a greater amount of raw data than scaling methods, and that this data is less likely to require correction or modification for inclusion within a Knowledge Based System. However, the results also indicate that non-scaling derived data is more likely than scaling derived data data to be rejected outright.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00125.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 84
    Electronic Resource
    Electronic Resource
    An interactive fault diagnosis expert system for a helpdesk application (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: This paper presents work on an interactive fault diagnosis expert system for a helpdesk application. A knowledge representation and inference algorithm is proposed to satisfy three design specifications: (1) no parallel event exists in human fault reporting; (2) the diagnostic sequence is unpredictable, and (3) the inference engine is passive in an event-driven environment. A lattice data structure is designed for knowledge representation, which is generated automatically from a script of decision rules. The inference engine works in a transaction-like style by prompting and responding to the user according to the knowledge in the lattice. It can explicitly guide the inference sequence, as well as respond to ad hoc input from the user.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00120.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 85
    Electronic Resource
    Electronic Resource
    A constructive design method for two-layer perceptrons and its applicatio to the design of modular neural networks (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: A multilayer perceptron is known to be capable of approximating any smooth function to any desired accuracy if it has a sufficient number of hidden neurons. But its training, based on the gradient method, is usually a time consuming procedure that may converge toward a local minimum, and furthermore its performance is greatly influenced by the number of hidden neurons and their initial weights. Usually these crucial parameters are determined based on the trial and error procedure, requiring much experience on the designer's part.In this paper, a constructive design method (CDM) has been proposed for a two-layer perceptron that can approximate a class of smooth functions whose feature vector classes are linearly separable. Based on the analysis of a given data set sampled from the target function, feature vectors that can characterize the function‘well’are extracted and used to determine the number of hidden neurons and the initial weights of the network. But when the classes of the feature vectors are not linearly separable, the network may not be trained easily, mainly due to the interference among the hyperplanes generated by hidden neurons. Next, to compensate for this interference, a refined version of the modular neural network (MNN) has been proposed where each network module is created by CDM. After the input space has been partitioned into many local regions, a two-layer perceptron constructed by CDM is assigned to each local region. By doing this, the feature vector classes are more likely to become linearly separable in each local region and as a result, the function may be approximated with greatly improved accuracy by MNN. An example simulation illustrates the improvements in learning speed using a smaller number of neurons.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00118.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 86
    Electronic Resource
    Electronic Resource
    Importance of information pre-processing in the improvement of neural network results (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: This paper compares the success ratio of certain topologies when their input data are changed through different pre-processing methods. It begins with the database description, and it shows some different kinds of pre-processing that will be applied and the necessary modifications to the input layer of the network. The process is carried out using four networks with supervised learning (Standard Backpropagation, Quick propagation, Resilient Propagation and Backpropagation with Momentum) and two with unsupervised learning (ART 1 and Dynamic Learning Vector Quantization).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00182.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 87
    Electronic Resource
    Electronic Resource
    Laddering (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: There is still a need for new knowledge elicitation techniques and tools. Laddering is a technique which has a long history in a wide range of disciplines and which has proved extremely useful in knowledge elicitation. There have, however, been few attempts to describe and survey the technique per se. This paper describes the technique, its background, its use, analysis, and automation, with particular reference to knowledge elicitation. The advantages and disadvantages of the technique are described. It is concluded that laddering is a valuable technique which could be used in a wide range of settings.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00271.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 88
    Electronic Resource
    Electronic Resource
    News (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00276.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 89
    Electronic Resource
    Electronic Resource
    Toward an intelligent architectural design aid (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Architectural design is a complex task which requires expert knowledge, a great deal of experience and no small amount of creativity and artistic flair. However, while humans are very good at creativity, intuition, artistry and evaluation, they are notoriously bad at routine mundane tasks. Searching through large databases of past designs can be such a task. This can result in useful design knowledge being ignored. In this paper we present a way to aid architects in their work by providing a software tool aimed at recording, retrieving and evaluating architectural designs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00110.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 90
    Electronic Resource
    Electronic Resource
    A generalised fuzzy reasoning algorithm for an object-oriented expert system tool (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: A fuzzy reasoning algorithm is presented in this paper. It is based on the concept of a generalised fuzzy production rule that adds new conjunctions such as ADD and REL to the usual AND and OR conjunctions for the linkage of premises in conventional rules. A definition is given for weights and related factors, to express and measure a relation between the premises. A formal representation for fuzzy premises is presented, together with the introduction of a fuzzy match method. Multiple thresholds are used to convert the uncertainty measures of reasoning results into linguistic variables. We have applied the fuzzy reasoning algorithm to a frame-based hybrid expert system tool. An object-oriented approach is used in implementing the system. Some results of the application are presented and discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00109.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 91
    Electronic Resource
    Electronic Resource
    DTI begins the wind-down (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00115.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 92
    Electronic Resource
    Electronic Resource
    Prolog/Rex inference engine (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Prolog/Rex supports the construction of knowledge-based systems, allowing frames (Prolog/Rex concepts) and rules to be combined, and providing language level support for hypothetical reasoning and assumption-based truth maintenance (Prolog/Rex viewpoint mechanism). To increase run-time performance during rule execution, Prolog/Rex provides two complementary rule compilation techniques: the simple indexing scheme and the heavily modified Rete expansion method. To improve the efficiency of the inference engine, we built an agenda-based rule manager that uses priority mechanism and/or heuristics embedded in meta-rules to control the rule firing order. Forward- and backward-chaining can be combined within the same program.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00113.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 93
    Electronic Resource
    Electronic Resource
    Speech recognition (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00060.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 94
    Electronic Resource
    Electronic Resource
    Applications (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00029.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 95
    Electronic Resource
    Electronic Resource
    Japanese work in expert systems (1984)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 1 (1984), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Activities concerning expert systems in Japan are outlined. Expert systems are receiving increasing attention in Japan, together with fifth-generation computers. Rather than describing the details of individual systems, a variety of expert systems are briefly introduced with their aims and features.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1984.tb00425.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 96
    Electronic Resource
    Electronic Resource
    Object-oriented technology (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00055.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 97
    Electronic Resource
    Electronic Resource
    Process factors in knowledge acquisition (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Knowledge acquisition (KA) is often characterised as a crucial bottleneck in the development of expert system applications. General definitions of KA view it as a collection of subprocesses such as elicitation, analysis and representation, but in actual practice, each KA occurrence may involve one or all of these subprocesses in varying sequences and combinations. No model or framework currently exists for describing the many possible variations in KA processes as they actually occur. This article presents a new way of characterising knowledge acquisition processes that is not tied to one particular technique or approach to KA. Three nested levels are proposed to characterise the many possible variations and combinations of KA dynamics: the process, episode and transaction levels of analysis. Each of these is further delineated in a top-down manner. Not only does this scheme provide a fairly comprehensive means for viewing KA dynamics as a whole, but it suggests several factors that have heretofore drawn little research attention. The suggested constructs capture more accurately what actually occurs in the practice of KA. In so doing they also provide the foundation for structuring future research into how KA processes may unfold.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00283.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 98
    Electronic Resource
    Electronic Resource
    An expert system approach to fault diagnosis in hydraulic systems (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Increased interest in problem-solving decisions in the area of engineering leads to an increased demand for expert system applications. This paper presents an expert system that detects faults in hydraulic systems by simulating the reasoning of the expert, using as guide the hydraulic circuit of the system on the screen and extensive graphical information. A graphical user interface, appropriate explanations by using hypertext and user modelling have been implemented in order to produce a system that overcomes the usual interface problems of expert systems in engineering. This system has been developed in close collaboration with the company Automation Systems SA (Mannesmann Rexroth — Greece) and is currently used to detect faults in hydraulic presses, a fact that presents evidence of its usefulness.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00269.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 99
    Electronic Resource
    Electronic Resource
    An expert system for unit commitment and power demand prediction using fuzzy logic and neural networks (1996)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 13 (1996), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: The paper discusses the implementation of a fuzzy logic and artificial neural networks approach to providing a structural framework for the representation, manipulation and utilisation of data and information concerning prediction of power demand and generation commitments. An algorithm has been implemented and trained to predict the power demand at each load point on an hourly basis. The neural network is then implemented to supply the brute force necessary to accommodate the large amount of sensory data to provide the initial evaluation of the generation units to be committed. Results of the fuzzy model show a reasonable correspondence with the actual power demand. A standard deviation error for an hourly based prediction is limited to 4.4. Further refinement of the fuzzy model may produce further improvements. Implementation of artificial neural networks for scheduling an hourly unit commitment based on load demands is also discussed The backpropagation technique based on the I/O mapping method has been chosen for structuring the neural network. Geographically related load points and generating units are clustered into groups. Grouping has significantly reduced the number of inputs and outputs to the neural network and, hence, reduced the system complexity. As a result, both training requirements and running real time interaction are significantly improved. The expert system would replace and utilise the requirement for skilled dispatchers in scheduling the generators. It is anticipated that this facility is more accurate, dynamic, adaptive and more efficient than a skilled dispatcher. The overall cost of power generation is expected to be less if the new facility is used. Initial results have reflected a satisfactory correlation between predicted and actual results, with a standard deviation error of 1.71% and 1.96% in the base load units of HTPS and ATPS respectively.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1996.tb00281.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 100
    Electronic Resource
    Electronic Resource
    The design and implementation of an intelligent query tool for relational databases (1995)
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 12 (1995), S. 0 
    Details
    ISSN: 1468-0394
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: Abstract: Retrieving ad hoc data from information systems is difficult for non-expert users. Despite the efforts made in improving query tools (e.g. visual query construction, Query By Example, query templates), empirical research shows that constructing a request is still difficult (Reisner 1988). The core of the problem seems to be in the difference between the way the user perceives the application domain and the way the system requires the user to see it (Carroll & Olsen 1988). In this paper we describe the design and implementation of an ad hoc query tool developed by RCC for a personnel information system, and how AI techniques contributed to this module. The main novel idea incorporated in the query tool is to present the user with a means to question the conceptual model of the system instead of the technical model. To support this, a blackboard architecture has been designed and implemented with knowledge sources that translate the user's questions to database queries. The query tool is used in daily practice by over 100 users.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1468-0394.1995.tb00272.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...