http://biblioteca.universia.net/vernivel.do?start=280&nivel=11 Mostrando recursos 281 - 300 de 88,633 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=41911170 Introduction The goal of a logic is to dene a consequence relation between a set of formulas and, in most cases, an individual formula A. This denition generally takes one of two forms. From a proof theoretic standpoint A is said to be a consequence of whenever there is a deduction of A from the set , viewed as a set of premises; from a model theoretic standpoint, A is said to be a consequence of whenever A holds in every model that satises each formula in . Although the detailed inferences s... John F. Horty http://biblioteca.universia.net/ficha.do?id=35523049 La diabetes mellitus es una patología relacionada con una deficiente regulación de la glucemia. El sistema biológico encargado de controlar la glucosa en sangre es de gran complejidad, y su modelización basada tanto en esquemas clásicos como en redes neuronales y algoritmos genéticos presenta serios inconvenientes. En este trabajo se presenta una modelización del sistema biológico regulador basada en lógica difusa. El modelo desarrollado está compuesto por diferentes módulos, cada uno de ello... Sánchez Romero, José Luis; Ruiz Fernández, Daniel; Ferrández Pastor, Francisco Javier; García Chamizo, Juan Manuel; Soriano Payá, Antonio http://biblioteca.universia.net/ficha.do?id=45643516 We address the design and implementation of visual paradigms for observing the execution of constraint logic programs, aiming at debugging, tuning and optimization, and teaching. We focus on the display of data in CLP executions, where representation for constrained variables and for the constrains themselves are seeked. Two tools, VIFID and TRIFID, exemplifying the devised depictions, have been implemented, and are used to showcase the usefulness of the visualizations developed. Manuel Carro; Manuel Hermenegildo http://biblioteca.universia.net/ficha.do?id=2077071 We investigate logical consequence in temporal logics in terms of logical consecutions, i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be ’correct’ in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logic LDTL, consisting of all formulas valid in the frame ? ??, ?, ? ? of all integer numbers, is the prime object o... Rybakov, V. V. http://biblioteca.universia.net/ficha.do?id=41578388 The traditional approach to automatic control is based on the assumption that an analytical model of the controlled process is available. A rule based control system does not require a classical mathematical description of the process, but consist of a set of If-Then rules as an experienced human operator might formulate his knowledge of the process in question. Thus we obtain not only a separation between the controller and a mathematical process model in the classical sense, but are also ab... http://biblioteca.universia.net/ficha.do?id=41722669 We present a logic programming language, which we call Proflog, with an operational semantics based on tableaus, and a denotational semantics based on supervaluations. We show the two agree. Negation is well-behaved, and semantic non-computability issues do not arise. This is accomplished essentially by dropping a domain closure requirement. The cost is that intuitions developed through the use of classical logic may need modification, though the system is still classical at a level once remo... http://biblioteca.universia.net/ficha.do?id=41827224 In 1977, Pnueli introduced to computer scientists a temporal logic for reasoning about concurrent programs. His logic was simple and elegant, based on the single temporal modality "forever", but it was not expressive enough to completely describe programs. Since then, a plethora of more expressive logics have been proposed, all with additional temporal modalities such as "next", "until", and "since". Here, a temporal logic is introduced based only on Pnueli's original modality "forever", but ... http://biblioteca.universia.net/ficha.do?id=41862010 eep impact on the development of logic as well as on the science of computing. It was the problem that led to Turing's world-famous paper that is generally recognised as laying the basis for the development of computing machinery. (In his paper Turing developed a mathematical model of a computer"; the paper was published in 1936 well before any (electronic) computer existed.) Hilbert wanted to construct a complete and consistent axiomatisation of logic. Godel showed that this was impossible,... http://biblioteca.universia.net/ficha.do?id=47388668 In this paper a decision system for a team, constituted by several robots is described. The system is distributed and uses logic to choose the most suitable action in order to accomplish a pre-determined goal. It also supports cooperation and machine learning. System For Multi-Robot; Miguel Arroz; Vasco Pires; Luis Custódio http://biblioteca.universia.net/ficha.do?id=400375 Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a model structure which is upward closed. Kremer (1997) has shown that the quantified propositional intuitionistic logic H\pi+ based on the class of all partial orders is recursively isomorphic to full second-order logic. He raised the question of whether th... Zach, Richard http://biblioteca.universia.net/ficha.do?id=389700 Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Goedel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to proof-theoretic, and hence, computational treatment, has been known. Such a system is presented here, based on previous work on hypersequent calculi for propositional Goedel logics by Avron. It is shown that the system is sou... Baaz, Matthias; Zach, Richard http://biblioteca.universia.net/ficha.do?id=47142048 Linear logic developed by J.-Y. Girard can be described as a logic of resources. There have been several proposals for logic programming language based on linear logic: LO, LinLog, ACL, Lolli, Lygon, and Forum. Lolli and Lygon are implemented as interpreter systems (on SML and λProlog for Lolli, on Prolog for Lygon). But, none of them have been implemented as a compiler system. This paper describes a compiler system of a linear logic programming language called LLP. New features of LLP with v... http://biblioteca.universia.net/ficha.do?id=41828779 . A proof-theoretic semantics based on linear logic is developed for committed-choice logic languages, represented here by Flat Concurrent Prolog. Several fragments of linear logic are used in order to provide for a suitable translation of guarded clauses clauses, with the committed-choiceconcurrency featurescaptured by the properties of linear logic provability rather than by some additional mechanism and without the need of using interleaving approach for de#ning concurrent behaviour. Linea... Jir Zlatuska http://biblioteca.universia.net/ficha.do?id=42113260 In this paper we study how to transform possibilistic logic extended with fuzzy constants and fuzzy quantifiers into the generalized annotated logic system proposed by Kifer and Subrahmanian in 1992. Specifically, the valuation in a possibilistic clause generates the annotation which will be attached to the head of the annotated clause. We also show how the inference rules of possibilistic logic extended with fuzzy constants can be translated in terms of the mechanisms provided by this annota... Peter Kullmann http://biblioteca.universia.net/ficha.do?id=45959808 Abstract. It is shown that propositional calculuses of both quantum and classical logics are noncategorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic is in addition to a Boolean algebra also modeled by a weakly distributive lattice. Both new models turn out to be non-orthomodular. We prove the soundness and completeness of the calculuses for the models. We also prove that all the operations in a... Mladen Pavičić; Norman D. Megill http://biblioteca.universia.net/ficha.do?id=594132 We describe a graph-theoretic syntax for self-referential formulas as well as a four-valued logic to include contradictory and independent formulas. We then explore the degree to which generalized truth tables can be realized in our theory, and go on to describe a model theory for sentential calculus, wherein models are allowed to include contradictions (such as the ``Liar'') and formulas that result from them as an integral part of their structure. This sets the groundwork for a sequel in wh... Seabold, Dan; Waner, Stefan; Warner, Steve http://biblioteca.universia.net/ficha.do?id=45858446 Deterministic logic BIST (DLBIST) is an attractive test strategy, since it combines advantages of deterministic external testing and pseudo-random LBIST. Unfortunately, previously published DLBIST methods are unsuited for large ICs, since computing time and memory consumption of the DLBIST synthesis algorithms increase exponentially, or at least cubically, with the circuit size. In this paper, we propose a novel DLBIST synthesis procedure that has nearly linear complexity in terms of both com... Hans-joachim Wunderlich http://biblioteca.universia.net/ficha.do?id=46339453 We study classes of programs, herein called unique supported-model classes, with the property that each program in the class has a unique supported model. Elsewhere, the authors examined these classes from the point of view of operators dened relative to certain three-valued logics. In this paper, we complement our earlier results by considering how unique supported-model classes t into the framework given by various classes of programs in several well-known approaches to semantics. Key... Pascal Hitzler; Anthony Karel Seda http://biblioteca.universia.net/ficha.do?id=47268678 Deterministic logic BIST (DLBIST) is an attractive test strategy, since it combines advantages of deterministic external testing and pseudo-random LBIST. Unfortunately, previously published DLBIST methods are unsuited for large ICs, since computing time and memory consumption of the DLBIST synthesis algorithms increase exponentially, or at least cubically, with the circuit size. In this paper, we propose a novel DLBIST synthesis procedure that has nearly linear complexity in terms of both com... Hans-joachim Wunderlich http://biblioteca.universia.net/ficha.do?id=45684056 Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of time, a fact that makes them unsuitable for certain types of applications. In this paper we introduce the new temporal logic programming language Cactus, which is based on a branching notion of time. In Cactus, the truth value of a predicate depends on a hidden time parameter which has a tree-like structure. As a re... P. Rondogiannis; M. Gergatsoulis; T. Panayiotopoulos