By Topic

Tools with Artificial Intelligence, 1992. TAI '92, Proceedings., Fourth International Conference on

Date 10-13 Nov. 1992

Filter Results

Displaying Results 1 - 25 of 72
  • Proceedings. Fourth International Conference on Tools with Artificial Intelligence, TAI '92 (Cat. No. 92CH3203-7)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • New transitive closure algorithm for recursive query processing in deductive databases

    Publication Year: 1992, Page(s):268 - 275
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    An algorithm suitable for the full transitive closure problem, which is used to solve uninstantiated recursive queries in deductive databases, is presented. In this algorithm there are two phases. In the first phase a general graph is condensed into an acyclic graph and at the same time a special sparse matrix is formed from the acyclic graph. The second phase is the main one, where all of the pag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dependency-based concurrency control in logic-oriented object bases

    Publication Year: 1992, Page(s):260 - 267
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    A policy for scheduling concurrent transactions in which the preconditions and effects associated with the transactions can be specified is described. Also proposed is a recovery procedure for when transaction failures are detected. The advantages of the scheduling algorithm can be summarized as follows: for conventional transaction models, it is less constrained than the two-phased protocol, part... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving a knowledge based approach for recognition of typed text characters using a 2-D FT

    Publication Year: 1992, Page(s):251 - 258
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    A nonconventional text character extraction technique, called horizontal-vertical projection (HVP), has been used for feature extraction of numerous alphanumeric symbols. In an earlier paper a classification algorithm based on a 1-D Fourier transform (FT) was used with NVP. An alternative 2-D FT feature extraction technique is presented and shown to improve on the 1-D approach View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiency in pure blackboard systems

    Publication Year: 1992, Page(s):65 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    The blackboard model is a versatile framework for implementing expert systems. In recent years the speed of blackboard access has been improved but the execution cycle, which manages knowledge source activation and execution, still needs substantial improvement. A method of condensing knowledge sources is presented, and it is shown how to efficiently activate and execute a class of blackboard appl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concept learning in default logic

    Publication Year: 1992, Page(s):244 - 250
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    A model of induction is presented. Knowledge that people use for inductive concept learning is represented explicitly in terms of default schemas. Therefore, concept learning can be viewed as nonmonotonic reasoning in default logic. A computational procedure is also provided as an implementation of the idea presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic version spaces in machine learning

    Publication Year: 1992, Page(s):308 - 315
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    A hybrid learning algorithm for discovering concepts with multiple disjuncts is presented. The algorithm, HYBAL, in incorporating both version spaces and genetic algorithms, extends the work of R.G. Reynolds (1990) to learning of Boolean concepts from an exponentially growing hypothesis space. Learning is accomplished via factoring the underlying version space into tractable subspaces, and then dy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy control is often better than manual control of the very experts whose knowledge it uses: an explanation

    Publication Year: 1992, Page(s):180 - 185
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    A mathematical explanation as to why fuzzy control is smoother and more stable than control by experts whose experience was used to design the fuzzy control is presented. The analysis indicates that fuzzy control is always continuous and exhibits better performance, even in complicated control situations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software automation: from `silly' to `intelligent'

    Publication Year: 1992, Page(s):73 - 76
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    The adaptation of some AI techniques to software automation is proposed. Inductive reasoning is used as the basis of inductive program synthesis, and explanation-based learning is used to learn algorithm design strategies. Methods for elementary algorithm learning, optimizing method learning, and analogical program derivation are also described View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neural network based competitive learning for control

    Publication Year: 1992, Page(s):236 - 243
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The idea of competitive learning for pattern-recognition applications is introduced. A brief review of two competitive learning models, T. Kohonen's self-organizing feature maps (1982, 1989) and S. Grossberg's ART networks (1987), is presented. Neural-net-based partitioning algorithms for learning control are introduced. A simulation study, of these algorithms incorporated into the BOXES machine l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal constraints and their interpretations in natural language

    Publication Year: 1992, Page(s):301 - 305
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    A series of extensions of tense theory of atomic events to accommodate durative events is presented. The interaction of tenses with time adverbials is discussed and a constraint for tense-adverb agreement is proposed. Sentences containing clauses connected by a temporal connective, such as `when', `before', `after', etc. may have different aspect interpretations, depending on the situation types a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TAME: an integrated environment for task-based knowledge and specification acquisition

    Publication Year: 1992, Page(s):342 - 345
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    A knowledge acquisition framework in which both domain knowledge and specification elicited and refined can interact with a knowledge engineer is proposed. TAME, a hypertext-based knowledge acquisition assistant supporting the framework in an integrated environment, is described. TAME supports a task-based specification methodology (TBSM) in knowledge acquisition and specification elicitation in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy distance functions for motion planning

    Publication Year: 1992, Page(s):186 - 189
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    The problem of planning motions offline for a robot in the presence of obstacles via an algorithm that does not proceed by a discretization of the search space involves defining good heuristics to characterize the proximal relationships between two rigid bodies and the development of algorithms for their computation. Several measures are presented, and schemes for their computation are developed. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RCCN: radial basis competitive and cooperative network

    Publication Year: 1992, Page(s):78 - 84
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    The radial basis bidirectional competitive and cooperative network (RCCN) is a bidirectional mapping network that accommodates and generates radial basis function units (RBFUs) with the help of efficient use of the accommodation boundaries. The analysis and simulation show that the automatic generation scheme provides the necessary and sufficient enhancement of the network, the hierarchical learni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical development of a Petri net deadlock analysis program

    Publication Year: 1992, Page(s):230 - 233
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    If a well-structured concurrent program is represented as a Petri net, it is possible to analyze the network for deadlock. By well-structured concurrent program is meant one in which levels of nesting follow structured programming tenets. Program liveness is defined for a well-structured concurrent program represented as a Pefri net, a Prolog program which will analyze the Petri net for deadlock i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Belief maintenance in a natural language system

    Publication Year: 1992, Page(s):293 - 300
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    A method for belief maintenance for a natural language system is proposed. Based on uncertainty values and the interlinkage of directly asserted and derived propositions, the method provides a means for the postponement of a decision regarding the reason for a contradiction, and includes algorithms that perform nonmonotonic reasoning on a commonsense knowledge base in a manner consistent with huma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for production systems with linear-time match

    Publication Year: 1992, Page(s):36 - 43
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A specialized match algorithm called Uni-Rete is reported. Uni-Rete is a specialization of the widely used Rete match algorithm to unique attributes. Performance results for Uni-Rete indicate over tenfold speedup with respect to Rete. The implications of Uni-Rete for non-unique-attribute systems are discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparative evaluation of expert system testing methods

    Publication Year: 1992, Page(s):334 - 341
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    Effective testing (validation, verification and evaluation) for expert systems is becoming important. A comparative evaluation of black-box, white-box, consistency, and completeness testing methods is performed based on the criteria of effectiveness, robustness, and cost. Testing methods are evaluated using life-cycle mutation testing on a VLSI manufacturing diagnostic expert system. The results i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Is production system matching interesting?

    Publication Year: 1992, Page(s):2 - 3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    A panel session in which issues relating to the effects of advances in faster and more parallel hardware, production system match (PSM) algorithms, and application domains for match on PSM as a research area is presented. It is argued that there is no such thing as the optimal matching algorithm, even for the well-defined task of production-system match and that broadening the scope of the matchin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A user customizable X window system interface for simulation of neural networks

    Publication Year: 1992, Page(s):456 - 457
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    An X window system interface, the Neural Shell Version 3.5, which simplifies the use of neural-network simulators for neural-network research is presented. This interface can be customized by the user as additional simulators and toolkit programs are developed and added to the system. The Neural Shell runs on workstations and additionally supports the execution of large neural-network simulations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ClimBS: searching the bias space

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

    The literature on systems that address the selection of inductive bias explicitly is reviewed and a model of inductive bias selection as state space search, which is instantiated in a testbed system with biases as states and bias transformation operators used to move from state to state, is introduced. The testbed allows a system developer to address different dimensions in the bias space and diff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The minimum entropy network

    Publication Year: 1992, Page(s):85 - 92
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    It is shown that, using as basic building block a linear neuron with an anti-Hebb rule and restricted weights, an asymmetric network which computes the eigenvectors in the ascending order of their corresponding eigenvalues can be built. The conditions for their convergence are obtained and demonstrated by simulations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for the management of exceptions in multiple inheritance systems

    Publication Year: 1992, Page(s):222 - 229
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Multiple inheritance systems with exceptions in object-oriented languages are examined. Two types of exceptions may be identified: exceptions by cancellation of an inheritance link and exceptions by cancellation of property. For each type of exception, contradictions appear when there are simultaneously several paths of the inheritance graph, which allow inheritance from an object or from a proper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid architecture for text classification

    Publication Year: 1992, Page(s):286 - 292
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    SKIS, a prototype system that allows for the construction and use of text classification applications, is discussed. SKIS uses a combination of knowledge-based techniques, statistical techniques, morphological processing, and relevance feedback learning techniques to perform text classification. SKIS has been used to construct a prototype text classification application for the routing of customer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid/symbolic connectionist production system

    Publication Year: 1992, Page(s):44 - 53
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The task of implementing a simple rule-based production system in terms of a hybrid symbolic/connectionist architecture is discussed. The aim is to achieve parallel execution of rules. The architecture uses a local representation and builds upon prior work, which resulted in the symbolic/connectionist expert system development tool SC-net. The Hybrid Symbolic/Connectionist Production System (HSC-P... View full abstract»

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