11 search results - page 1 / 3 » The Quest for a Logic Capturing PTIME |
LICS
2008
IEEE
14 years 5 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
CSL
2009
Springer
14 years 3 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
BIRTHDAY
2010
Springer
14 years 8 days ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
ECCC
2010
13 years 11 months ago
2010
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show t...