By Topic

[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence

6-9 Nov. 1990

Filter Results

Displaying Results 1 - 25 of 123
  • Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence (Cat. No.90CH2915-7)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • The state-of-art AI research in Japan

    Publication Year: 1990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (55 KB)

    Summary form only given. The state-of-the-art of artificial intelligence (AI) in Japan is reviewed, and attention given to the current results of the fifth-generation project. The technical aspects of AI research are examined, and the computational power of the fifth-generation computer system compared to that of the current workstation in the use of various AI frameworks. The Japanese rationale f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of a meta-blackboard shell

    Publication Year: 1990, Page(s):544 - 550
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    The architecture of a meta-blackboard shell is described, which can be specialized as specific blackboard shells to fit specific domains. The knowledge source structure of the shell is designed as a miniature blackboard architecture to increase the local inference capability through the generalization of knowledge representation. The control component is designed as a restricted blackboard archite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool for building decision-support-oriented expert systems

    Publication Year: 1990, Page(s):537 - 543
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    The expert system (ES) tool DECISION-T was built to test the authors' ideas on what characteristics an ES should have and how to reflect them consistently within a system. Concepts such as decision-support-oriented expert systems (DSO-ESs), the interrupt inference process, global-blackboard-based distributed problem solving, knowledge-based modeling, and data extraction are introduced. Multiple kn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cooperation and communication framework for distributed problem solving

    Publication Year: 1990, Page(s):530 - 536
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    A novel cooperative computation model, Cellula, is proposed, with particular attention given to group organisation and inter-/intragroup communication. This model is designed on two principles. First, it has a facility for abstraction of group behaviors, which makes it possible to cope with recursive problem decomposition. Second, it has a facility (based on blackboard communication) for inter-/in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiences made using the expert system shell G2

    Publication Year: 1990, Page(s):520 - 529
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The author describes experience with using the expert system shell G2 for a safety assessment and post-trip guidance system (SAS-II) intended for the control room of the Forsmark unit 2 nuclear power plant in Sweden. The experience is believed to be general enough to be relevant in a general discussion about expert system technology. In particular, real-time aspects and matters concerning data typ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Grid Match: a basis for integrating production systems with relational databases

    Publication Year: 1990, Page(s):400 - 407
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    GridMatch, an efficient algorithm for evaluating left hand side bindings in a secondary memory environment, is described. Matching is incremental and the algorithm is state saving. Since the working-memory database and matching state are too large to fit in the main memory, careful implementation becomes crucial. GridMatch uses partitioned storage to reduce matching time. The time and space comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of a parallel logic programming system

    Publication Year: 1990, Page(s):511 - 518
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    A parallel logic programming system which includes a precompiler, a compiler, and an execution system is presented. An annotated parallel language which is a parallel extension of Prolog is introduced. The techniques used in the precompile phase, such as abstract interpretation and the CAAP (compiling approach for exploiting AND-parallelism) scheme, are described. An optimized compiler, the RAP/LO... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of DBMS implementations of production systems

    Publication Year: 1990, Page(s):393 - 399
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The performance of various methods for the implementation of large production rule bases is studied. The authors first give a brief overview of the basic techniques, and then present some optimization alternatives for one of them. The results obtained indicate that both the Rete network method and the one based on COND relations are feasible in a relational database system environment. One major a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A high level compiling implementation of PARLOG based on extended graph rewriting

    Publication Year: 1990, Page(s):507 - 510
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    An extended graph rewriting computational model is proposed which can implement logic variables, nondeterminism, OR-parallelism, and guard calls of PARLOG very efficiently. It is pointed out that the methods for implementing PARLOG based on this model are better than those in other related research works View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A forward-chaining multiple-context reasoner and its application to logic design

    Publication Year: 1990, Page(s):386 - 392
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The authors present an extended production system architecture which can deal with forward reasoning in multiple contexts. The proposed architecture consists of a compiler of clauses and defaults into a Rete-like network, a Rete-based inference engine, and an assumption-based truth maintenance system (ATMS). The inference engine gives intermediate justifications to the ATMS and stores intermediate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using MICE to study intelligent dynamic coordination

    Publication Year: 1990, Page(s):438 - 444
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    To improve the exchange of ideas, formalisms, and techniques among distributed artificial intelligence researchers, the authors have developed MICE as a standard and flexible testbed for experimentation. MICE allows an experimenter to specify the constraints and characteristics of an environment in which agents are simulated to act and interact, and does not assume any particular implementation of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Configuration management in the HILDA system

    Publication Year: 1990, Page(s):154 - 160
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    HILDA (high level design assistance) is a prototype of a rule-based configurer that operates in a CAD (computer-aided design) framework. The configurer in HILDA adopts the approach of generalized templates for configuring design models, i.e. it typically requires only one generalized template for each CAD tool instead of one template per design model, as in most other systems. A generalized templa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TIMEX-a tool for interval-based representation in technical applications

    Publication Year: 1990, Page(s):501 - 506
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    TIMEX, a tool that extends Prolog with features for interval-based representation, is described. Because several ideas for interval-based representation exist, the tool provides the possibility of switching between different representation and propagation techniques. This is done by representing different interval graphs. Thus, one application may consist of several graphs with different attribute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint propagation neural networks for Huffman-Clowes scene labeling

    Publication Year: 1990, Page(s):262 - 268
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    The authors propose a three-layered constraint satisfaction neural network to perform Huffman-Clowes scene labeling. Given a line drawing the network establishes a consistent labeling for all the edges or detects that it is physically unrealizable. Experimental results show that this approach exploits the parallel architecture inherent in the network and is faster than the conventional algorithmic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scaffolding the RETE network

    Publication Year: 1990, Page(s):378 - 385
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Scaffolding is a novel method for improving conjunctive match efficiency that incorporates a TMS (truth maintenance system) into an RETE matcher, thereby exploiting match redundancy between separate runs. The resulting inactivations are reactivations of the data dependencies replace expensive RETE testing with simpler, less costly NETL-like propagations. Experimental results obtained by profiling ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RACK: a parser generator for AI languages

    Publication Year: 1990, Page(s):430 - 435
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    The RAND Compiler Kit (RACK), a parser generator for AI (artificial-intelligence) applications, is described. RACK parsers are unique in their ability to recognize non-LR(k) languages. RACK is implemented in C and is upwardly compatible with YACC. RACK generates parsers that interface with C or Lisp and includes features such as arbitrary look-ahead, multiple start symbols, a scanner gene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extended framework for evidential reasoning systems

    Publication Year: 1990, Page(s):731 - 737
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Based on the Dempster-Shafer (D-S) theory of evidence and G. Yen's (1989), extension of the theory, the authors propose approaches to representing heuristic knowledge by evidential mapping and pooling the mass distribution in a complex frame by partitioning that frame using Shafter's partition technique. The authors have generalized Yen's model from Bayesian probability theory to the D-S theory of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capturing design and maintenance decisions with MACS

    Publication Year: 1990, Page(s):146 - 153
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    MACS is a research and development project of the European ESPRIT II program, whose objective is the definition and implementation of a software maintenance assistance system. The basis premise of MACS is to do maintenance through understanding. MACS views the application from several perspectives in specific 'worlds'. One of them is the 'reasoning world', which captures by means of a simple forma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining partial evaluation and constraint solving: a new approach to constraint logic programming

    Publication Year: 1990, Page(s):494 - 500
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    It is argued that constraint logic programming (CLP) systems can be built `loosely' by separating a system into independent parts to avoid some repeated processing, and thus to increase further the efficiency of CLP systems. An architecture scheme is presented. Systems based on the architecture have desirable modularity. The system Conslog is described as an instance of the scheme. Conslog consist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning from examples and counterexamples with equational background knowledge

    Publication Year: 1990, Page(s):254 - 260
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    The author presents a method to check whether an implicit representation (i.e., a formula of the form t/{t1,. . .,tn}, where t is viewed as a generalization of a set of examples and t1,. . .,tn are counterexamples) is a generalization with respect to a finite set of equations which describes the background knowledge problem; that is, whether there exists a ground (variable-free)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal neural logic networks

    Publication Year: 1990, Page(s):372 - 376
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    Neural logic networks are generalized to cater to logical systems where the validity of rules and facts changes with time. To construct a temporal network, the validity of rules and facts is collected at a selection of time instances to determine the connecting weights of the respective instances. The weight of the temporal network is then defined as functions that would produce the known values w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach for representing and recognition of two-dimensional objects

    Publication Year: 1990, Page(s):564 - 570
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    A novel approach for examining shapes as shells in a parametrical space is described. The parametrical space is defined in terms of shell radius and sets of angular extensions. The representation reflects the global and local characteristics of shape. The template shells are compared to the given clusters of shells which are extracted from known models. The comparison is performed simply by calcul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool system for knowledge-based on-line diagnosis in industrial automation

    Publication Year: 1990, Page(s):424 - 429
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    A tool system which supports the development of expert systems for use in the field of industrial automation is presented. The knowledge representation language provided by the tool system supports different aspects of knowledge which are important in this domain: the representation of declarative and procedural knowledge; the representation of temporal knowledge; and the representation of knowled... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An associative memory knowledge base for diagnostic and high level control functions

    Publication Year: 1990, Page(s):283 - 288
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    The authors present a novel associative memory (AM) knowledge base for real-time diagnostics and high level control functions for complex large-scale dynamic systems. The architecture is an adaptive architecture based on the sparse distributed memory (ASDM). The authors also introduce the concept of time-varying intensity of memory, and allow generalized metrics for determining distance between tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.