http://biblioteca.universia.net/vernivel.do?start=300&nivel=11 Mostrando recursos 301 - 320 de 88,631 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=41678376 This paper aims at supporting the same idea. Our justification of the claim is, however, quite different from the one envisaged by Girard. The latter, cf. [11], is proof-theoretic in nature. Firstly, every sequent of classical, resp., intuitionistic, logic is translated into a sequent of commutative linear logic with exponentials. Then one shows that the former can be proved classically, resp., intuitionistically, iff its translation can be proved linearly. Here it is shown that every theory ... Marek A. Bednarczyk http://biblioteca.universia.net/ficha.do?id=41454934 . This paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. The logic is shown to be sound, complete and decidable. Moreover, it is illustrated how this logic can be applied to automatize some parts of the reasoning when proving the partial correctness of a logic program. 1 Introduction A number of properties of substitutions have been identified as crucial when analyzing the run-time behaviour of logic programs. The... Elena Marchiori http://biblioteca.universia.net/ficha.do?id=41869240 When we work with information from multiple sources, the formats of the knowledge bases may not be uniform. It would be desirable to be able to combine a knowledge base of default rules with one containing autoepistemic formulas. Previous works on relating default logic and autoepistemic logic mostly impose some constraints on autoepistemic logic, and thus are not suitable for combining the two logics. We first present a fixed point formulation of autoepistemic logic analogous to that of defa... Choh Man Teng http://biblioteca.universia.net/ficha.do?id=46254222 . In solving a query, the SLD proof procedure for definite programs sometimes searches an infinite space for a non existing solution. For example, querying a planner for an unreachable goal state. Such programs motivate the development of methods to prove the absence of a solution. Considering the definite program and the query / Q as clauses of a first order theory, one can apply model generators which search for a finite interpretation in which the program clauses as well as the clau... Maurice Bruynooghe; Henk Vandecasteele; D. Andre De Waal; Marc Denecker; Marc http://biblioteca.universia.net/ficha.do?id=46306036 This paper introduces a new logic transformation that integrates retiming with algebraic and Boolean transformations at the technology-independent level. It offers an additional degree of freedom in sequential network optimization resulting from implicit retiming across logic blocks and fanout stems. The application of this transformation to sequential network synthesis results in the optimization of logic across register boundaries. We have implemented our new technique within the SIS frame... S. Bommu; M. Ciesielski; N. O'Neill; P. Kalla http://biblioteca.universia.net/ficha.do?id=46465830 This report investigates the question of the universality of classical logic. The approach is to show that an almost arbitrary logical system can be translated reasonably intuitively and almost automatically into classical logic. The path leading to this result goes through the analysis of what is a reasonable logic, how to find semantics for it, how to build a labelled deductive system (LDS) for it, how to translate a LDS into classical logic and how to automate the process using SCAN. ... Im Stadtwald; Dov M. Gabbay; Dov M Gabbay http://biblioteca.universia.net/ficha.do?id=46617043 Logic programming allows to explore the full potential of parallelism in the programs in a transparent manner. Several systems were developed to explore the implicit parallelism of logic programs. The development of these systems brings some hard problems such as parallel debugging and dynamic distribution of varied sized work among processors. This paper describes VisAll, a new tool to visualise the parallel execution of logic programs, whose main objective is to help users to develop parall... Nuno Fonseca; Vítor Santos Costa; Inês de Castro Dutra; Costa Ines; Castro Dutra http://biblioteca.universia.net/ficha.do?id=46891176 Methods for dealing with a Horn logic program and one goal are well-known and successful. Here we are concerned with treating logic programs enhanced by some negative literals using the same methods, in particular SLD-resolution. We describe the approach and show its correctness. The result can be applied to default reasoning and has some relevance for model elimination based theorem proving. Keywords: logic programming, default reasoning, model elimination, theorem proving 1 Introduction T... Grigoris Antoniou; Elmar Langetepe http://biblioteca.universia.net/ficha.do?id=46903056 We describe LC , a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic language) provides a simpler operational model that can lead to a more practical language core. The LC fragment is proveded to be an abstract logic programming language, that is any sequent can be derived by uniform proofs. The resulting class of computations can be viewed in terms of multiset rewriting and i... Paolo Volpe http://biblioteca.universia.net/ficha.do?id=47336748 Abstract. In this paper, we develop a theory of the integration of fibring neural networks (a generalization of conventional neural networks) into model-theoretic semantics for logic programming. We present some ideas and results about the approximate computation by fibring neural networks of semantic immediate consequence operators TP and TP, where TP denotes a generalization of TP relative to a many-valued logic analogous to Kleene’s strong logic. We establish a minimalfixed-point semantics... Vladimir Komendantsky; Anthony Seda http://biblioteca.universia.net/ficha.do?id=45669919 Reasoning with qualitative and quantitative uncertainty is required in some real-world applications [6]. However, current extensions to logic programming with uncertainty support representing and reasoning with either qualitative or quantitative uncertainty. In this paper we extend the language of Hybrid Probabilistic Logic programs [28, 25], originally introduced for reasoning with quantitative uncertainty, to support both qualitative and quantitative uncertainty. We propose to combine disju... Emad Saad http://biblioteca.universia.net/ficha.do?id=41683971 Logical frameworks for analysing the dynamics of information processing abound [4, 5, 8, 10, 12, 14, 20, 22]. Some of these frameworks focus on the dynamics of the interpretation process, some on the dynamics of the process of drawing inferences, and some do both of these. Formalisms galore, so it is felt that some conceptual streamlining would pay off. This paper is part of a larger scale enterprise to pursue the obvious parallel between information processing and imperative programming. We ... http://biblioteca.universia.net/ficha.do?id=46550392 The safety-critical nature of the application of knowledge-based systems to the field of medicine, demands the adoption of reliable engineering principles with a solid foundation for their construction. Logical languages with their inherent, precise notions of consistency, soundness and completeness offer such a foundation, thus promoting scrutinous engineering of medical knowledge. Moreover, logic techniques provide a powerful means for getting insight into the structure and meaning of medic... Peter Lucas http://biblioteca.universia.net/ficha.do?id=45686058 The safety-critical nature of the application of knowledge-based systems to the field of medicine, demands the adoption of reliable engineering principles with a solid foundation for their construction. Logical languages with their inherent, precise notions of consistency, soundness and completeness offer such a foundation, thus promoting scrutinous engineering of medical knowledge. Moreover, logic techniques provide a powerful means for getting insight into the structure and meaning of medic... Peter Lucas http://biblioteca.universia.net/ficha.do?id=47824775 Light linear logic (LLL) was introduced by Girard as a logical system capturing the class of polytime function within the proofs-as-programs approach. This paper deals with the denotational semantics of LLL: we introduce a variant of coherent spaces and prove that it is a sound model for this system, but not for usual linear logic. A simpler version of the model yields a sound semantics of Elementary linear logic, which is the analog of LLL for the class of Kalmar elementary functions. Patrick Baillot; Patrick Baillot; Patrick Baillot http://biblioteca.universia.net/ficha.do?id=41446591 Since hypotheses and their restrictions are critical for linear logic, we give here a formulation of natural deduction for intuitionistic logic with localized hypotheses, but not parameters. For this we need a notation for hypotheses which we call a context. Contexts Gamma ::= Delta j Gamma; u:A Here, "Delta" represents the empty context, and Gamma; u:A adds hypothesis ` A labelled u to Gamma. We assume that each label u occurs at most once in a context in order to avoid ambiguities. The main... http://biblioteca.universia.net/ficha.do?id=41532474 Since hypotheses and their restrictions are critical for linear logic, we give here a formulation of natural deduction for intuitionistic logic with localized hypotheses, but not parameters. For this we need a notation for hypotheses which we call a context. Contexts Gamma ::= Delta j Gamma; u:A Here, "Delta" represents the empty context, and Gamma; u:A adds hypothesis ` A labelled u to Gamma. We assume that each label u occurs at most once in a context in order to avoid ambiguities. The main... http://biblioteca.universia.net/ficha.do?id=41557852 Since hypotheses and their restrictions are critical for linear logic, we give here a formulation of natural deduction for intuitionistic logic with localized hypotheses, but not parameters. For this we need a notation for hypotheses which we call a context. Contexts Gamma ::= Delta j Gamma; u:A Here, "Delta" represents the empty context, and Gamma; u:A adds hypothesis ` A labelled u to Gamma. We assume that each label u occurs at most once in a context in order to avoid ambiguities. The main... http://biblioteca.universia.net/ficha.do?id=41641640 Since hypotheses and their restrictions are critical for linear logic, we give here a formulation of natural deduction for intuitionistic logic with localized hypotheses, but not parameters. For this we need a notation for hypotheses which we call a context. Contexts Gamma ::= Delta j Gamma; u:A Here, "Delta" represents the empty context, and Gamma; u:A adds hypothesis ` A labelled u to Gamma. We assume that each label u occurs at most once in a context in order to avoid ambiguities. The main... http://biblioteca.universia.net/ficha.do?id=41651326 Since hypotheses and their restrictions are critical for linear logic, we give here a formulation of natural deduction for intuitionistic logic with localized hypotheses, but not parameters. For this we need a notation for hypotheses which we call a context. Contexts Gamma ::= Delta j Gamma; u:A Here, "Delta" represents the empty context, and Gamma; u:A adds hypothesis ` A labelled u to Gamma. We assume that each label u occurs at most once in a context in order to avoid ambiguities. The main...