d abstract) T. Eiter G. Gottlob Y. Gurevich Institut fur Informatik Institut fur Informationssysteme EECS Department Universitat Gie en Technische Universitat Wien University of Mi...
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Br...
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...