5388622
Prolegomena to Concise Theories of Action
A new methodology for developing theories of action has recently emerged which provides means for formally evaluating the correctness of such theories. Yet, for a theory of action to qualify as a solution to the frame problem, not only does it need to produce correct inferences, but moreover, it needs to derive these inferences from a concise representation of the domain at hand. The new methodology however offers no means for assessing conciseness. Such a formal account of conciseness is developed in this paper. Combined with the existing criterion for correctness, our account of conciseness offers a framework where proposed solutions to the frame problem can be formally evaluated.
33506424
Explanation and Theory Base Transmutations
35848656
Default Reasoning and Belief Revision in the CIN Project
6685381
Determining Explanations using Transmutations
Intelligent Information systems do not usually possess complete information about the world with which they interact. The AGM paradigm has become one of the standard frameworks for modeling changes to repositories of information. Its principal constructions for change operators rely on some form of underlying preference relation. The process of changing such a preference relation is known as a transmutation. Spohn's conditionalization can be interpreted as a transmutation that imposes a relative minimal change. A transmutation based on an absolute minimal change is an adjustment. 
 
In this paper we develop a notion of explanation using transmutations of information systems. Following Gardenfors lead we recast Spohn's notion of reason for within the general setting of transmutations and extend this to characterize most plausible explanations. We also investigate the relationship between explanation based on abduction and Spohnian reasons based on adjustments. Finally, and rather surprisingly, we identify explicit conditions that characterize the various forms of explanations identified by Boutilier and Becher using Spohnian reasons.
30615446
On the Logic of Theory Base Change
Recently there has been considerable interest in change operators for theory bases, rather than entire theories. Especially since such operators could support computer-based implementations of revision systems. However, a perceived problem associated with theory base change operators is their sensitivity to the syntax of the theory base used. Although it has been argued that this sensitivity should reflect a higher level of commitment to formulae in the theory base than formulae derivable from the theory base. In this paper we develop a logic of theory base change, using constructions based on ensconcements. We show whenever two theory bases have equivalent ensconcements, the logical closure of their theory base revisions are identical. Moreover, we give explicit relationships associating theory base revision and theory base contraction, and provide explicit relationships between theory base change and theory change operations. We claim that these relationships show that our theory base revision and theory base contraction operators exhibit desirable behaviour.
5837913
Anytime Belief Revision
Belief Revision is a ubiquitous process underlying many forms of intelligent behavior. The AGM paradigm is a powerful framework for modeling and implementing belief revision systems based on the principle of Minimal Change; it provides a rich and rigorous foundation for computer-based belief revision architectures. Maxi-adjustment is a belief revision strategy for theory bases that can be implemented using a standard theorem prover, and one that has been used successfully for several applications. In this paper we provide an anytime decision procedure for maxi-adjustments, and study its complexity. Furthermore, we outline a set of guidelines that serve as a protomethodology for building belief revision systems employing a maxi-adjustment. The algorithm is under development in the belief revision module of the CIN Project.
156651
Computers and learning
The important questions for instructors to address concern what skills the student is to learn and how the student is to be motivated to acquire those skills. Questions about simulations, graphics tools, and the like are unimportant until the first two questions have been answered adequately. We discuss the role of explanation by students and describe a mechanism for motivating students to learn.
18507988
The Bioinformatics Template Library-generic components for biocomputing
MOTIVATION
The efficiency of bioinformatics programmers can be greatly increased through the provision of ready-made software components that can be rapidly combined, with additional bespoke components where necessary, to create finished programs. The new standard for C++ includes an efficient and easy to use library of generic algorithms and data-structures, designed to facilitate low-level component programming. The extension of this library to include functionality that is specifically useful in compute-intensive tasks in bioinformatics and molecular modelling could provide an effective standard for the design of reusable software components within the biocomputing community.


RESULTS
A novel application of generic programming techniques in the form of a library of C++ components called the Bioinformatics Template Library (BTL) is presented. This library will facilitate the rapid development of efficient programs by providing efficient code for many algorithms and data-structures that are commonly used in biocomputing, in a generic form that allows them to be flexibly combined with application specific object-oriented class libraries.


AVAILABILITY
The BTL is available free of charge from our web site http://www.cryst.bbk.ac.uk/~classlib/ and the EMBL file server http://www.embl-ebi.ac.uk/FTP/index.html
14053123
Electronic consultation at the national assembly for Wales
Significant developments are occurring in the domain of electronic government within the UK – the use of ICT to enable re-structuring of governmental processes. In this paper we look at that subset of e-Government known as electronic democracy. In particular, we describe how electronic consultation, an important facet of electronic democracy, is being used to procure ideas from partnership organisations and citizenry in relation to the policy formulation processes at a devolved regional assembly in the UK – the National Assembly for Wales (NAfW). We utilise a process model of governance focused around the concept of the policy cycle. This process is currently being enabled at the NAfW through the development of a series of bespoke ICT systems. Such forms of ICT innovation are seen by many to be significant ways in which government may re-engage with its populace, address issues of social exclusion in the area of democratic participation and generally re-energise the democratic process.
45669775
Teledemocracy and the National Assembly of Wales
This paper describes the case of the National Assembly of Wales and the relevance of information and communications technology (ICT) to supporting its internal and external democratic processes. We review a number of tele-democracy initiatives from around the world and develop a case study of tele-democracy as it impacts upon a recent attempt to introduce a form of devolved government in the UK. We consider the current manner in which ICT is being used by the National Assembly of Wales to conduct its internal processes. We also consider some of the ways in which the National Assembly makes use of ICT to enable its links with the Welsh population. We examine some of the problems experienced, and consider some of the possible ways in which tele-democracy may be encouraged within Wales in the future.