3658 search results - page 233 / 732 » The logic of proofs, semantically |
168
click to vote
AAAI
1990
15 years 7 months ago
1990
In this paper we present a purely semantic view on non-monotonic reasoning. We follow the direction pointed in [16] and claim that any non-monotonic logic can be viewed as a resul...
147
click to vote
ENTCS
2002
15 years 6 months ago
2002
We show that the category of coalgebras of a wide-pullback preserving endofunctor on a category of presheaves is itself a category of presheaves. This illustrates a connection bet...
246
click to vote
POPL
2001
ACM
16 years 7 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
286
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
170
click to vote
IJCAI
1993
15 years 8 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...