Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence

16-19 Nov. 1996

Filter Results

Displaying Results 1 - 25 of 86
  • Meta Updater: an interactive tool for minimal view updates in knowledge bases

    Publication Year: 1996, Page(s):478 - 479
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Presents the design of an interactive tool for minimal updates of views in knowledge bases, while maintaining the consistency, expressed by a set of integrity constraints. Minimality is based on a partial order which captures the distance between the old state, before the update request, and the new state, in which the request is satisfied. On the user interface part, once the schema and the datab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Natural language edit controls: constrained natural language devices in user interfaces

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

    The concept of "natural language edit controls" (NLECs) is introduced. NLECs are special-purpose devices within graphical user interfaces (GUIs) for inputting part of a user's query in natural language which, when combined with other GUI controls for inputting the remainder of the query, can be used to build the most effective interface for a particular application. NLECs require less grammatical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Boolean approach to construct neural networks for non-Boolean problems

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

    A neural network construction method for problems specified for data sets with input and/or output values in the continuous or discrete domain is described and evaluated. This approach is based on a Boolean approximation of the data set and is generic for various neural network architectures. The construction method takes advantage of a construction method for Boolean problems without increasing t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • COMPOzE-intention-based music composition through constraint programming

    Publication Year: 1996, Page(s):118 - 121
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    We goal of the work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this tas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognising a scenario by calculating a temporal proximity index between constraint graphs

    Publication Year: 1996, Page(s):464 - 466
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    The recognition of temporal scenarios is expressed by means of the proximity between a scenario (which represents a system's possible behavior) and a session (which describes the observed behaviour). This recognition is qualified with a proximity index, which allows one to classify, either online or offline, the scenario candidates for an explanation of the evolution. This approach, when used in a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perceptrons with polynomial post-processing

    Publication Year: 1996, Page(s):472 - 474
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    Introduces tensor-product neural networks, composed of a layer of univariate neurons followed by a net of polynomial post-processing. We look at the general approximation problem by these networks observing in particular their relationship to the Stone-Weierstrass theorem for uniform function algebras. The implementation of the post-processing as a two-layer network with logarithmic and exponentia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evolutionary approach for time dependant optimization

    Publication Year: 1996, Page(s):2 - 9
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    Many real-world problems involve measures of objectives that may be dynamically optimized. The application of evolutionary algorithms in time dependent optimization is receiving growing interest as potential applications are numerous ranging from mobile robotics to real time process command. Moreover, constant evaluation functions skew results relative to natural evolution so that it has become a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating agents and objects to develop distributed AI systems

    Publication Year: 1996, Page(s):443 - 444
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    The paper presents a language for the development of multi agent systems that allows a user to write programs with a small effort thanks to a predefined agent model and a set of specialized primitives for agent management. Moreover the user can develop agent parts at a low level, taking advantage of all the potentialities of C++, Common Lisp and Java object oriented languages, and reusing a large ... 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.
  • Incremental algorithms for managing temporal constraints

    Publication Year: 1996, Page(s):360 - 363
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    This paper addresses the problem of efficiently updating a network of temporal constraints when constraints are removed from or added to an existing network. Such processing tasks are important in many AI applications requiring a temporal reasoning module. First we analyze the relationship between shortest-paths algorithms for directed graphs and arc-consistency techniques. Then we focus on a subc... 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.
  • A practical approach to knowledge representation and reasoning in relational databases

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

    Describes a practicable approach to extend relational databases to deductive databases by using a two-level knowledge representation mechanism. By this approach, we developed a deductive database add-in module that can be easily integrated with relational databases. Therefore, users can get deductive reasoning functionality without changing their favourite relational databases and query languages.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new genetic algorithm using large mutation rates and population-elitist selection (GALME)

    Publication Year: 1996, Page(s):25 - 32
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Genetic algorithms (GAs) are promising for function optimization. Methods for function optimization are required to perform local search as well as global search in a balanced way. It is recognized that the traditional GA is not well suited to local search. I have tested algorithms combining various ideas to develop a new genetic algorithm to obtain the global optimum effectively. The results show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • Arc-consistency in dynamic CSPs is no more prohibitive

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

    Constraint satisfaction problems (CSPs) are widely used in Artificial Intelligence. The problem of the existence of a solution in a CSP being NP-complete, filtering techniques and particularly arc-consistency are essential. They remove some local inconsistencies and so make the search easier. Since many problems in AI require a dynamic environment, the model was extended to dynamic CSPs (DCSPs) an... 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.
  • Global path planning for autonomous qualitative navigation

    Publication Year: 1996, Page(s):354 - 359
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    We describe a novel global path planning method for autonomous qualitative navigation in indoor environments. Global path planning operates on top of a qualitative map of the environment that describes variations in sensor behavior between adjacent regions in space. The method takes into consideration the global topology of the environment and applies a set of criteria that can minimize the errors... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Artificial neurogenesis: an application to autonomous robotics

    Publication Year: 1996, Page(s):207 - 214
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1052 KB)

    A lot of research papers focus on the challenging problem of the combination of genetic algorithms and artificial neural networks. Developmental and molecular biology may be a source of inspiration for designing powerful artificial neurogenesis systems allowing the generation of complex modular structures. This paper describes in detail such a neurogenesis model associated with an evolutionary pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved critical diagnosis reasoning method

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

    Model-based diagnosis has the disadvantage of a high computational complexity. One way to overcome this disadvantage is to focus the diagnosis on a reduced diagnostic space. We propose an improved critical diagnosis reasoning method based on the method proposed by (Raiman et al., 1993). The method focuses the diagnosis on finding out the kernel diagnoses instead of the whole diagnoses. We give an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of prime implicates and prime implicants by a variant of the Davis and Putnam procedure

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

    The problem is the transformation of a conjunctive normal form (CNF) into a minimized (for the inclusion operator) disjunctive normal form (DNF) and vice versa. This operation is called the unionist product. For a CNF (resp. DNF), one pass of the unionist product provides the prime implicants (resp. implicates); two passes provide the prime implicates (resp. implicants). An algorithm built upon th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary CSP solving as an inference process

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

    We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving binary CSPs (constraint satisfaction problems) once they are expressed as rewriting rules coordinated by strategies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nogood recording for valued constraint satisfaction problems

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

    In the frame of classical constraint satisfaction problems (CSPs), the backtrack tree search, combined with learning methods, presents a double advantage: for static solving, it improves the search speed by avoiding redundant explorations; for dynamic solving (after a slight change of the problem) it reuses the previous searches to build a new solution quickly. Backtrack reasoning concludes the re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying a mutation-based genetic algorithm to processor configuration problems

    Publication Year: 1996, Page(s):17 - 24
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    The processor configuration problem (PCP) is a constraint optimization problem. The task is to link up a finite set of processors into a network; minimizing the maximum distance between processors. Since each processor has a limited number of communication channels, a carefully planned layout could minimize the overhead for message switching. We present a genetic algorithm (GA) approach to the PCP... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal forward checking with backmarking and conflict-directed backjumping

    Publication Year: 1996, Page(s):290 - 298
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    Dent and Mercer (1996) have introduced an algorithm called minimal forward checking (MFC) which always performs no worse than forward checking (FC) in terms of number of compatibility checks and node expanded given the same variable and value orderings. In this paper we describe an algorithm which extends MFC with backmarking and conflict-directed backtracking. The new algorithm has a smaller spac... 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.