4217 search results - page 57 / 844 » Computational indistinguishability logic |
CADE
2008
Springer
14 years 12 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
COLING
2002
14 years 9 months ago
2002
The relative logical scope of multiple modifiers within NP is often semantically significant. This paper proposes a structurally based method for computing the relative scope of s...
IWINAC
2007
Springer
15 years 4 months ago
2007
Springer
We consider a notion of morphism of neural networks and develop its properties. We show how, given any definite logic program P, the least fixed point of the immediate consequenc...
BIRTHDAY
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
AI
2002
Springer
14 years 9 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...