By naming graphs, it appears that an inexpressive, conjunctive concept logic, F L 0 , can be employed to handle a wide variety of more complex phenomena including Booleans and hypotheticals.
one should not assume that the inferential tractability of F L 0 carries across to a system that combines it with named graphs.