By Topic

Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001

7-9 Nov. 2001

Filter Results

Displaying Results 1 - 25 of 46
  • Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (71 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s): 351
    Request permission for commercial reuse | PDF file iconPDF (59 KB)
    Freely Available from IEEE
  • A decentralized model-based diagnostic tool for complex systems

    Publication Year: 2001, Page(s):95 - 102
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (135 KB) | HTML iconHTML

    We address the problem of diagnosing complex discrete-event systems such as telecommunication networks. Given a flow of observations from the system, the goal is to explain those observations by identifying and localizing possible faults. Several model-based diagnosis approaches deal with this problem but they need the computation of a global model which is not feasible for complex systems like te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perfect sequences for belief networks representation

    Publication Year: 2001, Page(s):87 - 94
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB) | HTML iconHTML

    In contrast to most other approaches used to represent multidimensional probability distributions, which are based on graphical Markov modelling (i.e. dependence structure of distributions is represented by graphs), the described method is rather procedural. We describe a process by which a multidimensional distribution can be composed from a "generating sequence" - a sequence of low-dimensional d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards ontological reconciliation for agents

    Publication Year: 2001, Page(s):3 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (47 KB) | HTML iconHTML

    This paper addresses issues faced by agents operating in large-scale multi-cultural environments. We argue for systems that are tolerant of heterogeneity. The discussion is illustrated with a running example of researching and comparing university web sites, which is a realistic scenario representative of many current knowledge management tasks that would benefit from agent assistance. We discuss ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inconsistent requirements: an argumentation view

    Publication Year: 2001, Page(s):79 - 86
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (99 KB) | HTML iconHTML

    We present a logical framework for reasoning about inconsistent requirements in the context of the multi-viewpoint requirements engineering process. In order to analyse the sources of inconsistencies and to reason with inconsistent requirements, we present an argumentation view of the requirements. Intuitively, argumentation is a tool for reasoning with inconsistent knowledge: requirements are def... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Developing collaborative Golog agents by reinforcement learning

    Publication Year: 2001, Page(s):195 - 202
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (83 KB) | HTML iconHTML

    We consider applications where agents have to cooperate without any communication taking place between them, apart from the fact that they can see part of the environment in which they act. We present a multi-agent system, defined in Golog, that needs to service tasks whose value degrades in time. Initial plans, reflecting prior knowledge about the environment, are expressed as Golog procedures, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic knowledge acquisition from subject matter experts

    Publication Year: 2001, Page(s):69 - 78
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (787 KB) | HTML iconHTML

    This paper presents current results in developing a practical approach, methodology and tool, for the development of knowledge bases and agents by subject matter experts, with limited assistance from knowledge engineers. This approach is based on mixed-initiative reasoning that integrates the complementary knowledge and reasoning styles of a subject matter expert and a learning agent, and on a div... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparing keyword extraction techniques for WEBSOM text archives

    Publication Year: 2001, Page(s):187 - 194
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    The WEBSOM methodology for building very large text archives has a very slow method for extracting meaningful unit labels. This is because the method computes for the relative frequencies of all the words of all the documents associated to each unit and then compares these to the relative frequencies of all the words of all the other units of the map. Since maps may have more than 100,000 units an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load-balancing via a genetic algorithm

    Publication Year: 2001, Page(s):121 - 128
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (42 KB) | HTML iconHTML

    We produce a genetic algorithm (GA) scheduling routine, which with often relatively low cost finds well-balanced schedules. Incoming tasks (of varying durations) accumulate, then are periodically scheduled, in small batches, to the available processors. Two important priorities for our scheduling work are that loads on the processors are well balanced, and that scheduling per se remains cheap in c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RaBeCa: a hybrid case-based reasoning development environment

    Publication Year: 2001, Page(s):61 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    The article presents the main features of a new environment for case-based reasoning systems development, RaBeCa. The software developed to run under Windows, aims to have an architecture open enough to accept external contributions and comprehend tests allowing integration with other artificial intelligence approaches. The system already uses a neural network. A small introduction to the case-bas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data flow coherence criteria in ILP tools

    Publication Year: 2001, Page(s):179 - 186
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (68 KB) | HTML iconHTML

    In this paper we present a new method that uses data flow coherence criteria in definite logic program generation. We outline three main advantages of these criteria supported by our results: (i) drastically pruning the search space (around 90%), (ii) reducing the set of positive examples and reducing or even removing the need for the set of negative examples, and (iii) allowing the induction of p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SHAMASH. An AI tool for modelling and optimizing business processes

    Publication Year: 2001, Page(s):306 - 313
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (130 KB) | HTML iconHTML

    In this paper we describe SHAMASH, a tool for modeling and automatically optimizing Business Processes. The main features that differentiate it from most current related tools are its ability to define and use organisation standards, and functional structure, and make automatic model simulations and optimisation of them. SHAMASH is a knowledge based system, and we include a discussion on how knowl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a general theory for qualitative space

    Publication Year: 2001, Page(s):111 - 118
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    Finding ways for defining the complete and sound (physically plausible) set of relationships between spatial objects is a pre-requisite for the development and realization of qualitative representation and reasoning formalisms. Establishing the set of sound relationships is a complicated task especially when complex objects are considered. Hence, current approaches to qualitative representation an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Smart cars as autonomous intelligent agents

    Publication Year: 2001, Page(s):25 - 32
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB) | HTML iconHTML

    This paper presents a study on the behavior of smart cars by considering them as autonomous intelligent agents. In particular, a smart car could behave as autonomous agent by extracting information from the surrounding environment (road, highway) and determining its position in it, detecting the motion and tracking the behavioral patterns of other moving objects (automobiles) in its own surroundin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining first-order knowledge bases for association rules

    Publication Year: 2001, Page(s):218 - 227
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    Data mining from relational databases has recently become a popular way of discovering hidden knowledge. Methods such as association rules, chi square rules, ratio rules, implication rules, etc. that have been proposed in several contexts offer complimentary choices in rule induction in this model. Other than inductive and abductive logic programming, research into data mining from knowledge bases... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast suboptimal planning with nexus states

    Publication Year: 2001, Page(s):145 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (69 KB) | HTML iconHTML

    Despite recent advances, general-purpose planning still lags behind domain-specific planning in efficiency. We propose a method for automatic incorporation of domain knowledge into general-purpose planning by the identification of nexus, or well-connected, states in the domain. We present an analysis of under what circumstances this method will be applicable, and show that the method significantly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using software agents to avoid collisions among multiple robots

    Publication Year: 2001, Page(s):50 - 57
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (68 KB) | HTML iconHTML

    The paper describes a method where collaborative software agents are used to coordinate the independently planned trajectories of multiple mobile robots to avoid collisions and deadlocks among them. Whenever the distance between two robots drops below a certain value, the agents exchange information about the planned trajectories of the robots and determine whether they are in danger of a collisio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B-Course: a Web service for Bayesian data analysis

    Publication Year: 2001, Page(s):247 - 256
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    B-Course is a free Web-based online data analysis tool, which allows users to analyze their data for multivariate probabilistic dependencies. These dependencies are represented as Bayesian network models. In addition to this, B-Course also offers facilities for inferring certain type of causal dependencies from the data. The software uses a novel "tutorial style" user-friendly interface which inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An effective method for generating multiple linear regression rules from artificial neural networks

    Publication Year: 2001, Page(s):171 - 178
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (209 KB) | HTML iconHTML

    We describe a method for multivariate function approximation which combines neural network learning, clustering and multiple regression. Neural networks with a single hidden layer are universal function approximators. However, due to the complexity of the network topology and the nonlinear transfer function used in computing the activation of the hidden units, the predictions of a trained network ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LOOP-a language for LP-based AI applications

    Publication Year: 2001, Page(s):299 - 305
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (58 KB) | HTML iconHTML

    One major drawback of logic programming, particularly Prolog, is the lack of mechanisms for structuring knowledge (i.e. program clauses). This makes programming-in-the-large a difficult task even using the module system. To overcome this, various attempts were made to extend the logic programming paradigm with object-oriented features. We introduced LOOP previously (2000), a class-based, logic and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alma/Carne: implementation of a time-situated meta-reasoner

    Publication Year: 2001, Page(s):103 - 110
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (66 KB) | HTML iconHTML

    Agents need to operate in dynamic situations where the information they have about the world is incomplete, uncertain and quite possibly false. Active logic has been designed with capabilities that enable these aspects of the world to be taken into account, notably time-situatedness, contradiction tolerance and meta-reasoning. This paper presents a general-purpose implementation of active logic, A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transaction oriented computational models for multi-agent systems

    Publication Year: 2001, Page(s):11 - 17
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB) | HTML iconHTML

    BDI (Belief, Desire, Intention) is a mature and commonly adopted architecture for intelligent agents. However, the current computational model adopted by BDI has a number of problems with concurrency control, recoverability and predictability. This has hindered the construction of agents having robust and predictable behaviour. Indeed the conceptual and practical tools needed for building dependab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial optimization through statistical instance-based learning

    Publication Year: 2001, Page(s):203 - 209
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (97 KB) | HTML iconHTML

    Different successful heuristic approaches have been proposed for solving combinatorial optimization problems. Commonly, each of them is specialized to serve a different purpose or address specific difficulties. However, most combinatorial problems that model real world applications have a priori well known measurable properties. Embedded machine learning methods may aid towards the recognition and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel genetic programming for decision tree induction

    Publication Year: 2001, Page(s):129 - 135
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB) | HTML iconHTML

    A parallel genetic programming approach to induce decision trees in large data sets is presented. A population of trees is evolved by employing the genetic operators and every individual is evaluated by using a fitness function based on the J-measure. The method is able to deal with large data sets since it uses a parallel implementation of genetic programming through the grid model and an out of ... View full abstract»

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