Open AccessThe Complexity of Finite Model Reasoning in Description Logics
Author(s) -
Carsten Lutz,
Ulrike Sattler,
Lidia Tendera
Publication year - 2002
Publication title -
qucosa (saxon state and university library dresden)
Language(s) - English
Resource type - Reports
DOI - 10.25368/2022.123
Subject(s) - description logic , consistency (knowledge bases) , satisfiability , automated reasoning , exptime , computer science , non monotonic logic , theoretical computer science , reasoning system , boolean satisfiability problem , inverse , mathematics , artificial intelligence , computational complexity theory , algorithm , geometry , pspace
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom