Compiled Labelled Deductive Systems (CLDS) provide a uniform logical framework where families of different logics can be given a uniform proof system and semantics. A variety of applications of this framework have been proposed so far... more
Compiled Labelled Deductive Systems (CLDS) provide a uniform logical framework where families of different logics can be given a uniform proof system and semantics. A variety of applications of this framework have been proposed so far ranging from extensions of classical logics (e.g. normal modal logics and multi-modal logics) to non-classical logics such as resource and substructural loogics. Labelled natural
Research Interests:
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci's tableau system for role-based access control. The ACCLDS... more
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci's tableau system for role-based access control. The ACCLDS system overcomes some of the limitations of Massaci's approach by combining its multi-modal propositional language with a labelling algebra that allows reason- ing explicitly about dynamic properties of the
Research Interests:
This paper proposes a multi-agent, multi-threaded architec- ture for a distributed inference system for a dynamic group of agents. The system can opportunistically make use of new agents that join the group, whilst a proof is in progress.... more
This paper proposes a multi-agent, multi-threaded architec- ture for a distributed inference system for a dynamic group of agents. The system can opportunistically make use of new agents that join the group, whilst a proof is in progress. It can also recover if an agent leaves. Final proofs only make use of the knowledge bases of agents that are in
Research Interests:
This paper describes a proof theoretic and semantic approach in which logics belonging to dierent families can be given common notions of derivability relation and semantic entailment. This approach builds upon Gabbay's methodology of... more
This paper describes a proof theoretic and semantic approach in which logics belonging to dierent families can be given common notions of derivability relation and semantic entailment. This approach builds upon Gabbay's methodology of Labelled Deductive Systems (LDS) and it is called the compila- tion approach for labelled deductive systems (CLDS). Two dierent logics are here considered, (i) the modal
Research Interests:
Research Interests:
Research Interests:
this paper we shall, instead, use a fragmentof this family of logics as a case-study to illustrate a set of methodsoriginating in the LDS program. In particular, we aim to illuminate thefollowing aspects:(I) By virtue of the extra power... more
this paper we shall, instead, use a fragmentof this family of logics as a case-study to illustrate a set of methodsoriginating in the LDS program. In particular, we aim to illuminate thefollowing aspects:(I) By virtue of the extra power of labels and labelling algebras, traditionalproof systems can be transformed so as to become applicable over amuch wider territory whilst retaining
Research Interests:
Neural-symbolic integration concerns the integration of sym- bolic and connectionist systems. Distributed knowledge,rep- resentation is traditionally seen under a purely symbolic per- spective. In this paper, we show how neural networks... more
Neural-symbolic integration concerns the integration of sym- bolic and connectionist systems. Distributed knowledge,rep- resentation is traditionally seen under a purely symbolic per- spective. In this paper, we show how neural networks can represent symbolic distributed knowledge, acting as multi- agent systems with learning capability (a key feature of neu- ral networks). We then apply our approach to the well-known
Research Interests:
Page 1. Artur S. d'Avila Garcez Krysia B. Broda Dov M. Gabbay Neural-Symbolic Learning Systems Foundations and Applications Springer Page 2. Page 3. Perspectives in Neural Computing Springer London Berlin... more
Page 1. Artur S. d'Avila Garcez Krysia B. Broda Dov M. Gabbay Neural-Symbolic Learning Systems Foundations and Applications Springer Page 2. Page 3. Perspectives in Neural Computing Springer London Berlin Heidelberg ...
Research Interests:
This book is about the integration of neural networks and symbolic rules. While symbolic artificial intelligence assumes that the mind is the focus of intelligence, and thus intelligent behaviour emerges from complex symbol processing... more
This book is about the integration of neural networks and symbolic rules. While symbolic artificial intelligence assumes that the mind is the focus of intelligence, and thus intelligent behaviour emerges from complex symbol processing mechanisms, connectionist artificial intelligence admits that intelligence lies in the brain, and therefore tries to model it by simulating its electrochemical neuronal structures. Clearly, such structures
In this chapter we introduce some basic concepts used throughout this book. We also present basic definitions and results on Inductive Learning and Artificial Neural Networks. In order that the book be reasonably self-contained, we... more
In this chapter we introduce some basic concepts used throughout this book. We also present basic definitions and results on Inductive Learning and Artificial Neural Networks. In order that the book be reasonably self-contained, we include an introductory section on Logic Programming and Nonmonotonic Reasoning, together with some results in Belief Revision of logic program theories. References to introductory work
In this paper a uniform methodology to perform Natural Deduction over the family of linear, relevance and intuitionistic logics is proposed The methodology follows the Labelled Deductive Systems (LDS) discipline, where the deductive... more
In this paper a uniform methodology to perform Natural Deduction over the family of linear, relevance and intuitionistic logics is proposed The methodology follows the Labelled Deductive Systems (LDS) discipline, where the deductive process manipulates declarative units { formulas labelled according to a labelling algebra In the system de - scribed here, labels are either ground terms or variables
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
In this chapter, we apply the C-IL2P system to two problems of DNA classification, which have become benchmark data sets for testing the accuracy of machine learning systems. We compare the results obtained by different neural, symbolic... more
In this chapter, we apply the C-IL2P system to two problems of DNA classification, which have become benchmark data sets for testing the accuracy of machine learning systems. We compare the results obtained by different neural, symbolic and hybrid inductive learning systems. For example, the test-set performance of C-IL2P is at least as good as those of KBANN and Backpropagation,
Research Interests:
In this chapter, we present the results of an empirical analysis of the ABG system of knowledge extraction from trained networks, using traditional examples and real-world application problems. The implementation of the system has been... more
In this chapter, we present the results of an empirical analysis of the ABG system of knowledge extraction from trained networks, using traditional examples and real-world application problems. The implementation of the system has been kept as simple as possible, and does not benefit from all the features of the theory presented in the previous chapter.
Research Interests:
As a nonmonotonic learning system, C-IL2P has interesting connections with Belief Revision [Gar92] and, more specifically, Truth Maintenance Systems (TMS) [Doy79] (see Chapter 2 for an overview of TMSs). When background knowledge is... more
As a nonmonotonic learning system, C-IL2P has interesting connections with Belief Revision [Gar92] and, more specifically, Truth Maintenance Systems (TMS) [Doy79] (see Chapter 2 for an overview of TMSs). When background knowledge is encoded as defeasible into a neural network, the set of training examples may specify a revision of that knowledge. In addition, the set of examples can be
Research Interests:
In this chapter, we apply C-IL2P in a real problem of software requirements specifications. We use a partial specification of an automobile cruise control system to illustrate all phases of C-IL2P (rule insertion, refinement and... more
In this chapter, we apply C-IL2P in a real problem of software requirements specifications. We use a partial specification of an automobile cruise control system to illustrate all phases of C-IL2P (rule insertion, refinement and extraction). Particularly relevant to the area of requirements specifications is the problem of handling inconsistencies. It has been the focus of an increasing amount of
Research Interests:
In this chapter, we tackle the problem of extracting symbolic knowledge from trained neural networks; that is, the problem of finding “logical representations” for such networks. We present a new method of extraction that captures... more
In this chapter, we tackle the problem of extracting symbolic knowledge from trained neural networks; that is, the problem of finding “logical representations” for such networks. We present a new method of extraction that captures nonmonotonic rules encoded in the network and show that such a method is sound. The ideas presented here comply with the concept that, in machine
Research Interests:
In this book, we have seen that the integration of Connectionist Logic Systems (CLS) and Hybrid Systems by Translation (HST) may provide effective Neural-Symbolic Learning Systems. C-IL2P is an example of such a system. In order to enable... more
In this book, we have seen that the integration of Connectionist Logic Systems (CLS) and Hybrid Systems by Translation (HST) may provide effective Neural-Symbolic Learning Systems. C-IL2P is an example of such a system. In order to enable effective learning from examples and background knowledge, the main insight was to keep the network structure as simple as possible, and try
Research Interests:
Research Interests:
Artificial Neural Networks have previously been applied in neuro-symbolic learning to learn ground logic program rules. However, there are few results of learning relations using neuro-symbolic learning. This paper presents the system... more
Artificial Neural Networks have previously been applied in neuro-symbolic learning to learn ground logic program rules. However, there are few results of learning relations using neuro-symbolic learning. This paper presents the system PAN, which can learn relations. The inputs to PAN are one or more atoms, representing the conditions of a logic rule, and the output is the conclusion of
Research Interests:
Research Interests:
Research Interests:
... Later there was light encouragement and a demo, and more students tried it out ... Jape was originally developed about the same time as Pandora by Richard Bornat and ... web-based course on modern formal logic including other... more
... Later there was light encouragement and a demo, and more students tried it out ... Jape was originally developed about the same time as Pandora by Richard Bornat and ... web-based course on modern formal logic including other interactive learning environments and video clips. ...
Research Interests:
Page 1. Labelled Natural Deduction for Conditional Logics of Normality KRYSIA BRODA, Department of Computing, Imperial College, London SW7 2BZ, E-mail: kb@doc.ic.ac.uk DOV M. GABBAY, Augustus De Morgan Professor ...
Research Interests:
ABSTRACT
Research Interests:
This paper introduces a proof procedure that integrates Abductive Logic Programming (ALP) and Inductive Logic Programming (ILP) to automate the learning of first order Horn clause theories from examples and background knowledge. The work... more
This paper introduces a proof procedure that integrates Abductive Logic Programming (ALP) and Inductive Logic Programming (ILP) to automate the learning of first order Horn clause theories from examples and background knowledge. The work builds ...
Research Interests:
Research Interests:
... as "bad and ill-fated". However, the problem raised by Popper was, and still is, a real one. In fact we show that the popular approaches in terms of natural deduction and analytic tableaux are unsatisfactory. Then we... more
... as "bad and ill-fated". However, the problem raised by Popper was, and still is, a real one. In fact we show that the popular approaches in terms of natural deduction and analytic tableaux are unsatisfactory. Then we present a ...
Research Interests:
Research Interests:
The medical field has a requirement for ubiquitous computing with secure and reliable access control to permit patient information to be logged as they go about their normal activities or to permit medics to access patient information... more
The medical field has a requirement for ubiquitous computing with secure and reliable access control to permit patient information to be logged as they go about their normal activities or to permit medics to access patient information remotely from various mobile devices. Healthcare involves many different people from multiple organizations-general practitioner, hospital doctor or nurse, social workers-who all need different information. Defining the required authorization policies can be very complex, resulting in ...
Research Interests:
Web Services technologies are now an active research area. By integrating individual existing web systems the technology enables the provision of advanced and sophisticated services, such as allowing users to use different types of... more
Web Services technologies are now an active research area. By integrating individual existing web systems the technology enables the provision of advanced and sophisticated services, such as allowing users to use different types of resources and services simultaneously in a simple procedure. However the management and maintenance of a large number of Web Services is not easy and, in particular, needs appropriate authorization policies to be defined so as to realize reliable and secure Web Services. The ...