z-logo
open-access-imgOpen Access
Computing Minimal EL-Unifiers is Hard
Author(s) -
Franz Baader,
Stefan Borgwardt,
Barbara Morawska
Publication year - 2012
Publication title -
qucosa (saxon state and university library dresden)
Language(s) - English
Resource type - Reports
DOI - 10.25368/2022.187
Subject(s) - unification , context (archaeology) , computer science , theoretical computer science , modal logic , algorithm , discrete mathematics , modal , mathematics , algebra over a field , programming language , pure mathematics , paleontology , chemistry , polymer chemistry , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom