Papers by Viorica Sofronie-Stokkermans
Description Logics, 2020
We address the problem of finding high-level explanations for concept subsumption w.r.t. combinat... more We address the problem of finding high-level explanations for concept subsumption w.r.t. combinations of EL (resp. EL) CBoxes. Our goal is to find explanations for concept subsumptions in such combinations of CBoxes which contain only symbols (concept names and role names) that are common to the CBoxes. For this, we use the encoding of TBox subsumption as a uniform word problem in classes of semilattices with monotone operators for EL and the ≤-interpolation property in these classes of algebras, as well as extensions to these results in the presence of role inclusions. For computing the ≤-interpolating terms we use a translation to propositional logic and methods for computing Craig interpolants in propositional logic.
Bookmarks Related papers MentionsView impact
arXiv (Cornell University), Jul 17, 2023
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2004
Bookmarks Related papers MentionsView impact
Description Logics, 2020
Bookmarks Related papers MentionsView impact
Dagstuhl Reports, 2017
This report documents the program and the outcomes of Dagstuhl Seminar 17371 "Deduction Beyo... more This report documents the program and the outcomes of Dagstuhl Seminar 17371 "Deduction Beyond First-Order Logic." Much research in the past two decades was dedicated to automating first-order logic with equality. However, applications often need reasoning beyond this logic. This includes genuinely higher-order reasoning, reasoning in theories that are not finitely axiomatisable in first-order logic (such as those including transitive closure operators or standard arithmetic on integers or reals), or reasoning by mathematical induction. Other practical problems need a mixture of first-order proof search and some more advanced reasoning (for instance, about higher-order formulas), or simply higher-level reasoning steps. The aim of the seminar was to bring together first-order automated reasoning experts and researchers working on deduction methods and tools that go beyond first-order logic. The seminar was dedicated to the exchange of ideas to facilitate the transition from first-order to more expressive settings
Bookmarks Related papers MentionsView impact
Springer eBooks, Nov 12, 2007
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Eatcs, 1989
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2014
In this paper, we build upon our previous work in which we used constrained clauses in order to f... more In this paper, we build upon our previous work in which we used constrained clauses in order to finitely represent infinite sets of clauses and proved that constrained axiomatizations are local if they are saturated under a version of resolution. We extend this result by identifying situations in which locality of saturated axiomatizations is maintained if we enrich the base theory by introducing new predicates (often reachability predicates) instead of using constraints for these properties.
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 1999
... 1 ×···×XM n to every relation symbol R of arity X1 ×···×Xn and an arrow fM : XM 1 ×···×XM n →... more ... 1 ×···×XM n to every relation symbol R of arity X1 ×···×Xn and an arrow fM : XM 1 ×···×XM n → Y M in Sh(I) to every function symbol f with ... the colimit of the diagram defined by U. Proof : (Idea) The fact that BT is a sheaf follows from the definition of BT and the fact that St, Pa, and Tr ...
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
The main goal of this paper is to show that the Priestley duality for SHn-algebras can help to es... more The main goal of this paper is to show that the Priestley duality for SHn-algebras can help to establish a link between the algebraic and Kripke-style semantics for SHn- logics. We present a Priestley duality theorem for SHn-algebras, and note that the dual space of an SHn-algebra satis es in particular the properties of a Kripke model for SHn-logics. We then show that Priestley duality can help in proving the soundness and completeness of SHn-logics with respect to the class of SHn-frames in a direct way, by using only soundness and completeness of SHn-logics with respect to the variety of SHn-algebras.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Software Model Checking is emerging as one of the leading approaches to automatic program analysi... more Software Model Checking is emerging as one of the leading approaches to automatic program analysis. State-of-the-art software model checkers exhibit levels of automation and precision often superior to those provided by traditional software analysis tools. This success is due to a large extent to the use of Satisfiability Modulo Theory (SMT) solvers to support reasoning about complex and even infinite data structures (e.g. bit-vectors, numeric data, arrays) manipulated by the program being analysed. In this talk I will survey the opportunities and challenges posed to Automated Reasoning by this new application domain. 2 Alessandro Armando
Bookmarks Related papers MentionsView impact
Journal of Symbolic Computation, 2010
Bookmarks Related papers MentionsView impact
Uploads
Papers by Viorica Sofronie-Stokkermans