Ontologies are used to describe information about concepts and links between them. Several efficient reasoners are available for query answering with ontologies. When information to be processed is imperfect or is subject to exception, common formalisms are not suitable anymore, that is why we propose the use of Answer Set Programming (ASP) that offers a better expressivity for ontologies. We take interest in the formal definition of query answering in ASP and we show that related implementations give interesting results both on traditional ontologies and with those containing exceptions. MOTS-CLÉS : Answer Set Programming, interrogation, ontologie.