3658 search results - page 344 / 732 » The logic of proofs, semantically |
166
Voted
AML
2002
15 years 6 months ago
2002
Abstract. It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbe...
167
click to vote
IGPL
2010
15 years 5 months ago
2010
The main contribution of this paper is a (strong) completeness result for an axiomatization of Hansson [13]’s deontic system DSDL2, whose semantics involves a non-necessarily tr...
157
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
202
Voted
COMPSAC
2009
IEEE
15 years 8 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
149
Voted
RTSS
2005
IEEE
16 years 13 days ago
2005
IEEE
The periodic resource model for hierarchical, compositional scheduling abstracts task groups by resource requirements. We study this model in the presence of dataflow constraints...