We propose a framework for modelling and solving search problems using logic, and
describe a project whose goal is to produce practically effective, general purpose tools for …

The authors of [MT05] proposed a declarative constraint programming framework based on
classical logic extended with non-monotone inductive definitions. In the framework, a …

For those who are big fans of the fantastic complexity textbook by Daniel Bovet and Pierluigi
Crescenzi [BC93](and I myself certainly am), there is great news. The authors have made …

We prove a time hierarchy theorem for inverting functions computable in a slightly non-
uniform polynomial time. In particular, we prove that if there is a strongly one-way function …