By Topic

Tools with Artificial Intelligence, 1996., Proceedings Eighth IEEE International Conference on

Date 16-19 Nov. 1996

Filter Results

Displaying Results 1 - 25 of 86
  • GESIA: uncertainty-based reasoning for a generic expert system intelligent user interface

    Publication Year: 1996, Page(s):52 - 55
    Cited by:  Papers (3)  |  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.
  • Artificial neurogenesis: an application to autonomous robotics

    Publication Year: 1996, Page(s):207 - 214
    Cited by:  Papers (2)
    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.
  • 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 (2)
    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.
  • 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.
  • 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.
  • Strategy of perception and temporal representation of beliefs

    Publication Year: 1996, Page(s):48 - 51
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    An autonomous system uses sensors in order to update an uncertain representation of its environment, which must remain well-grounded with regards to the risks and the constraints of its mission. The choice of a framework for the representation of beliefs which is adapted to deal with both time and uncertainty is a crucial point. A perception strategy should be founded on an evaluation of the relev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Case-based classification using similarity-based retrieval

    Publication Year: 1996, Page(s):410 - 419
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    Classification involves associating instances with particular classes by maximizing intra-class similarities and minimizing inter-class similarities. The paper presents a novel approach to case-based classification. The algorithm is based on a notion of similarity assessment and was developed for supporting flexible retrieval of relevant information. Validity of the proposed approach is tested on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two new constraint propagation algorithms requiring small space complexity

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

    Recently, efficient algorithms have been proposed to achieve arc- and path-consistency in constraint networks. The best path-consistency algorithm proposed is PE-{5|6} which is a natural generalization of AC-6 to path-consistency independently proposed by M. Singh (1995) for PC-5 and A. Chmeiss and P. Jegou (1995) for PC-6. Unfortunately, we have remarked that PC-{5|6}, though it is widely better ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict analysis in search algorithms for satisfiability

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

    Introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for propositional satisfiability (SAT). GRASP incorporates several search-pruning techniques, some of which are specific to SAT, whereas others find equivalent in other fields of artificial intelligence. GRASP is premised on the inevitability of conflicts during a search, and its most distinguishing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Oz Scheduler: a workbench for scheduling problems

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

    This paper describes the Oz Scheduler; a workbench for scheduling problems. Through a graphical interface, the user can freely combine the elements that define a scheduling strategy. Such elements include constraints with different propagation behavior or distribution and search strategies. Exploring the possible combinations can lead to better solutions. Recent and successful techniques for sched... 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
    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.
  • An empirical investigation of the forward checking algorithm and its derivatives

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

    Forward checking (FC) is one of the most popular algorithms used to solve constraint satisfaction problems. A lazy variant of FC has been proposed called minimal forward checking (MFC). Previous empirical results suggest that MFC substantially outperforms FC when the fail first (FF) heuristic is not used. These results also suggest that the laziness of MFC can have substantial negative effects whe... 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.
  • 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.
  • 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.
  • Nestor: a trail blazer for hypertext

    Publication Year: 1996, Page(s):420 - 425
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    The paper presents Nestor, a hypertext system on the World Wide Web dedicated to the consultation of technical documents at France Telecom. Assuming the double hypothesis that navigations carried out by the user have on one hand a goal and on the other become more and more efficient through time, the connectionist approach aims to find relevant implicit links. Discovering these informal and useful... 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.
  • 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.
  • 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.
  • Deduction over mixed-level logic representations for text passage retrieval

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

    A system is described that uses a mixed-level representation of (part of) the meaning of natural language documents (based on standard Horn clause logic) and a variable-depth search strategy that distinguishes between the different levels of abstraction in the knowledge representation to locate specific passages in the documents. Mixed-level representations as well as variable depth search strateg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental Markov-model planning

    Publication Year: 1996, Page(s):41 - 47
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    This paper presents an approach to building plans using partially observable Markov decision processes. The approach begins with a base solution that assumes full observability. The partially observable solution is incrementally constructed by considering increasing amounts of information from observations. The base solution directs the expansion of the plan by providing an evaluation function for... 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 (1)  |  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.
  • 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.
  • 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.