SAT Encoding of Unification in $\mathcal{EL}$
From MaRDI portal
Publication:4933298
DOI10.1007/978-3-642-16242-8_8zbMath1306.68181OpenAlexW1805108069MaRDI QIDQ4933298
Franz Baader, Barbara Morawska
Publication date: 12 October 2010
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_8
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Related Items (4)
Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor ⋮ KD is nullary ⋮ Extending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification ⋮ Unification in the Description Logic $\mathcal{EL}$ without the Top Concept
This page was built for publication: SAT Encoding of Unification in $\mathcal{EL}$
