Andrea De Domenico
YOU?
Author Swipe
View article: Unified correspondence, proof-theoretically
Unified correspondence, proof-theoretically Open
This dissertation explores the connections between labelled sequent calculi and display calculi, two foundational proof-theoretic frameworks that, despite differences in syntax, structural constraints, and historical motivations, are shown…
View article: Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space
Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space Open
We further develop the algebraic approach to input/output logic initiated in \cite{wollic22}, where subordination algebras and a family of their generalizations were proposed as a semantic environment of various input/output logics. In par…
View article: Obligations and permissions, algebraically
Obligations and permissions, algebraically Open
We further develop the algebraic approach to input/output logic initiated in \cite{wollic22}, where subordination algebras and a family of their generalizations were proposed as a semantic environment of various input/output logics. In par…
View article: Obligations and permissions on selfextensional logics
Obligations and permissions on selfextensional logics Open
We further develop the abstract algebraic logic approach to input/output logic initiated in \cite{wollic22}, where the family of selfextensional logics was proposed as a general background environment for input/output logics. In this paper…
View article: The Decision Problem for Undirected Graphs with Reachability and Acyclicity
The Decision Problem for Undirected Graphs with Reachability and Acyclicity Open
View article: A Meta-Learning Algorithm for Interrogative Agendas
A Meta-Learning Algorithm for Interrogative Agendas Open
Explainability is a key challenge and a major research theme in AI research for developing intelligent systems that are capable of working with humans more effectively. An obvious choice in developing explainable intelligent systems relies…
View article: Subordination Algebras as Semantic Environment of Input/Output Logic
Subordination Algebras as Semantic Environment of Input/Output Logic Open
We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical f…
View article: Algorithmic correspondence and analytic rules
Algorithmic correspondence and analytic rules Open
We introduce the algorithm MASSA which takes classical modal formulas in input, and, when successful, effectively generates: (a) (analytic) geometric rules of the labelled calculus G3K, and (b) cut-free derivations (of a certain `canonical…
View article: Unified inverse correspondence for DLE-Logics
Unified inverse correspondence for DLE-Logics Open
By exploiting the algebraic and order theoretic mechanisms behind Sahlqvist correspondence, the theory of unified correspondence provides powerful tools for correspondence and canonicity across different semantics and signatures, covering …
View article: Modal reduction principles across relational semantics
Modal reduction principles across relational semantics Open
The present paper establishes systematic connections among the first-order correspondents of Sahlqvist modal reduction principles in various relational semantic settings which include crisp and many-valued Kripke frames, and crisp and many…
View article: Subordination Algebras as Semantic Environment of Input/Output Logic
Subordination Algebras as Semantic Environment of Input/Output Logic Open
View article: Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae
Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae Open
As a contribution to quantitative set-theoretic inferencing, a translation is proposed of conjunctions of literals of the forms $x=y\setminus z$, $x \neq y\setminus z$, and $z =\{x\}$, where $x,y,z$ stand for variables ranging over the von…
View article: On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework
On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework Open
The Satisfiability Modulo Theories (SMT) issue concerns the satisfiability of formulae from multiple background theories, usually expressed in the language of first-order predicate logic with equality. SMT solvers are often based on varian…
View article: Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* Open
We report on an investigation aimed at identifying small fragments of set theory (typically, sublanguages of Multi-Level Syllogistic) endowed with polynomial-time satisfiability decision tests, potentially useful for automated proof verifi…
View article: A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF Open
A translation is proposed of conjunctions of literals of the
\nforms x = y z, x /= y z, and x ∈ y, where x, y, z stand for variables
\nranging over the von Neumann universe of sets, into unquantified Boolean
\nformulae of a rather simple c…