http://biblioteca.universia.net/vernivel.do?start=220&nivel=11 Mostrando recursos 221 - 240 de 88,631 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=46379407 Traditionally, logic circuits have been, and are still being implemented using Boolean logic. Although there has been a tremendous increase in the performance of the technology used to implement Boolean logic primitives, the underlying paradigm has remained unchanged over the years. Since the early 1960's there is a fundamentally more powerful alternative for Boolean logic available, called Threshold Logic (TL). Although implementations of TL gates have grown with the advances in te... Alexander Stokman http://biblioteca.universia.net/ficha.do?id=41784808 COMPUTATIONAL LOGIC Maria H. Napierala, Ph.D. Oregon Graduate Institute 1992 Supervising Professor: Richard B. Kieburtz This thesis resulted from the research on relating classical and constructive proofs. It is well known that constructive type theories constitute formal systems for constructive mathematics. In these theories the constructivity is implicit in the restriction to intuitionistic logic. This means that restrictions are placed both on the objects studied and on the methods of pro... Maria H. Napierala http://biblioteca.universia.net/ficha.do?id=47745729 Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation ... Grigoris Antoniou; David Billington; Guido Governatori; Michael J. Maher http://biblioteca.universia.net/ficha.do?id=41905210 A brief outline of the categorical characterisation of Girard's linear logic is given, analagous to the relationship between cartesian closed categories and typed -calculus. The linear structure amounts to a -autonomous category: a closed symmetric monoidal category G with finite products and a closed involution. Girard's exponential operator, ! , is a cotriple on G which carries the canonical comonoid structure on A with respect to cartesian product to a comonoid structure on !A with respect... R. A. G. Seely http://biblioteca.universia.net/ficha.do?id=41926060 This article describes the abstract model implicit in logic programming and compares it to the models used in conventional languages. A simple example in Prolog illustrates how programming in logic can provide a concise problem description while offering a very flexible framework to solve for unknowns. The last section of this article surveys the current fields of active research in the area of logic programming and concludes with a prognosis for the future of this method http://biblioteca.universia.net/ficha.do?id=46242487 In this paper we define computationally well-behaved versions of classical first-order logic and prove that the validity problem is decidable 1 . Keywords : first-order logic, decidability, relativization, mosaic, polyadic and counting quantifiers. 1Taming In [5], we developed a strategy for taming logics. The idea of taming can be described as follows. Let us assume that we have a well-investigated logic with some undesirable metalogical properties. An example is the incompleteness and un... Szabolcs Mikul As http://biblioteca.universia.net/ficha.do?id=46259120 Linear Logic is gaining momentum in computer science because it offers a unified framework and a common vocabulary for studying and analyzing different aspects of programming and computation. We focus here on models where computation is identified with proof search in the sequent system of Linear Logic. A proof normalization procedure, called "focusing", has been proposed to make the problem of proof search tractable. Correspondingly, there is a normalization procedure mapping formu... Jean-marc Andreoli; Tiziana Castagnetti; Remo Pareschi http://biblioteca.universia.net/ficha.do?id=41898209 By working constructively in the sense of geometric logic, topology can be hidden. This applies also to toposes as generalized topological spaces. 1 http://biblioteca.universia.net/ficha.do?id=46510745 We present an extension of Logic Programming (LP) which, in addition to ordinary LP clauses, also includes integrity constraints, explicit representation of disjunction in the bodies of clauses and in goals, and suspension of atoms as in concurrent logic languages. The resulting framework aims to unify Constraint Logic Programming (CLP), Abductive Logic Programming (ALP) and Semantic Query Optimisation (SQO) in deductive databases. We present a proof procedure for the new framework, simp... Robert A. Kowalski; Francesca Toni; Gerhard Wetzel http://biblioteca.universia.net/ficha.do?id=16068072 A presente dissertação é o resultado de uma investigação acerca da semântica para lógica deôntica standard. Restringindo-se à versão proposicional da mesma, o trabalho teve como principal objeto de estudo alguns textos do filósofo J. Hintikka, cuja proposta de semântica para lógica deôntica inclui a reinterpretação de uma noção importante da filosofia de I. Kant: a noção de Reino dos Fins. Kant também figura na proposta de Hintikka pela ilustração de um dos resultados de sua abordagem, a sabe... Gisele Dalva Secco http://biblioteca.universia.net/ficha.do?id=46201433 One of the ways to overcome traffic problems in large cities is through the development of an intelligent monitoring and control of traffic lights system. This paper addresses the design and implementation of an intelligent traffic lights controller based on fuzzy logic technology. A software has been developed to simulate the situation of an isolated traffic junction based on this technology. The software is highly graphical in nature and uses the Windows system. The software allows simulati... Tan Kok Khiang; Marzuki Khalid; Rubiyah Yusof; Universiti Teknologi Malaysia; Jalan Semarak http://biblioteca.universia.net/ficha.do?id=46221082 In this paper constructions leading to the formation of belief sets by agents are studied. The focus is on the situation when possible belief sets are built incrementally in stages. An infinite sequence of theories that represents such a process is called a reasoning trace. A set of reasoning traces describing all possible reasoning scenarios for the agent is called a reasoning frame. Default logic by Reiter is not powerful enough to represent reasoning frames. In the paper a generalization o... Joeri Engelfriet; V. Wiktor Marek; Jan Treur; Miroslaw Truszczynski http://biblioteca.universia.net/ficha.do?id=46310271 There have been several proposals for logic programming language based on linear logic: Lolli [8], Lygon [7], LO [3], LinLog [2], Forum [11], HACL [10]. In these languages, it is possible to create and consume resources dynamically as logical formulas. The e#cient handling of resource formulas is, therefore, an important issue in the implementation of these languages. Lolli, Lygon, and Forum are implemented as interpreter systems; Lolli is on SML and #Prolog, Lygon is on Prolog, Forum is on S... Mutsunori Banbara; Naoyuki Tamura http://biblioteca.universia.net/ficha.do?id=46311911 In general, an n-ary predicate (relation) describes the relationship among its arguments, and such that no argument has to be of a special mode. The unification and the resolution (SLDNF-resolution) do capture this state of affair. Hence, the aim of logic programming is in some point approximatively achieved if the system is able to automatically determine the descriptive mode of an n-ary predicate symbol with respect to a logic program. The descriptive mode of an n-ary predicate symbol... Ebénézer Ntienjem; Copyright C Fl Eb'en'ezer Ntienjem http://biblioteca.universia.net/ficha.do?id=46316092 . A dense temporal logic development method for the specification, refinement, composition and verification of reactive systems is introduced. A reactive system is specified by a pair consisting of a machine and a condition that indicate the valid computations of this machine. Compositionality is achieved by adding to each machine step whether it is a environment, system or communication step. Refinement can be expressed straightforward in the logic because the stutter problem is elegantly so... Antonio Cau http://biblioteca.universia.net/ficha.do?id=46483635 Linear Logic [Gir87] has been shown to incorporate a fragment suitable for representing P/T-nets and giving a semantics to the computations of such nets (e.g. [Bro89], [MOM89], [EW90]). This result is generalized to coloured nets. Furthermore a new kind of Petri nets is dened: Linear Logic Petri Nets (LLPN). These nets are used as an intuitive semantics to well-known and new high level net concepts. keywords: Linear Logic, Petri nets, object systems, concurrency 1 Introduction Petri net... Berndt Farwer http://biblioteca.universia.net/ficha.do?id=46692884 . Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear flow 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 result, ... Rondogiannis Gergatsoulis; P. Rondogiannis; M. Gergatsoulis; T. Panayiotopoulos http://biblioteca.universia.net/ficha.do?id=46848034 . Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear flow 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 result, ... P. Rondogiannis; M. Gergatsoulis; T. Panayiotopoulos http://biblioteca.universia.net/ficha.do?id=46871813 This paper proposes a specification language, Hybrid Projection Temporal Logic (HPTL), for the purpose of modelling, analyzing and verifying hybrid systems consisting of a non-trivial mixture of discrete and continuous components. The syntax and semantics of HPTL are presented, and some examples of hybrid systems are modelled with HPTL to illustrate the formalism. Keywords: Temporal logic, statecharts, X-machine, automaton, hybrid system. 1 Introduction Hybrid systems are systems that consi... Zhenhua Duan; Mike Holcombe http://biblioteca.universia.net/ficha.do?id=47125368 In recent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specified by term rewriting systems are translated into a standard hardware description language for simulation purposes. In this work we present our current investigation on the use of Rewriting-Logic, which is a more powerful theoretical framework than pure rewriting, for specification and verification of processor archit... Mauricio Ayala-Rincon Departamento; Carlos H. Llanos