http://biblioteca.universia.net/vernivel.do?start=480&nivel=11 Mostrando recursos 481 - 500 de 88,632 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=47313944 Abstract — In this paper we present a TL specific synthesis tool that aims to exploit the specific characteristics of TL gates, especially the possibility to assign weights larger than one to TL gate inputs. Moreover, instead of confining network nodes with input fan-in restriction, we employ the sum of weights as constraint, as this is more relevant to the physical basis of TL implementations. To make a seamless concatenation with Boolean logic network access and synthesis, we embedded our p... Li Zhang; Sorin Cotofana http://biblioteca.universia.net/ficha.do?id=47315796 Abstract. Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often used for this purpose: linear and branching time models. In this paper a third approach, based on socalled joint closure models, is studied using models which incorporate all possible behaviour in one model. Relations between this approach and the other two are studied. In order to define constructions nee... Joeri Engelfriet; Jan Treur http://biblioteca.universia.net/ficha.do?id=45721908 In planning of the water structures, it is need some information about flow values. The identification of suitable generation models for future streamflows is an important precondition for successful planning and management of water resources, operation of flood control reservoirs, determination of flow potential in stream, forecasting of electric generation in hydroelectric power plants in drought periods, distribution of domestic and irrigation water and navigation in rivers. Flow predictio... M. Erol Keski̇n; Emine Dilek Taylan; A. Gökhan Yilmaz http://biblioteca.universia.net/ficha.do?id=41599822 The main concern of this paper is the design of a noetherian and confluent normalization for LK 2 (that is, classical second order predicate logic presented as a sequent calculus). The method we present is powerful: since it allows us to recover as fragments formalisms as seemingly different as Girard's LC and Parigot's ¯, FD ([10, 12, 29, 33]), delineates other viable systems as well, and gives means to extend the Krivine/Leivant paradigm of `programming-with-proofs' ([24, 25]) to classical ... Vincent Danos,Jean-baptiste Joinet,Harold Schellinx http://biblioteca.universia.net/ficha.do?id=41621615 The main concern of this paper is the design of a noetherian and confluent normalization for LK 2 (that is, classical second order predicate logic presented as a sequent calculus). The method we present is powerful: since it allows us to recover as fragments formalisms as seemingly different as Girard's LC and Parigot's ¯, FD ([10, 12, 29, 33]), delineates other viable systems as well, and gives means to extend the Krivine/Leivant paradigm of `programming-with-proofs' ([24, 25]) to classical ... Vincent Danos,Jean-baptiste Joinet,Harold Schellinx http://biblioteca.universia.net/ficha.do?id=41678872 The main concern of this paper is the design of a noetherian and confluent normalization for LK 2 (that is, classical second order predicate logic presented as a sequent calculus). The method we present is powerful: since it allows us to recover as fragments formalisms as seemingly different as Girard's LC and Parigot's , FD ([9, 11, 27, 31]), delineates other viable systems as well, and gives means to extend the Krivine/Leivant paradigm of `programming-with-proofs' ([22, 23]) to classical lo... Vincent Danos,Jean-baptiste Joinet,Harold Schellinx http://biblioteca.universia.net/ficha.do?id=45680066 Fuzzy logic is a theory with deep structure, which is flexible enough to cover properties of the natural language. The basic laws of classical logic are formulated with two logic values 0 and 1. This logic is named "boolean logic". In an opposite side is fuzzy logic, which is based on membership function. The basis to create this membership is to do some assumptions with some degrees of truth. The truth degree of the result is also derived. All the operations in the fuzzy se... http://biblioteca.universia.net/ficha.do?id=46561187 ] Logic programs provide many opportunities for parallel execution. Among different forms of parallelism found in logic programs, AND-parallelism and OR-parallelism have shown to be most effective in speeding up the execution of logic programs. Research in the exploitation of AND-parallelism, OR-parallelism alone and combined AND/OR-parallelism has led to the proposals and implementations of various execution models and working systems. This paper offers a review of major activities in exploi... Kang Zhang http://biblioteca.universia.net/ficha.do?id=46603462 Generating timetables is a cumbersome and time consuming task, but programs developed to solve them are usually meant for a particular organisation and can not be easily adapted. Constraint Logic Programming, the result of generalizing Logic Programming unification to constraint solving over a computation domain, aim at expressing constrained decision problems declaratively, and still solve them efficiently. DOMLOG is a CLP(FD) system, that extends CHIP with features such as user-defined heur... Francisco Azevedo; Pedro Barahona http://biblioteca.universia.net/ficha.do?id=46872253 In this paper we investigate relationships between top-down and bottomup approaches to computation with disjunctive logic programs (DLPs). The bottom-up calculus considered, hyper tableaux, is depicted in its ground version and its relation to fixed point approaches from the literature is investigated. For the top-down calculus we use restart model elimination (RME) and show as our main result that hyper tableaux provide a bottom-up semantics for it. This generalizes the well-known result lin... Peter Baumgartner; Ulrich Furbach http://biblioteca.universia.net/ficha.do?id=46267787 Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs typically fold using using a single, non-recursive clause i.e. the folding transformation is very restricted. In this paper we present a transformation system that permits folding in the presence of recursion, disjunction, as well as negation. We show that the transformations are correct with respect to various model theoretic semantic... Abhik Roychoudhury; K. Narayan Kumar; C. R. Ramakrishnan; I. V. Ramakrishnan http://biblioteca.universia.net/ficha.do?id=41452152 We present BFL, a hybrid logic for representing uncertain knowledge. BFL attaches a quantified notion of belief --- based on Dempster-Shafer's theory of belief functions --- to classical first-order logic. The language of BFL is composed of objects of the form F:[a,b], where F is a firstorder sentence, and a and b are numbers in the [0,1] interval (with ab). Intuitively, a measures the strength of our belief in the truth of F, and (1--b) that in its falseness. A number of properties of first-... Alessandro Saffiotti http://biblioteca.universia.net/ficha.do?id=41582615 A logic for specifying and reasoning about object classes and their instances (aspects) is presented and illustrated. This logic is an extension of a rather standard linear temporal, many-sorted, first-order predicate logic with equality. The extensions where designed to be as simple as possible while supporting the envisaged locality of arguments, object specialization and object aggregation. Objects are specified through their aspects. Each aspect establishes a local vocabulary (signature).... Cristina Sernadas http://biblioteca.universia.net/ficha.do?id=41689535 We present BFL, a hybrid logic for representing uncertain knowledge. BFL attaches a quantified notion of belief --- based on Dempster-Shafer's theory of belief functions --- to classical first-order logic. The language of BFL is composed of objects of the form F:[a,b], where F is a firstorder sentence, and a and b are numbers in the [0,1] interval (with ab). Intuitively, a measures the strength of our belief in the truth of F, and (1--b) that in its falseness. A number of properties of first-... Alessandro Saffiotti http://biblioteca.universia.net/ficha.do?id=41714073 In this article we propose contextual deontic logic (CDL). Contextual obligations are written as O(ffjfinfl), and are to be read as `ff should be the case if fi is the case, unless fl is the case'. The unless clause is analogous to the justification in Reiter's default rules. We show how contextual obligations can be used to solve certain aspects of contrary-to-duty paradoxes of dyadic deontic logic. 1 Contrary-to-duty reasoning In recent years several researchers have argued that deontic log... Yao-hua Tan http://biblioteca.universia.net/ficha.do?id=41738833 In this article we propose contextual deontic logic (CDL). Contextual obligations are written as O##j#n##, and are to be read as `# should be the case if # is the case, unless # is the case'. The unless clause is analogous to the justification in Reiter's default rules. We show how contextual obligations can be used to solve certain aspects of contrary-to-duty paradoxes of dyadic deontic logic. 1 Contrary-to-duty reasoning In recent years several researchers have argued that deontic logic is ... Yao-hua Tan http://biblioteca.universia.net/ficha.do?id=46393980 We begin with a review of intuitionistic non-commutative linear logic (INCLL), a refinement of linear logic with an inherent notion of order proposed by the authors in prior work. We then develop a logic programming interpretation for INCLL in two steps: (1) we give a system of ordered uniform derivations which is sound and complete with respect to INCLL, and (2) we present a model of resource consumption which removes non-determinism from ordered resource allocation during search for uniform... Jeff Polakow; Frank Pfenning http://biblioteca.universia.net/ficha.do?id=46918956 This paper considers the computational complexity of the disjunction and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A B , a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunction property, namely, there is a superexponential lower bound on the time required, given a ... Sam Buss; Grigori Mints http://biblioteca.universia.net/ficha.do?id=48055312 ABSTRACT. What characterizes human reasoning is the ability of dealing with incomplete information. Incomplete logic is developed for modeling incomplete knowledge. The most distinctive feature of incomplete logic is its semantics. This is an alternative presentation of partial semantics. In this paper, we will introduce the general notion of incomplete logic(ICL), compare it with partial logic, and give the resolution method for it. We will also show howICL can be applied to nonmonotonic rea... Taipei Taiwan http://biblioteca.universia.net/ficha.do?id=41743991 An overview of linear logic is given, including an extensive bibliography and a simple example of the close relationship between linear logic and computation. 1 Overview Linear logic, introduced by Girard [45], is a refinement of classical logic. Linear logic is sometimes described as resource sensitive because it provides an intrinsic and natural accounting of resources. This is indicated by the fact that in linear logic, two assumptions of a formula A are distinguished from a single assumpt...