z-logo
open-access-imgOpen Access
PSpace Automata with Blocking for Description Logics
Author(s) -
Franz Baader,
Jan Hladík,
Rafael Peñaloza
Publication year - 2006
Publication title -
qucosa (saxon state and university library dresden)
Language(s) - English
Resource type - Reports
DOI - 10.25368/2022.157
Subject(s) - exptime , pspace , decidability , satisfiability , mathematics , discrete mathematics , boolean satisfiability problem , automaton , algorithm , upper and lower bounds , combinatorics , theoretical computer science , computer science , computational complexity theory , mathematical analysis

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