32 search results - page 1 / 7 » Interpolation, Definability and Fixed Points in Interpretabi... |
AIML
1998
13 years 6 months ago
1998
In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolati...
CSL
2009
Springer
13 years 8 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
13 years 5 months 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...
LICS
2010
IEEE
13 years 2 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
AGP
1993
IEEE
13 years 8 months ago
1993
IEEE
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...