A5036361163- Logic, Reasoning, and Knowledge
- Semantic Web and Ontologies
- Multi-Agent Systems and Negotiation
- Logic, programming, and type systems
- Advanced Database Systems and Queries
- Advanced Algebra and Logic
- Formal Methods in Verification
- AI-based Problem Solving and Planning
- Constraint Satisfaction and Optimization
- Natural Language Processing Techniques
- Model-Driven Software Engineering Techniques
- Software Testing and Debugging Techniques
- Robot Manipulation and Learning
- Modular Robots and Swarm Intelligence
- Transportation and Mobility Innovations
- Robotic Path Planning Algorithms
- Fault Detection and Control Systems
- Adversarial Robustness in Machine Learning
- Service-Oriented Architecture and Web Services
- Software Reliability and Analysis Research
- Auction Theory and Applications
University of Liverpool
2017-2022
Lancaster University
2022
University of Manchester
2011-2014
The advent of sophisticated robotics and AI technology makes sending humans into hazardous distant environments to carry out inspections increasingly avoidable. Being able send a robot, rather than human, nuclear facility or deep space is very appealing. However, building these robotic systems just the start we still need range verification validation tasks ensure that be deployed are as safe reliable possible. Based on our experience across three research innovation hubs within UK’s “Robots...
We study the complexity of ontology-mediated querying when ontologies are formulated in guarded fragment first-order logic (GF). Our general aim is to classify data on level where query evaluation w.r.t. an ontology O considered be PTime if all (unions conjunctive) queries can evaluated and coNP-hard at least one O. identify several large relevant fragments GF that enjoy a dichotomy between coNP, some them additionally admitting form counting. In fact, almost BioPortal repository fall into...
We study ontology-mediated querying in the case where ontologies are formulated guarded fragment of first-order logic (GF) or extensions thereof with counting and actual queries (unions of) conjunctive queries. Our aim is to classify data complexity Datalog rewritability query evaluation depending on ontology O , w.r.t. PT ime (resp. rewritable) if all can be evaluated rewritten into under ), co NP-hard at least one . identify several fragments GF that enjoy a dichotomy between...
In ontology-mediated querying with an expressive description logic L, two desirable properties of a TBox T are (1) being able to replace formulated in the Horn-fragment L without affecting answers conjunctive queries, and (2) that every query can be evaluated PTime w.r.t. T. We investigate which cases equivalent, finding answer depends on whether unique name assumption (UNA) is made, under consideration, nesting depth quantifiers TBox. also clarify relationship between evaluation UNA...
Horn description logics are syntactically defined fragments of standard that fall within the fragment first-order logic and for which ontology-mediated query answering is in PTime data complexity. They were independently introduced modal to capture intersection with logic. In this paper, we introduce model comparison games basic hornALC (corresponding logic) use them obtain an Ehrenfeucht-Fraïssé type definability result a van Benthem style expressive completeness hornALC. We also establish...
We present a bisimulation relation for neighbourhood spaces, generalisation of topological spaces. show that this notion, path preserving bisimulation, preserves formulas the spatial logic SLCS. then use preservation result to SLCS cannot express standard properties such as separation and connectedness. Furthermore, we compare with modal converse on graphs prove it coincides latter.
Abstract This paper presents an extension of the Predictive Runtime Verification (PRV) paradigm to consider multiple models System Under Analysis (SUA). We call this Multi-Model PRV. Typically, PRV attempts predict satisfaction or violation a property based on trace and (single) formal model SUA. However, contemporary node- component-based systems (e.g. robotic systems) may benefit from monitoring each component. show how approach can be applied in either centralised compositional way (where...
Model generation and minimal model is useful for fault analysis, verification of systems validation data models. Whereas classical propositional first-order logic several minimization approaches have been developed studied, non-classical the topic has much less studied. In this paper we introduce a calculus multi-modal K(m) extensions with axioms T B. The provides method to generate all only modal Herbrand models, each generated exactly once. A novelty non-standard complement splitting rule...
Horn description logics are syntactically defined fragments of standard that fall within the fragment first-order logic and for which ontology-mediated query answering is in PTime data complexity. They were independently introduced modal to capture intersection with logic. In this paper, we introduce model comparison games basic hornALC (corresponding logic) use them obtain an Ehrenfeucht-Fra\"iss\'e type definability result a van Benthem style expressive completeness hornALC. We also...
This paper analyses models of a spatial logic with path operators based on the class neighbourhood spaces, also called pretopological or closure generalisation topological spaces. For this purpose, we distinguish two dimensions: type spaces which are built, and allowed paths. investigate general subclass quasi-discrete closely resemble graphs. paths, analyse cases consist an enumeration points, unit interval. We show that admits finite over both Finally, prove for does not have model property, either