Constructing deliberative agents with case-based reasoning technology

This article shows how autonomous agents may be constructed with the help of case-based reasoning (CBR) systems. The advantages and disadvantages of deliberative agents are discussed, and it is shown how to solve some of their inconveniences, especially those related to their implementation and adaptation. The Internet is one of the most popular vehicles for disseminating and sharing information through computer networks and it is influencing the business world. An agent-based solution is presented to show how the proposed technology may facilitate and improve an e-business strategy. © 2003 Wiley Periodicals, Inc

Constructing Autonomous Distributed Systems using CBR-BDI Agents.

This chapter introduces a robust mathematical formalism for the definition of deliberative agents implemented using a case-based reasoning system. The concept behind deliberative agents is introduced and the case-based reasoning model is described using this analytical formalism. Variational calculus is introduced in this chapter to facilitate to the agents the planning and replanning of their intentions in execution time, so they can react to environmental changes in real time. A variational calculus based planner for constructing deliberative agents is the presented and compared with other planners. Reflecting the continuous development in the tourism industry as it adapts to new technology, the chapter includes the formalisation of an agent developed to assist potential tourists in the organisation of their holidays and to enable them to modify their schedules on the move using wireless communication systems

Democratising biotechnology?: Deliberation, participation and social regulation in a neo-liberal world

There is now significant policy and academic interest in the governance of science and technology for sustainable development. In recent years this has come to include a growing emphasis on issues of public understanding of science and innovative processes of deliberative and inclusive policy-making around controversial technologies such as nuclear power and agricultural biotechnology. Concern with such issues coincides with rising levels of interest in deliberative democracy and its relationship to the structures and processes of global governance. This article connects these two areas through a critical examination of ‘global’ deliberations about agricultural biotechnology and its risks and benefits. It draws on an extensive survey concerned with the diverse ways in which a range of governments are interpreting and implementing their commitments under the Cartagena Protocol on Biosafety regarding public participation and consultation in order to assess the potential to create forms of deliberation through these means. The article explores both the limitations of public deliberation within global governance institutions as well as of projects whose aim is to impose participation from above through international law by advocating model approaches and policy ‘tool kits’ that are insensitive to vast differences between countries in terms of capacity, resources and political culture

Robust Computer Algebra, Theorem Proving, and Oracle AI

In the context of superintelligent AI systems, the term "oracle" has two meanings. One refers to modular systems queried for domain-specific tasks. Another usage, referring to a class of systems which may be useful for addressing the value alignment and AI control problems, is a superintelligent AI system that only answers questions. The aim of this manuscript is to survey contemporary research problems related to oracles which align with long-term research goals of AI safety. We examine existing question answering systems and argue that their high degree of architectural heterogeneity makes them poor candidates for rigorous analysis as oracles. On the other hand, we identify computer algebra systems (CASs) as being primitive examples of domain-specific oracles for mathematics and argue that efforts to integrate computer algebra systems with theorem provers, systems which have largely been developed independent of one another, provide a concrete set of problems related to the notion of provable safety that has emerged in the AI safety community. We review approaches to interfacing CASs with theorem provers, describe well-defined architectural deficiencies that have been identified with CASs, and suggest possible lines of research and practical software projects for scientists interested in AI safety.Comment: 15 pages, 3 figure

Supporting Constructive Learning with a Feedback Planner

A promising approach to constructing more effective computer tutors is implementing tutorial strategies that extend over multiple turns. This means that computer tutors must deal with (1) failure, (2) interruptions, (3) the need to revise their tactics, and (4) basic dialogue phenomena such as acknowledgment. To deal with these issues, we need to combine ITS technology with advances from robotics and computational linguistics. We can use reactive planning techniques from robotics to allow us to modify tutorial plans, adapting them to student input. Computational linguistics will give us guidance in handling communication management as well as building a reusable architecture for tutorial dialogue systems. A modular and reusable architecture is critical given the difficulty in constructing tutorial dialogue systems and the many domains to which we would like to apply them. In this paper, we propose such an architecture and discuss how a reactive planner in the context of this architecture can implement multi-turn tutorial strategies

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques

Analytical Model for Constructing Deliberative Agents.

This paper introduces a robust mathematical formalism for the definition of deliberative agents implemented using a case-based reasoning system. The concept behind deliberative agents is introduced and the case-based reasoning model is described using this analytical formalism. Variational calculus is used during the reasoning process to identify the problem solution. The agent may use variational calculus to generate plans and modify them at execution time, so they can react to environmental changes in real time. Reflecting the continuous development in the tourism industry as it adapts to new technology, the paper includes the formalisation of an agent developed to assist potential tourists in the organisation of their holidays and to enable them to modify their schedules on the move using wireless communication systems