z-logo
open-access-imgOpen Access
A PSPACE-algorithm for deciding ALCNIR+-satisfiability
Author(s) -
Ian Horrocks,
Ulrike Sattler,
Stephan Tobies
Publication year - 1998
Publication title -
qucosa (saxon state and university library dresden)
Language(s) - English
Resource type - Reports
DOI - 10.25368/2022.84
Subject(s) - correctness , pspace , satisfiability , basis (linear algebra) , algorithm , computer science , theoretical computer science , boolean satisfiability problem , transitive relation , mathematics , representation (politics) , conjecture , discrete mathematics , combinatorics , computational complexity theory , geometry , politics , political science , law

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