output
20002026
most citedSoftware development in startup companies: A systematic mapping study

416 citations

Showing cs.LOShow all

27 papers · 1 filter

cs.LO2026

Intuitionistic Monotone Modal Logic: Proof Theory and Semantics

Tiziano Dalmonte, Jim de Groot

We study the recently introduced intuitionistic monotone modal logic IM. We first provide a semantic characterisation for a family of natural extensions of IM in terms of construct…

cs.LO2025

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells

Luca Barbaro, Giovanni Varricchione, Marco Montali +1

In process management, effective behavior modeling is essential for understanding execution dynamics and identifying potential issues. Two complementary paradigms have emerged in t…

cs.LO2024

SMT-based Symbolic Model-Checking for Operator Precedence Languages

Michele Chiari, Luca Geatti, Nicola Gigante +1

Operator Precedence Languages (OPL) have been recently identified as a suitable formalism for model checking recursive procedural programs, thanks to their ability of modeling the…

cs.LO2023★ 1 cited

Minimal modal logics, constructive modal logics and their relations

Tiziano Dalmonte

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal l…

cs.LO2022

Careful Autonomous Agents in Environments With Multiple Common Resources

Rodica Condurache, Catalin Dima, Madalina Jitaru +2

Careful rational synthesis was defined in (Condurache et al. 2021) as a quantitative extension of Fisman et al.'s rational synthesis (Fisman et al. 2010), as a model of multi-agent…

cs.LO2021

On Free Description Logics with Definite Descriptions

Alessandro Artale, Andrea Mazzullo, Ana Ozaki +1

Definite descriptions are phrases of the form 'the such that ', used to refer to single entities in a context. They are often more meaningful to users than individual names…

cs.LO2021★ 2 cited

Resource separation in dynamic logic of propositional assignments

Joseph Boudou, Andreas Herzig, Nicolas Troquard

We extend dynamic logic of propositional assignments by adding an operator of parallel composition that is inspired by separation logics. We provide an axiomatisation via reduction…

cs.LO2020★ 1 cited

Interpolation and Amalgamation for Arrays with MaxDiff (Extended Version)

Silvio Ghilardi, Alessandro Gianola, Deepak Kapur

In this paper, the theory of McCarthy's extensional arrays enriched with a maxdiff operation (this operation returns the biggest index where two given arrays differ) is proposed. I…

cs.LO2020★ 13 cited

First-Order Rewritability of Ontology-Mediated Queries in Linear Temporal Logic

Alessandro Artale, Roman Kontchakov, Alisa Kovtunova +3

We investigate ontology-based data access to temporal data. We consider temporal ontologies given in linear temporal logic LTL interpreted over discrete time (Z,<). Queries are giv…

cs.LO2020★ 4 cited

Uniform Interpolants in EUF: Algorithms using DAG-representations

Silvio Ghilardi, Alessandro Gianola, Deepak Kapur

The concept of uniform interpolant for a quantifier-free formula from a given formula with a list of symbols, while well-known in the logic literature, has been unknown to the form…

cs.LO2019★ 2 cited

From DB-nets to Coloured Petri Nets with Priorities (Extended Version)

Marco Montali, Andrey Rivkin

The recently introduced formalism of DB-nets has brought in a new conceptual way of modelling complex dynamic systems that equally account for the process and data dimensions, cons…

cs.LO2018★ 1 cited

Cutting Diamonds: Temporal DLs with Probabilistic Distributions over Data

Alisa Kovtunova, Rafael Peñaloza

Recent work has studied a probabilistic extension of the temporal logic LTL that refines the eventuality (or diamond) constructor with a probability distribution on when will this…

cs.LO2018

Query Answering for Rough EL Ontologies (Extended Technical Report)

Rafael Peñaloza, Veronika Thost, Anni-Yasmin Turhan

Querying large datasets with incomplete and vague data is still a challenge. Ontology-based query answering extends standard database query answering by background knowledge from a…

cs.LO2018★ 11 cited

Verification of Data-Aware Processes via Array-Based Systems (Extended Version)

Diego Calvanese, Silvio Ghilardi, Alessandro Gianola +2

We study verification over a general model of artifact-centric systems, to assess (parameterized) safety properties irrespectively of the initial database instance. We view such ar…

cs.LO2018★ 2 cited

Consequence-Based Axiom Pinpointing

Ana Ozaki, Rafael Peñaloza

Axiom pinpointing refers to the problem of finding the axioms in an ontology that are relevant for understanding a given entailment or consequence. One approach for axiom pinpointi…

cs.LO2017★ 1 cited

Canonical Selection of Colimits

Till Mossakowski, Florian Rabe, Mihai Codescu

Colimits are a powerful tool for the combination of objects in a category. In the context of modeling and specification, they are used in the institution-independent semantics (1)…

cs.LO2017

Querying Log Data with Metric Temporal Logic (Technical Report)

Sebastian Brandt, Elem Güzel Kalaycı, Vladislav Ryzhikov +2

We propose a novel framework for ontology-based access to temporal log data using a datalog extension datalogMTL of a Horn fragment of the metric temporal logic MTL. We show that d…

cs.LO2016★ 27 cited

Horn Fragments of the Halpern-Shoham Interval Temporal Logic (Technical Report)

Davide Bresolin, Agi Kurucz, Emilio Muñoz-Velasco +3

We investigate the satisfiability problem for Horn fragments of the Halpern-Shoham interval temporal logic depending on the type (box or diamond) of the interval modal operators, t…

cs.LO2015

Well Structured Transition Systems with History

Parosh Abdulla, Giorgio Delzanno, Marco Montali

We propose a formal model of concurrent systems in which the history of a computation is explicitly represented as a collection of events that provide a view of a sequence of confi…

cs.LO2015

Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies

Stefan Borgwardt, Theofilos Mailis, Rafael Peñaloza +1

Fuzzy Description Logics (DLs) provide a means for representing vague knowledge about an application domain. In this paper, we study fuzzy extensions of conjunctive queries (CQs) o…

cs.LO2014★ 257 cited

The DL-Lite Family and Relations

Alessandro Artale, Diego Calvanese, Roman Kontchakov +1

The recently introduced series of description logics under the common moniker DL-Lite has attracted attention of the description logic and semantic web communities due to the low c…

cs.LO2013

The Complexity of Clausal Fragments of LTL

A. Artale, R. Kontchakov, V. Ryzhikov +1

We introduce and investigate a number of fragments of propo- sitional temporal logic LTL over the flow of time (Z, <). The fragments are defined in terms of the available temporal…

cs.LO2013★ 2 cited

Temporal Description Logic for Ontology-Based Data Access (Extended Version)

Alessandro Artale, Roman Kontchakov, Frank Wolter +1

Our aim is to investigate ontology-based data access over temporal data with validity time and ontologies capable of temporal conceptual modelling. To this end, we design a tempora…

cs.LO2012

A Cookbook for Temporal Conceptual Data Modelling with Description Logics

Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov +1

We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Li…