By Topic

Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94

6-9 Nov. 1994

Filter Results

Displaying Results 1 - 25 of 138
  • Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (22 KB)
    Freely Available from IEEE
  • GATTO: an intelligent tool for automatic test pattern generation for digital circuits

    Publication Year: 1994, Page(s):411 - 417
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    This paper deals with the problem of automated test pattern generation for large digital circuits. A distributed approach based on genetic algorithms is presented, which exploits the computational power of workstation networks to solve the problem even for the largest circuits. A prototypical system named GATTO is presented: the experimental results show that good results can be reached with CPU t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a double-based genetic algorithm on a population of computer programs

    Publication Year: 1994, Page(s):418 - 424
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    In this paper, we present a new approach, which improves the performance of a genetic algorithm. Genetic algorithms are iterative search procedures based on natural genetic. We use an original genetic algorithm that manipulates pairs of twins in its population: DGA, double-based genetic algorithm. We show that this approach is relevant for genetic programming, which manipulates populations of tree... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining arc consistency through constraint retraction

    Publication Year: 1994, Page(s):426 - 431
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    To cope with a growing number of applications, the basic formalism of constraint satisfaction problems has to be augmented in various directions. One of these directions is the concept of dynamic constraint problems i.e. problems to which constraints can be added but also retracted at any time. To handle dynamic problems, it is important to adapt efficiently the solution procedures that are availa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A partial breadth-first execution model for Prolog

    Publication Year: 1994, Page(s):129 - 137
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    MEM (Multipath Execution Model) is a novel model for the execution of Prolog programs which combines a depth-first and breadth-first exploration of the search tree. The breadth-first search allows more than one path of the SLD-tree to be explored at the same time. In this way, the computational cost of traversing the whole search tree associated to a program can be decreased because the MEM model ... View full abstract»

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

    Publication Year: 1994, Page(s):432 - 438
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    Forward Checking (FC) is a highly regarded complete search algorithm used to solve constraint satisfaction problems. In this paper a lazy variant of FC called minimal forward checking (MFC) is introduced. MFC is a natural marriage of incremental FC and backchecking. Given a variable selection heuristic which does not depend on domain size MPC's worst case performance on any CSP instance is the num... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructs for building complex symbolic-connectionist systems

    Publication Year: 1994, Page(s):796 - 799
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    In this paper we describe the problem-solving constructs, namely information processing constructs, learning constructs, knowledge representation constructs and computational constructs for building complex symbolic-connectionist systems. These constructs are applicable in particular to complex diagnostic domains and in general to complex data intensive domains View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The RISE system: conquering without separating

    Publication Year: 1994, Page(s):704 - 707
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    Current rule induction systems (e.g. CN2) typically rely on a “separate and conquer” strategy, learning each rule only from still-uncovered examples. This results in a dwindling number of examples being available for learning successive rules, adversely affecting the system's accuracy. An alternative is to learn all rules simultaneously, using the entire training set for each. This app... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A constraint-based approach for the generation of floor plans

    Publication Year: 1994, Page(s):555 - 561
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    We describe a knowledge-based system that generates all possible floor plans satisfying a set of geometric constraints on the rooms (non-overlap, adjacency, minimal/maximal area, minimal/maximal dimension, etc.). Our approach is based on the extension of the constraint techniques; we define in particular a new partial consistency suited to these problems: the semi-geometric arc-consistency. The me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Skeletons and techniques for the systematic development of constraint logic programs

    Publication Year: 1994, Page(s):138 - 144
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    We study the systematic development of constraint logic programs from the viewpoint of “skeletons and techniques” as described by M. Kirschenbaum et al. (1994). We describe a number of fundamental skeleton classes for CLP, and generalize the notion of skeletons to deal with non-structural recursion. Then we describe a range of useful techniques for extending these skeletons. Furthermor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Customizing parallel formulations of backpropagation learning algorithm to neural network architectures: a summary of result

    Publication Year: 1994, Page(s):181 - 189
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    Several generic parallel formulations of the backpropagation learning algorithm have been proposed recently. Further speedups are possible by customizing parallel formulations to the architecture of the neural network. The paper addresses the issue of customizing parallel formulations of the backpropagation learning algorithm to a given neural network architecture on multiprocessors with hypercube... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IIBR-a system for managing/refining structural characteristics discovered from databases

    Publication Year: 1994, Page(s):468 - 475
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    The contents of most databases are ever changing; and erroneous data can be a significant problem in real-world databases. Hence, the process of discovering knowledge from databases is a process based on incipient hypothesis generation/evaluation and refinement/management. Although many systems for knowledge discovery in databases have been proposed, most systems have not addressed the capabilitie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new arc consistency algorithm for CSPs with hierarchical domains

    Publication Year: 1994, Page(s):439 - 445
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    General arc-consistency filtering techniques for constraint satisfaction problems (CSP) can be improved by considering special CSP classes. A domain hierarchical CSP is a CSP in which an intrinsic hierarchical structure of its domains is known. A.K. Mackworth et al. (1985) proposed an are consistency algorithm for domain hierarchical CSPs (HAC) whose worst-case time complexity was 0(md3... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DIALECT 2: an information retrieval system based on distributed artificial intelligence tools

    Publication Year: 1994, Page(s):800 - 803
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    In this paper we present our work on DIALECT 2. It is an information retrieval system using DAI tools which is made up by two modules based on the blackboard model: a linguistic parser and a reformulation module. The linguistic parser extracts the syntactic structure from a request and builds a network of templates which contains the main information elements of the request. The reformulation modu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A practical module system for logic programming and its semantics

    Publication Year: 1994, Page(s):708 - 711
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Encapsulation constructs with import/export declarations is the structuring facility offered in most commercial Prolog systems. However, real-life applications have shown to require a finer information exchange between encapsulated pieces of code. A refinement of import/export declarations for logic modules is presented both as a stricter form of communication between the modules and as a larger v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neo-fuzzy-neuron based new approach to system modeling, with application to actual system

    Publication Year: 1994, Page(s):564 - 570
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    This paper introduces a new approach to system modeling by using a neo-fuzzy-neuron. The system of concern is modeled adaptively by simply feeding to the neo-fuzzy-neuron, the basic principle of which was proposed by the authors in 1992, the input and the output data of the objective system. Firstly, the neo-fuzzy-neuron is applied to the restoration of a saturated and/or intermittent speech or ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formal associative model of logic programming and its abstract instruction set

    Publication Year: 1994, Page(s):145 - 151
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Associative computation is characterized by the intertwining of search by content and data parallel computation. This intertwining facilitates the integration of knowledge retrieval and data parallel computation. The paper describes a formal set of architecture independent rules for an associative model of logic programming, and an abstract instruction set. The model integrates knowledge retrieval... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some issues of reasoning in fuzzy control: principle, practice and perspective

    Publication Year: 1994, Page(s):192 - 196
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    The paper presents the essential structure of fuzzy reasoning and the basic algorithm for fuzzy control. Also it reviews the main studies on fuzzy controller design and its applications proposed or installed so far. Finally, some issues in fuzzy control theory are discussed and directions for improving fuzzy control techniques are suggested View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On learning multiple descriptions of a concept

    Publication Year: 1994, Page(s):476 - 483
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    In sparse data environments, greater classification accuracy can be achieved by learning several concept descriptions of the data and combining their classifications. Stochastic searching can be used to generate many concept descriptions (rule sets) for each class in the data. We use a tractable approximation to the optimal Bayesian method for combining classifications from such descriptions. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards the integration of artificial neural networks and constraint logic programming

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

    We present a general framework for integrating artificial neural networks (ANN) into constraint logic programming for solving constraint satisfaction problems (CSPs). This framework is realized in a novel programming language PROCLANN, which uses the standard goal reduction strategy as frontend to generate constraints for an efficient backend ANN-based constraint-solver. PROCLANN retains the simpl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequences constraint solving in constraint logic programming

    Publication Year: 1994, Page(s):804 - 807
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    This paper deals with consistency techniques over sequences constraints embedded in Constraint Logic Programming CLPS. CLP Sequences constraints are defined over Hereditarily Homogeneous Finite Sets HHFS built on atomic elements to characterise a family of admissible sequences. The relations we are dealing with are classical sets relations (∈,⊂,=,≠) and sequencing relations as potentia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating external functions in an object oriented reasoning system

    Publication Year: 1994, Page(s):712 - 715
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    The paper describes an object-oriented system that smoothly integrates procedural function invocation and declarative rule reasoning into a single homogeneous system. This allows efficient computations expressed as external functions to be incorporated into rule systems to improve computational efficiency and extensibility of intelligent systems. We first discuss the differences between declarativ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Peirce: a tool for abductive inference

    Publication Year: 1994, Page(s):571 - 577
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Abduction, or inference to the best explanation, has been used in artificial intelligence as a framework for solving problems ranging from diagnosis, to test interpretation, to theory formation, to natural language understanding, to perception. Previous research on computational models of abduction has suggested that a single generic strategy may be used to perform abductions in a variety of domai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for organizing knowledge bases in the hierarchical form

    Publication Year: 1994, Page(s):816 - 819
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    We propose OSHAM, a novel top-down, unsupervised concept formation method based on a set-theoretic model for conceptual hierarchies. The method is close to the human approach to hierarchical classification and empirical results state its high ability to correctly classify new objects View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An attempt to apply the dividing and composing method to various frames of Chinese flower and bird paintings

    Publication Year: 1994, Page(s):317 - 324
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    In our previous paper (1990), we discussed methods of expressing the composition knowledge of Chinese flower and bird paintings and proposed the dividing and composing method which could support computer painting based on the composition rules. In this paper, we attempt to apply this dividing and composing method to the various frames of paper (paintings using paper of different shapes) of Chinese... View full abstract»

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