Automatic classification of the aesthetic content of a picture is one of the challenges in the emerging discipline of computational aesthetics. Any suitable solution must cope wit...
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
Michael Bauland, Martin Mundhenk, Thomas Schneider...