2 citations · 4 across the 6 of their papers we have counts for
7 papers
User Guided Abductive Proof Generation for Answer Set Programming Queries (Extended Version)
Avishkar Mahajan, Martin Strecker, Meng Weng Wong
We present a method for generating possible proofs of a query with respect to a given Answer Set Programming (ASP) rule set using an abductive process where the space of abducibles…
Automating Defeasible Reasoning in Law
How Khang Lim, Avishkar Mahajan, Martin Strecker +1
The paper studies defeasible reasoning in rule-based systems, in particular about legal norms and contracts. We identify rule modifiers that specify how rules interact and how they…
On the Verification of Logically Decorated Graph Transformations
Jon Haël Brenas, Rachid Echahed, Martin Strecker
We address the problem of reasoning on graph transformations featuring actions such as \emph{addition} and \emph{deletion} of nodes and edges, node \emph{merging} and \emph{cloning…
Abstracting an operational semantics to finite automata
Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus +1
There is an apparent similarity between the descriptions of small-step operational semantics of imperative programs and the semantics of finite automata, so defining an abstraction…
SROIQsigma is decidable
Jon Haël Brenas, Rachid Echahed, Martin Strecker
We consider a dynamic extension of the description logic . This means that interpretations could evolve thanks to some actions such as addition and/or deletion of…
Formal verification of a proof procedure for the description logic ALC
Mohamed Chaabani, Mohamed Mezghiche, Martin Strecker
Description Logics (DLs) are a family of languages used for the representation and reasoning on the knowledge of an application domain, in a structured and formal manner. In order…