SAT Encoding of Unification in

F Baader, B Morawska - … Conference on Logic for Programming Artificial …, 2010 - Springer
… a new decision procedure for EL-unification that takes a given EL-unification problem Γ and
… optimized SAT-solver such as MiniSat2 to decide solvability of EL-unification problems. Our …

SAT Encoding of Unification in wrt Cycle-Restricted Ontologies

F Baader, S Borgwardt, B Morawska - International Joint Conference on …, 2012 - Springer
unification in EL is of considerably lower complexity: the decision problem is NP-complete.
The original unification algorithm for EL … a goaloriented unification algorithm for EL, in which …

[PDF][PDF] UEL: Unification solver for EL

F Baader, S Borgwardt, JA Mendez… - Proc. of the 25th Int …, 2012 - bia.unibz.it
… Finally, the paper [7] proposes a third algorithm, which encodes the unification problem into
… optimized SAT solver. Version 1.0. 0 of our system UEL2 used only the SAT translation to …

Unification in the description logic EL

F Baader, B Morawska - Logical Methods in Computer …, 2010 - lmcs.episciences.org
… that our results for EL-unification imply that unification modulo the equational … unification
type zero. More information about Description Logics can be found in [6], and about unification

Lifting congruence closure with free variables to λ-free higher-order logic via SAT encoding

S Tourret, P Fontaine, D El Ouraoui… - SMT 2020-18th …, 2020 - hal.science
… [3], we present below the definition of the E-ground (dis)unification problem in λfHOL and
the … since it can be directly encoded into FOL (eg by means of an applicative encoding). …

UEL: Unification Solver for the Description Logic–System Description

F Baader, J Mendez, B Morawska - International Joint Conference on …, 2012 - Springer
encodes the unification problem into a set of propositional clauses [4], and then solves it using
an existing highly optimized SAT … definitions and results for EL and unification in EL (see [7…

[PDF][PDF] Extending Unification in EL Towards General TBoxes.

F Baader, S Borgwardt, B Morawska - KR, 2012 - cdn.aaai.org
SAT solvers. In (Baader and Morawska 2010b) it was also shown that the approaches for
unification of EL… In the remainder of this section we will show that ELunification wrt cycle-…

[PDF][PDF] Unification in ELHR+ without the Top Concept modulo Cycle-Restricted Ontologies

F Baader, OF Gil - 2024 - lat.inf.tu-dresden.de
Unification in ℰℒ−⊤, ie, the fragment of ℰℒ in which the top constructor is disallowed,
was … Morawska, SAT encoding of unification in ℰℒℋℛ+ wrt cyclerestricted ontologies, in: …

SAT Encoding of Unification in ℇℒℋw. rt Cycle-Restricted Ontologies

F Baader, S Borgwardt, B Morawska - IJCAR, 2012 - openreview.net
… An NP unification algorithm for \(\mathcal{EL}\) based on a translation into propositional
satisfiability (SAT) has recently been presented. In this paper, we extend this SAT encoding in …

[PDF][PDF] Restricted Unification in the DL EL.

F Baader, M Rostamigiv - Description Logics, 2021 - ceur-ws.org
… bound k is assumed to be encoded in unary or binary. For binary encoding of k, the complexity
… We want to show that the same reductions from SAT as in the unrestricted setting can be …