a recent difficult question of interest to the group by GB has possibly led to verification of a new graph property by dspyz, by use of Answer Set Programming/ASP. via sophisticated logic principles/algorithms remarkably this software can verify a complex property of graphs apparently without enumerating all isomorphisms. there does not seem to be much prior ref to this software & logic/theorem proving research on tcs.se.
looking for notable papers that use ASP from a TCS pov to investigate important problems in the area.
even better would be anything that relates it to inductive proofs of graph properties in automated theorem proving. (some misc refs [2-4] to the software utilized are included below.)
 Transitive feedback arc set (TFAS): NP-complete?
 Potassco: The Potsdam Answer Set Solving Collection Gebser et al
 ASP tools users guide Gebser et al
 techniques or examples of analyzing a series of graphs, tcs.se