By Topic

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence

16-19 Nov. 1996

Filter Results

Displaying Results 1 - 25 of 86
  • Reasonable conclusions in fuzzy reasoning

    Publication Year: 1996, Page(s):440 - 442
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    We consider fuzzy implication operators which are extensions of the two valued logic implication operator and are non decreasing with respect to their second argument. Firstly, we analyze some features of these operators with regard to fuzzy reasoning with one rule. Then, as regards approximate reasoning with multiple rules, we demonstrate that, for an inference process using Sup-T composition in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AI tools in scheduling problem solving: a solver based on a "well-behaved" restriction of TCSPs

    Publication Year: 1996, Page(s):438 - 439
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    The aim of the paper is to describe a temporal constraint based solver for (job shop) scheduling problems. The heart of the solver is a "well behaved" restriction of the framework of TCSPs defined by R. Dechter, I. Meiri and J. Pearl (1991): the restriction is an algebra and expresses convex constraints or unions of two such constraints. We give a general description of the solver and show its com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing prime implicants by integer programming

    Publication Year: 1996, Page(s):332 - 336
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    An enumerative approach for selective generation of prime implicants of a theory in conjunctive normal form is presented. The method is based on 0-1 programming. Optimal solutions of the integer linear program associated with the theory correspond to prime implicants. All prime implicants can be obtained by augmenting the integer program with new constraints which discard the already obtained solu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deliberative and reactive diagnosis agent based on logic programming

    Publication Year: 1996, Page(s):436 - 437
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    We briefly overview the architecture of a diagnosis agent. We employ logic and logic programming to specify and implement the agent: the knowledge base uses extended logic programming to specify the agent's behaviour and its knowledge about the system to be diagnosed. The inference machine, which provides algorithms to compute diagnoses, as well as the reactive layer that realises a meta interpret... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forward-tracking: a technique for searching beyond failure

    Publication Year: 1996, Page(s):324 - 331
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to express such requirements, we propose a technique called forward-tracking. Intuitively, forward-tracking is a kind of dual of chronological back-tracking: if a program globally fails to find a solution, then a new execution is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolution strategies for focusing a reason maintenance system

    Publication Year: 1996, Page(s):316 - 323
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    The ATMS, as defined by de Kleer and used in a problem solver loses its efficiency due to the exponential complexity of its algorithm. Improvement works are proposed: a) computing only labels of interesting data; b) computing only some environments characterized by a focus. We propose to control a problem solver coupling a deduction system and a reason maintenance system (RIMS) based on the resolu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GATE: an environment to support research and development in natural language engineering

    Publication Year: 1996, Page(s):58 - 66
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1204 KB)

    We describe a software environment to support research and development in natural language (NL) engineering. This environment-GATE (General Architecture for Text Engineering)-aims to advance research in the area of machine processing of natural languages by providing a software infrastructure on top of which heterogeneous NL component modules may be evaluated and refined individually or may be com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Merging test and verification for rule base debugging

    Publication Year: 1996, Page(s):166 - 169
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    A way of formally but partially characterizing knowledge base correctness is to define knowledge base coherency. The first contribution of this paper is to show how taking into account test cases can lead to a new definition of rule base coherency that is better than existing ones. Our second contribution is that we propose extensions of model-based diagnosis that enable the complete characterizat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of neural network structure and learning parameters using genetic algorithms

    Publication Year: 1996, Page(s):200 - 206
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Neural network models of semiconductor manufacturing processes offer advantages in accuracy and generalization over traditional methods. However, model development is complicated by the fact that backpropagation neural networks contain several adjustable parameters whose optimal values are initially unknown. These include learning rate, momentum, training tolerance, and the number of hidden layer ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assistant agents for creation and management of distributed applications

    Publication Year: 1996, Page(s):456 - 457
    Cited by:  Papers (1)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    We propose a software development toolkit named ADAM (Adaptive Distributed Applications Manager) which creates operational distributed applications. To increase the performances of these distributed applications, they are created according to the network, machines and software constraints, and are updated in reply to dynamic environment changes. Using a graphical interface, the user provides funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamical properties of higher order random neural networks

    Publication Year: 1996, Page(s):430 - 431
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    The authors have previously shown dynamical properties-dynamics of the activities for states-for higher order random neural networks, which use the weighted sum of products of input variables, with the digital state {1-,1} model. The paper describes dynamical properties for higher order random neural networks with the analog state models and the digital state (0,1) model. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A task-based production environment for intelligent learning/teaching systems: the 'NGE' kernel

    Publication Year: 1996, Page(s):447 - 449
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    After many studies, experiments, and assessments on the design and development of intelligent learning/teaching systems, we are now offering a production environment for these systems and shells. This environment is based on high abstraction level primitives: the 'NGE' kernel. Elaborated in a cognitive approach, these primitives have been defined on the notion of task (generic, cognitive, operatin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TASK: from the specification to the implementation

    Publication Year: 1996, Page(s):80 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    The paper presents the TASK framework which is intended to cover the life cycle of a knowledge based system. TASK provides: (i) a conceptual language which enables an informal specification at the knowledge level; (ii) a formal language TFL which permits an unambiguous specification; and (iii) an operational shell TASK+ which allows an efficient execution even for badly structured probl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GESIA: uncertainty-based reasoning for a generic expert system intelligent user interface

    Publication Year: 1996, Page(s):52 - 55
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    Generic expert systems are reasoning systems that can be used in many application domains, thus requiring domain independence. The user interface for a generic expert system must contain intelligence in order to maintain this domain independence and manage the complex interactions between the user and the expert system. This paper explores the uncertainty-based reasoning contained in an intelligen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of different types of new attribute on constructive induction

    Publication Year: 1996, Page(s):254 - 257
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    This paper studies the effects on decision tree learning of constructing four types of attribute (conjunctive, disjunctive, M-of-N, and X-of-N representations). To reduce effects of other factors such as tree learning methods, new attribute search strategies, evaluation functions, and stopping criteria, a single tree learning algorithm is developed. With different option settings, it can construct... View full abstract»

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

    Publication Year: 1996, Page(s):34 - 40
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    There is a need to develop more intelligent means for handling text in applications such as information retrieval, information filtering, and message classification. This raises the need for mechanisms for ascertaining what an item of text is about. Even though natural language processing offers the best results, it is not always viable. A less accurate, but more viable alternative, is to reason w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subdefinite models as a variety of constraint programming

    Publication Year: 1996, Page(s):157 - 164
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    This paper describes subdefinite models as a variety of constraint satisfaction problems. The use of the method of subdefinite calculations makes it possible to solve overdetermined and underdetermined problems, as well as problems with uncertain, imprecise and incomplete data. Constraint propagation in all these problems is supported by a single data-driven inference algorithm. Several examples a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refinements in training schemes for the Coulomb Energy network

    Publication Year: 1996, Page(s):194 - 199
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    We discuss the interesting perspective offered by the Coulomb Energy network and we identify certain disadvantages with the existing approach to training it. We address these problems by constraining its architecture (topology) and offer a derivation of the new associated training algorithm. We study further refinements of this algorithm. Most notably, existing genetic algorithms are employed as i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate reasoning for contextual databases

    Publication Year: 1996, Page(s):308 - 315
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    Contextual reasoning has been proposed as a tool for solving the problem of generality in AI and for effectively handling huge knowledge bases, while approximate reasoning has been developed to overcome the computational barrier of classical deduction. This paper combines these approaches to provide an intuitive representation of knowledge and an effective deduction. Its semantics and a tableau ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Composing approximated algorithms based on Hopfield neural network for building a resource-bounded scheduler

    Publication Year: 1996, Page(s):445 - 446
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    In previous work (J.-M. Gallone and F. Charpillet, 1996), we have studied the Hopfield artificial neural network model and its use for solving a particular scheduling problem: non preemptive tasks with release times, deadlines and computation times to be scheduled on several uniform machines. We presented an iterative approach based on Hopfield networks which enables resource bounded reasoning. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-centred planning: lifting classical planning from the literal level to the object level

    Publication Year: 1996, Page(s):346 - 353
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    A great deal of emphasis in classical AI planning research has been placed on search-control issues in plan generation, while the issue of knowledge representation and acquisition of models for use with classical planning engines has been largely ignored. Work in knowledge-based planning, on the other hand, is often associated with 'scruffy' AI, there being no standard representation languages wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An empirical text categorizing computational model based on stylistic aspects

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

    The presented work is strongly motivated by the need for categorizing unrestricted text in terms of a functional style (FS) in order to attain a satisfying outcome in style processing. Towards this aim, a three level description of FS is given that comprises: (a) the basic categories of FS; (b) the main features that characterize each one of the above categories; and (c) the linguistic identifiers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PARIS: a parallel inference system

    Publication Year: 1996, Page(s):216 - 223
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1124 KB)

    This paper presents an inferential system based on abductive interpretation of text. Inference to the best explanation is performed by the recognition of the most economic semantic paths produced by the propagation of markers on a very large linguistic knowledge base. The propagation of markers is controlled by their intrinsic propagation rules, devised from plausible semantic relation chains. An ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Named disjunctions and lazy evaluation for syntactic ambiguities

    Publication Year: 1996, Page(s):460 - 461
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Ambiguity is one of the main sources of complexity in natural language processing. We propose an original solution relying on the use of named disjunctions which are set of ordered formulae linked by a name. This representation is implemented within a constraint logic programming paradigm (allowing the use of underspecified structures) by means of lazy evaluation techniques. This approach avoids t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Le Salon, where agents meet actors

    Publication Year: 1996, Page(s):432 - 433
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    The author presents le Salon, a tool for the construction and management of virtual places on the World Wide Web. Users are represented by interface agents that interact with each other and with independent artificial agents. All interactions follow a strict protocol which allows for partial grounding of the exchanged concepts. He believes that such grounding might lead to a more successful integr... View full abstract»

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