Research Lightning Talks

Talk by Aidan Bailey, Lucas Carr, Luke Slater

Location: APB 3027
Start: 27. June 2024 at 11:00 am
End: 27. June 2024 at 12:00 pm
Research group: Knowledge-Based Systems
Event series: Research Seminar Logic and AI
iCal

In this seminar session, three of our guest students will present their recent and ongoing research in three short talks.

1. Aidan Bailey will show two applications of ASP. On one hand, the generation of propositional formulas, and by extension knowledge bases, adhering to specified properties. On the other hand, graph drawing via placements of nodes and edges adhering to constraints and optimised on specific criteria promoting usability, understandability and aesthetics.

2. Lucas Carr will present an idea for a notion of defeasible implications in formal concept analysis, which is currently being developed. Formal concept analysis allows us to model hierarchies between concepts, where concepts are defined by a relation between objects which fall into the concept, and properties these objects share. A clear notion of implication exists within FCA, which can be loosely characterised as saying attributes X imply attributes Y, if every object with X also has Y. The focus of my work will be to try introduce a notion of defeasibility, which would enable us to say attributes X imply attributes Y within some frame of preference, or typicality. The motivation for this is to allow to recognise relations in data which do not strictly hold, but are still potentially useful.

3. Luke Slater will talk about knowledge compilation for ranking functions. Ranking functions are essential in various domains of defeasible reasoning, such as belief revision. These functions operate by dividing the space of Boolean valuations into a totally ordered partition, necessitating separate SAT solving steps for inference at each rank. This research aims to develop a method to compile a ranking function into a single structure, facilitating inference through a single query.