Logic programming with infinite sets Douglas CenzerJeffrey B RemmelVictor W. Marek OriginalPaper Pages: 309 - 339
Spines of random constraint satisfaction problems: definition and connection with computational complexity Gabriel IstrateStefan BoettcherAllon G. Percus OriginalPaper Pages: 353 - 372
Unrestricted vs restricted cut in a tableau method for Boolean circuits Matti JärvisaloTommi JunttilaIlkka Niemelä OriginalPaper Pages: 373 - 399