831 search results - page 42 / 167 » Coalgebraic Correspondence Theory |
CSL
2005
Springer
14 years 29 days ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
ECCV
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...