Sciweavers

4401 search results - page 175 / 881
» Computing with Default Logic
Sort
View
BIRTHDAY
2010
Springer
15 years 5 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
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...
Martin Grohe
ERSHOV
2003
Springer
15 years 9 months ago
A Relational Algebra for Functional Logic Deductive Databases
Jesús Manuel Almendros-Jiménez, Anto...
RELMICS
2009
Springer
15 years 8 months ago
Towards Algebraic Separation Logic
Han-Hing Dang, Peter Höfner, Bernhard Mö...
FOSSACS
2010
Springer
15 years 11 months ago
Coalgebraic Correspondence Theory
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
Lutz Schröder, Dirk Pattinson