Alessandra Russo

Alessandra Russo

Auto-generated profile, based on publicly available information

Alessandra Russo

Imperial College London

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2016 in Theory and Practice of Logic Programming
Verified
Journal Article
Open access
PDF file
MLMark Law
Mark Law
ARAlessandra Russo
Alessandra Russo
KBKrysia Broda
Krysia Broda
In recent years, several frameworks and systems have been proposed that extend Inductive Logic Programming (ILP) to the Answer Set Programming (ASP) paradigm. In ILP, examples must all be explained by a hypothesis together with a given background knowledge. In existing systems, the background knowledge is the same for all examples; however, examples may be context-dependent. This means that some examples should be explained in the context of some information, whereas others should be explained in different contexts. In this paper, we capture this notion and present a context-dependent extension of theLearning from Ordered Answer Setsframework. In this extension, contexts can be used to further structure the background knowledge. We then propose a new iterative algorithm, ILASP2i, which exploits this feature to scale up the existing ILASP2 system to learning tasks with large numbers of examples. We demonstrate the gain in scalability by applying both algorithms to various learning tasks. Our results show that, compared to ILASP2, the newly proposed ILASP2i system can be two orders of magnitude faster and use two orders of magnitude less memory, whilst preserving the same average accuracy.

7 April 2022 in Machine Learning
Verified
Journal Article
Open access
PDF file
LMLudovico Mitchener
Ludovico Mitchener
DTDavid Tuckey
David Tuckey
MCMatthew Crosby
Matthew Crosby
ARAlessandra Russo
Alessandra Russo
In this paper we introduce Detect, Understand, Act (DUA), a neuro-symbolic reinforcement learning framework. The Detect component is composed of a traditional computer vision object detector and tracker. The Act component houses a set of options, high-level actions enacted by pre-trained deep reinforcement learning (DRL) policies. The Understand component provides a novel answer set programming (ASP) paradigm for symbolically implementing a meta-policy over options and effectively learning it using inductive logic programming (ILP). We evaluate our framework on the Animal-AI (AAI) competition testbed, a set of physical cognitive reasoning problems. Given a set of pre-trained DRL policies, DUA requires only a few examples to learn a meta-policy that allows it to improve the state-of-the-art on multiple of the most challenging categories from the testbed. DUA constitutes the first holistic hybrid integration of computer vision, ILP and DRL applied to an AAI-like environment and sets the foundations for further use of ILP in complex DRL challenges.

1 July 2015 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
MLMark Law
Mark Law
ARAlessandra Russo
Alessandra Russo
KBKrysia Broda
Krysia Broda
This paper contributes to the area of inductive logic programming by presenting a new learning framework that allows the learning of weak constraints in Answer Set Programming (ASP). The framework, calledLearning from Ordered Answer Sets, generalises our previous work on learning ASP programs without weak constraints, by considering a new notion of examples asorderedpairs of partial answer sets that exemplify which answer sets of a learned hypothesis (together with a given background knowledge) arepreferredto others. In this new learning task inductive solutions are searched within a hypothesis space of normal rules, choice rules, and hard and weak constraints. We propose a new algorithm, ILASP2, which is sound and complete with respect to our new learning framework. We investigate its applicability to learning preferences in an interview scheduling problem and also demonstrate that when restricted to the task of learning ASP programs without weak constraints, ILASP2 can be much more efficient than our previously proposed system.

13 September 2019
Verified
Book Chapter
Closed access
PDF file
MLMark Law
Mark Law
ARAlessandra Russo
Alessandra Russo
KBKrysia Broda
Krysia Broda

1 October 1994 in Otolaryngology–Head and Neck Surgery
Verified
Journal Article
Closed access
YCYasar Cokkeser
Yasar Cokkeser
MNMaged Naguib
Maged Naguib
MAMiguel A Aristegui
Miguel A Aristegui
ESEssam Saleh
Essam Saleh
MLMauro Landolfi
Mauro Landolfi
MSMario Sanna
Mario Sanna

1 July 2013 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
JMJiefei Ma
Jiefei Ma
FLFranck LE
Franck LE
DWDavid Wood
David Wood
ARAlessandra Russo
Alessandra Russo
JLJorge Lobo
Jorge Lobo
There is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (i) specified as action theories of fluents and actions; (ii) executed as collections of distributed state machines, where devices are abstracted as (input/output) automata that can exchange messages; and (iii) analysed using existing results on connecting causal theories and Answer Set Programming. Results on the application of our approach to different classes of network protocols are also presented.