Search Results for author:
Found 12 papers, 0 papers with code
Supervisory Control for Behavior Composition
We relate behavior composition, a synthesis task studied in AI, to supervisory control theory from the discrete event systems field.
Social planning for social HRI
Making a computational agent 'social' has implications for how it perceives itself and the environment in which it is situated, including the ability to recognise the behaviours of others.
Description Logic Knowledge and Action Bases
Description logic Knowledge and Action Bases (KAB) are a mechanism for providing both a semantically rich representation of the information on the domain of interest in terms of a description logic knowledge base and actions to change such information over time, possibly introducing new objects.
Situation Calculus for Synthesis of Manufacturing Controllers
Manufacturing is transitioning from a mass production model to a manufacturing as a service model in which manufacturing facilities 'bid' to produce products.
SMT-based Safety Verification of Parameterised Multi-Agent Systems
In this paper we study the verification of parameterised multi-agent systems (MASs), and in particular the task of verifying whether unwanted states, characterised as a given state formula, are reachable in a given MAS, i. e., whether the MAS is unsafe.
CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT (Extended Version)
Conformance checking is a key process mining task for comparing the expected behavior captured in a process model and the actual behavior recorded in a log.
Efficient Multi-agent Epistemic Planning: Teaching Planners About Nested Belief
Many AI applications involve the interaction of multiple autonomous agents, requiring those agents to reason about their own beliefs, as well as those of other agents.
Linear-Time Verification of Data-Aware Dynamic Systems with Arithmetic
Combined modeling and verification of dynamic systems and the data they operate on has gained momentum in AI and in several application domains.
Soundness of Data-Aware Processes with Arithmetic Conditions
The implementation is validated on a collection of examples from the literature, and on synthetic variants constructed from such examples.
Conformance Checking with Uncertainty via SMT (Extended Version)
Logs of real-life processes often feature uncertainty pertaining the recorded timestamps, data values, and/or events.
A Semantic Approach to Decidability in Epistemic Planning (Extended Version)
Finally, we show that two well-known epistemic planning systems based on action templates, when interpreted under the setting of knowledge, conform to the commutativity axiom, hence proving their decidability.
DELPHIC: Practical DEL Planning via Possibilities (Extended Version)
To substantiate this claim, we implement both approaches in ASP and we set up an experimental evaluation to compare DELPHIC with the traditional, Kripke-based approach.
