Hi Behrouz,
In general there is infinite number of queries you can ask the reasoner as you can use "and", "and-or", "that" or "not" connectors to built extremely complex queries, however, if we limit our selves to the tasks corresponding only to reasoning as a graph transformation process (as OWL/RL reasoners are tend to consider it), the original graph (we mean here RDF directed graph) that is formed from nodes and edges that correspond to concepts, instances, roles, attributes, values and datatypes, is transformed into "materialized" graph that contain all the possible edges formed (no new named node in this graph can be created as long as we are talking about OWL and DLsafe subset of SWRL). This graph can be represented as a set of sentences in CNL. In Fluent Editor you can access this materialized graph in a corresponding windows (Materialized Graph and SPARQL).
Is it what you were asking about?
Regards
Pawel