activity
20142026
most citedHow Easy it is to Know How: An Upper Bound for the Satisfiability Problem

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LO2026

Satisfiability for Knowing How over Linear Plans is NP-complete

Carlos Areces, Pablo Barceló, Valentin Cassano +3

We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics base…

cs.LO2025

Deontic Action Logics: A Modular Algebraic Perspective

Carlos Areces, Valentin Cassano, Pablo Castro +1

In a seminal work, K. Segerberg introduced a deontic logic called DAL to investigate normative reasoning over actions. DAL marked the beginning of a new area of research in Deontic…

cs.LO2023★ 1 cited

How Easy it is to Know How: An Upper Bound for the Satisfiability Problem

Carlos Areces, Valentin Cassano, Raul Fervari +2

We investigate the complexity of the satisfiability problem for a modal logic expressing `knowing how' assertions, related to an agent's abilities to achieve a certain goal. We tak…

cs.LO2019

An Algebraic Approach for Action Based Default Reasoning

Pablo F. Castro, Valentin Cassano, Raul Fervari +1

Often, we assume that an action is permitted simply because it is not explicitly forbidden; or, similarly, that an action is forbidden simply because it is not explicitly permitted…

cs.SE2014

Actions and Events in Concurrent Systems Design

Valentin Cassano, Thomas S. E. Maibaum

In this work, having in mind the construction of concurrent systems from components, we discuss the difference between actions and events. For this discussion, we propose an(other)…