This paper focuses on two aspects of piece resolution in backward chaining for conceptual graph rules 13]. First, as conceptual graphs admit a rst-order logic interpretation, inferences can be proven by classical theorem provers. Nevertheless, they do not use the notion of piece, which is a graph notion. So we deene piece resolution over a class of rst-order logical formulae: the logical rules....