http://biblioteca.universia.net/vernivel.do?start=100&nivel=11 Mostrando recursos 101 - 120 de 88,631 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=45880006 We reexamine the foundations of linear logic, developing a system of natural deduction following MartinL of's separation of judgments from propositions. Our construction yields a clean and elegant formulation that accounts for a rich set of multiplicative, additive, and exponential connectives, extending dual intuitionistic linear logic but differing from both classical linear logic and Hyland and de Paiva's full intuitionistic linear logic. We also provide a corresponding sequent ... Bor-Yuh Evan Chang; Kaustuv Chaudhuri; Frank Pfenning http://biblioteca.universia.net/ficha.do?id=46678906 We reexamine the foundations of linear logic, developing a system of natural deduction following MartinL of's separation of judgments from propositions. Our construction yields a clean and elegant formulation that accounts for a rich set of multiplicative, additive, and exponential connectives, extending dual intuitionistic linear logic but differing from both classical linear logic and Hyland and de Paiva's full intuitionistic linear logic. We also provide a corresponding sequent ... Bor-Yuh Evan Chang; Chang Kaustuv; Chaudhuri Frank Pfenning http://biblioteca.universia.net/ficha.do?id=45661243 We reexamine the foundations of linear logic, developing a system of natural deduction following Martin-L of's separation of judgments from propositions. Our construction yields a clean and elegant formulation that accounts for a rich set of multiplicative, additive, and exponential connectives, extending dual intuitionistic linear logic but differing from both classical linear logic and Hyland and de Paiva's full intuitionistic linear logic. We also provide a corresponding sequent ... Bor-Yuh Evan Chang; Kaustuv Chaudhuri; Frank Pfenning http://biblioteca.universia.net/ficha.do?id=20845816 We explore a connection between quantum logic and quantum computing. Dunn, J. Michael; Hagge, Tobias J.; Moss, Lawrence S.; Wang, Zhenghan http://biblioteca.universia.net/ficha.do?id=47118644 We reexamine the foundations of linear logic, developing a system of natural deduction following Martin-L of's separation of judgments from propositions. Our construction yields a clean and elegant formulation that accounts for a rich set of multiplicative, additive, and exponential connectives, extending dual intuitionistic linear logic but differing from both classical linear logic and Hyland and de Paiva's full intuitionistic linear logic. We also provide a corresponding sequent ... Bor-Yuh Evan Chang; Chang Kaustuv; Chaudhuri Frank Pfenning http://biblioteca.universia.net/ficha.do?id=21051641 This paper represents classical propositional proofs as *combinatorial proofs*, which are more abstract than proof nets: superposition (contraction/weakening) is modelled mathematically, as a lax form of fibration, rather than syntactically (as in proof nets, which involve contraction and weakening nodes). A combinatorial proof is a `fibred' multiplicative linear proof net, hence the slogan in the title. Cut elimination retains its richness from sequent calculus: its non-determinism does not ... Hughes, Dominic http://biblioteca.universia.net/ficha.do?id=41459054 this paper, section 3, is devoted to a fairly detailed exposition of Prior's basic tense logic; the aim of this is not only to introduce the readers to this particular system, but perhaps even more to acquaint them with the kind of questions that temporal logicians tend to ask. In the sections 4 and 5 we present some extensions and alternatives to this base system. In section 6 we sketch some developments that have taken place over the last ten years or so. Finally, in the epilogue we try to ... Yde Venema http://biblioteca.universia.net/ficha.do?id=41600782 this paper, section 3, is devoted to a fairly detailed exposition of Prior's basic tense logic; the aim of this is not only to introduce the readers to this particular system, but perhaps even more to acquaint them with the kind of questions that temporal logicians tend to ask. In the sections 4 and 5 we present some extensions and alternatives to this base system. In section 6 we sketch some developments that have taken place over the last ten years or so. Finally, in the epilogue we try to ... Yde Venema http://biblioteca.universia.net/ficha.do?id=45652312 This paper shows how logic programs can be used to implement the transition functions of denotational abstract interpretation. The logic variables express regularity in the abstract behaviour of commands. The technique has been applied to sign, class and escape analysis for object-oriented programs. We show that the time and space costs using logic programs for these analyses are smaller than those using a ground relational representation. Patricia M. Hill; Fausto Spoto http://biblioteca.universia.net/ficha.do?id=46306373 Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. In this paper we compare the expressive power of two approaches in this family of logics: Defeasible Logic, and sceptical LPwNF. Our results show that the former has a strictly stronger expressive power. The difference is caused by the latte... Antoniou Maher And; G. Antoniou; M. J. Maher; D. Billington http://biblioteca.universia.net/ficha.do?id=45424854 Design of a digital logic analyzer Vorhis, Gregory J. http://biblioteca.universia.net/ficha.do?id=44779761 In this paper we try to answer the following questions: What can be made by applying fuzzy logic? and What can not be made by applying fuzzy logic? The question will be analyzed from both a theoretical and an applied point of view. A (partial) answer will be given for three topics: a) as calculus procedure b) as reasoning mechanism and c) as engineering tool. Castro, J. L. http://biblioteca.universia.net/ficha.do?id=47156178 The specification of digital logic in SDL (Specification and Description Language) is investigated. A specification approach is proposed for multi-level descriptions of hardware behaviour and structure. The modelling method exploits features introduced in SDL-92. The approach also deals with the specification, analysis and simulation of timing aspects at any level in the specification of digital logic. Tadanori Mizuno; Norio Shiratori; Teruo Higashino; G. Csopaki A; K. J. Turner B http://biblioteca.universia.net/ficha.do?id=46320583 Auxiliary variables are essential for specifying programs in Hoare Logic. They are required to relate the value of variables in different states. However, the axioms and rules of Hoare Logic turn a blind eye to the rle of auxiliary variables. We stipulate a new structural rule for adjusting auxiliary variables when strengthening preconditions and weakening postconditions. Courtesy of this new rule, Hoare Logic is adaptation complete, which benefits software re-use. This property is responsibl... Thomas Kleymann http://biblioteca.universia.net/ficha.do?id=47142780 We reexamine the foundations of linear logic, developing a system of natural deduction following Martin-Löf’s separation of judgments from propositions. Our construction yields a clean and elegant formulation that accounts for a rich set of multiplicative, additive, and exponential connectives, extending dual intuitionistic linear logic but differing from both classical linear logic and Hyland and de Paiva’s full intuitionistic linear logic. We also provide a corresponding sequent calculus th... Bor-yuh Evan; Chang Kaustuv; Chaudhuri Frank Pfenning http://biblioteca.universia.net/ficha.do?id=47147893 Abstract: Auxiliary variables are essential for specifying programs in Hoare Logic. They are required to relate the value of variables in different states. However, the axioms and rules of Hoare Logic turn a blind eye to the rôle of auxiliary variables. We stipulate a new structural rule for adjusting auxiliary variables when strengthening preconditions and weakening postconditions. Courtesy of this new rule, Hoare Logic is adaptation complete, which benefits software re-use. This property is... Thomas Kleymann http://biblioteca.universia.net/ficha.do?id=47196264 We reexamine the foundations of linear logic, developing a system of natural deduction following Martin-Löf’s separation of judgments from propositions. Our construction yields a clean and elegant formulation that accounts for a rich set of multiplicative, additive, and exponential connectives, extending dual intuitionistic linear logic but differing from both classical linear logic and Hyland and de Paiva’s full intuitionistic linear logic. We also provide a corresponding sequent calculus th... Bor-yuh Evan; Chang Kaustuv; Chaudhuri Frank Pfenning http://biblioteca.universia.net/ficha.do?id=41901933 The experimental logic of Moore and Mealy type automata is investigated. key words: automaton logic; partition logic; comparison to quantum logic; intrinsic measurements 1 M. Schaller,K. Svozil http://biblioteca.universia.net/ficha.do?id=41571175 . 1 Introduction Mapping Tile Logic into Rewriting Logic meseguer@csl.sri.com ugo@di.unipi.it Jos'e Meseguer and Ugo Montanari Rewriting logic [27, 28, 31] extends to concurrent systems with state changes the body of theory developed within the algebraic semantics approach. It can also be Rewriting logic Tile logic membership equational logic 2 double 2VH-categories internal strategies uniform Metodi e Strumenti per la Progettazione e la Verifica di Sistemi Eterogenei Connessi mediante Reti d... http://biblioteca.universia.net/ficha.do?id=48026004 Abstract: The paper describes the implementation of a parallel graph narrowing machine. The machine implements a functional logic language on a shared memory multiprocessor. The model of parallelism uses an independence condition to decide which subexpressions of an expression can run in parallel. The outer expression continues its execution and the synchronization with a subtask is only performed when its result is needed. The machine is fully implemented and some experimental results are sh... Andres Pozo-prieto; Juan Jose Moreno-navarro