Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence

16-19 Nov. 1996

Filter Results

Displaying Results 1 - 25 of 86
  • 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.
  • 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.
  • 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.
  • 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.
  • ADHOC: a tool for performing effective feature selection

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

    The paper introduces ADHOC, a tool that integrates statistical methods and machine learning techniques to perform effective feature selection. Feature selection plays a central role in the data analysis process since redundant and irrelevant features often degrade the performance of induction algorithms, both in speed and predictive accuracy. ADHOC combines the advantages of both filter and feedba... 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.
  • Knowledge bases and agents for domain knowledge representation

    Publication Year: 1996, Page(s):224 - 227
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (408 KB)

    This paper focuses on the implementation of domain models for problem solving. We assume that the implementation should preserve the form of the domain models, and particularly the division between the knowledge structure and its role toward the solving process. We propose therefore to implement domain models with both knowledge bases and domain agents. We define a domain agent model which is link... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A constraint-based nurse rostering system using a redundant modeling approach

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

    This paper describes the design and implementation of a nurse rostering system using a redundant modeling approach. Nurse rostering is defined as a process of generating timetables for specifying the work shifts of nurses over a given period of time. This process is difficult because the human roster planner has to ensure that every rostering decision made complies with a mixture of hard hospital ... 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.
  • Active change notification in advanced knowledge base servers

    Publication Year: 1996, Page(s):96 - 99
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (432 KB)

    "Intelligent" behavior of database systems is often seen restricted to comfortable support for query answering (including limited forms of reasoning) and navigating within the stored data. However, active notification for clients about changes in the database is an important requirement for advanced interaction between the database and its client applications. These usually hold (derived) subsets ... 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 genetic algorithm for automatic generation of test logic for digital circuits

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

    Testing is a key issue in the design and production of digital circuits: the adoption of BIST (Built-in Self-Test) techniques is increasingly popular, but sometimes requires efficient algorithms for the automatic generation of the logic which generates the test vectors applied to the unit under test. This paper addresses the issue of identifying a cellular automaton able to generate input patterns... 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.
  • 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.
  • GESIA: uncertainty-based reasoning for a generic expert system intelligent user interface

    Publication Year: 1996, Page(s):52 - 55
    Cited by:  Papers (6)  |  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.
  • 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.
  • Comparing arguments using preference orderings for argument-based reasoning

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

    Argument-based reasoning is a promising approach to handle inconsistent belief bases. The basic idea is to justify each plausible conclusion by acceptable arguments. The purpose of the paper is to enforce the concept of acceptability by the integration of preference orderings. Pursuing previous work on preference-based argumentation, the authors focus on the definition of preference relations for ... 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.
  • 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.
  • Computer generated intelligent companions for distributed virtual environments

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

    The employment of computer generated forces (CGFs) within distributed virtual environments (DVEs) dramatically increases the number of entities in a simulated training environment. However, current CGF limitations produce behaviours that can be defeated using methods ineffective against humans. Our research focuses on developing aircraft CGFs. It is necessary to deal with uncertainty, ambiguity, a... 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.
  • Application of a hybrid neural network for the discrimination of seeds by artificial vision

    Publication Year: 1996, Page(s):484 - 489
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (552 KB)

    Intelligent hybrid systems are playing an increasing role in the development of artificial intelligence. In this study, we applied simulated annealing to adjust the weights of a multilayer neural network (MNN). Two versions of simulated annealing were tested: conventional simulated annealing (CSA) and fast simulated annealing (FSA). The applied hybrid system was used as a classifier in order to di... 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.
  • 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.
  • Opportunistic behavior and its automatic adjustment in dynamic task domains

    Publication Year: 1996, Page(s):338 - 345
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (828 KB)

    In many dynamic application domains, the environment changes during problem solving. A problem solver, in these applications, does not have complete information about the task and resources, a priori. The problem solver is required to use up-to-date information that becomes available on line. It must use this information to avoid producing solutions that are obsolete by the time they are to be exe... View full abstract»

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