Abstract: We present our work exploring algorithms for answering conjunctive RDF queries in the presence of RDFS ontologies under access control constraints. We study a setting where users have full access to the RDF graph by default, but explicit restrictions may forbid access to specific IRIs. Such restrictions affect both query evaluation and ontology-based inference: a restricted IRI cannot appear in query answers, nor can triples involving it contribute to reasoning or entailment. We introduce a family of query answering algorithms designed for this restricted reasoning framework and establish the soundness and completeness of five of them with respect to both RDFS semantics and access policies. Finally, we discuss our implementation and experimental evaluation, highlighting the trade-offs between the algorithms in terms of performance and reasoning behavior.