z-logo
open-access-imgOpen Access
PSpace Reasoning for DLs with Qualifying Number Restrictions
Author(s) -
Stephan Tobies
Publication year - 1999
Publication title -
qucosa (saxon state and university library dresden)
Language(s) - English
Resource type - Reports
DOI - 10.25368/2022.96
Subject(s) - converse , decidability , pspace , satisfiability , space (punctuation) , computer science , boolean satisfiability problem , mathematics , theoretical computer science , discrete mathematics , calculus (dental) , algorithm , computational complexity theory , geometry , operating system , medicine , dentistry

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