http://biblioteca.universia.net/vernivel.do?start=400&nivel=11 Mostrando recursos 401 - 420 de 88,632 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=47451337 In this paper we study constructions leading to the formation of belief sets by agents. We focus on the situation when possible belief sets are built incrementally in stages. We call an infinite sequence of theories that represents such a process 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 we introduce a generalizati... Joeri Engelfriet; V. Wiktor; Marek Jan Treur http://biblioteca.universia.net/ficha.do?id=41502402 . In this paper we present a powerful uniform first-order framework for representing and reasoning with complex forms of default knowledge. This is achieved by extending first-order predicate logic with a new generalized quantifier, anchored in the quasi-probabilistic ranking measure paradigm [Weydert 94], which subsumes and refines the original, propositional notion of a default conditional [Delgrande 88, Weydert 91, Boutilier 94]. 1. INTRODUCTION In recent times, default conditionals interp... http://biblioteca.universia.net/ficha.do?id=41535733 Model [War87a] x x 16 Delphi [CA88] x x 17 Randomize Method [JAM88] x x 18 ORBIT [YN84] ? ? ? 19 VMHW model [VXDRS91] ? ? ? 20 VMBA model [VXDRS91] ? ? ? Table 2.1: Time complexity of operations in OR-parallel methods [Gup94]. A cross indicates constant time operation, a blank usually means linear time operation. IMPACT-NLI-1998-3 12 2 Parallel Logic Programming IMPACT by proper selection of algorithms. For example, instead of computing the factorial by multiplying consecutive increasing numb... http://biblioteca.universia.net/ficha.do?id=41569188 ion for unstructured CSPs. In SARA'92: Proceedings of the Symposium on Abstraction, Reformulation, and Approximation, pages 126--133, 1992. http://www.cs.utexas.edu/users/schrag/SARA.ps. [733] R. Schrag and D. Miranker. Abstraction and the CSP phase transition boundary. In SAIM'95: Proceedings of the 4th International Symposium on Artificial Intelligence and Mathematics, pages 126--133, 1995. http://www.cs.utexas.edu/users/schrag. [734] D. De Schreye and M. Bruynooghe. The compilation of forw... http://biblioteca.universia.net/ficha.do?id=41627116 ve three research programs available as part of the project by the end of 1997. The overall arrangement of the project will initially follow the Artifact-Centered Modeling framework I have developed [Sal95]. Within the framework, the two main points of interest will be (a) development of formal (logical) theories, and (b) implementations of computer-based tools. The first research program is developing a formal theory of product information, called the Axiomatic Information Model for Design (... http://biblioteca.universia.net/ficha.do?id=41634203 Semantic games are an important evaluation method for a wide range of logical languages, and are frequently resorted to when traditional methods do not easily apply. A case in point is a family of independence-friendly (IF) logics which allow regulation over information flow in formulas, and thus perfect information fails in the games associated with such formulas. This mechanism of imperfect information is studied in this paper. It is noted that imperfect information of players often gives r... http://biblioteca.universia.net/ficha.do?id=45834051 This paper describes background and design of a model free adaptive Fuzzy Logic Controller. Controller Error Scaling Factor adaptation uses principle of balancing Error and Change of Error actions. Adaptation proceeds only if prescribed set of conditions is satisfied. Controller Scaling Factor for Change of Output adaptation uses weighted average of correction from oscillation index and process steady state gain estimates. Interaction between Scaling Factor of Output adaptation and Scaling Fa... Willy K. Wojsznis; Dirk Thiele; John Gudaz http://biblioteca.universia.net/ficha.do?id=46242246 Dynamic First Order Logic (DFOL) results from interpreting quantification over a variable v as change of valuation over the v position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus for DFOL with explicit (simultaneous) binding, prove its soundness and completeness, and point out its relevance for programming with DFOL, for automated program analysis including loop invariant d... Jan van Eijck; Juan Heguiabehere; Breanndan O Nuallain http://biblioteca.universia.net/ficha.do?id=47118578 We present a forward sequent calculus for intuitionistic propositional linear logic (# , 1, 0, !) and a corresponding inverse-method search strategy. Our approach centres around resource management, inspired by similar approaches for backward-directed calculi such as top-down linear logic programming. Surprisingly, the resource management problems for the forward direction turn out to have a different character to those of the backward direction, arising for different connectives. Ou... Kaustuv Chaudhuri http://biblioteca.universia.net/ficha.do?id=47442381 Logical devices made from nano-scale magnets have many potential advantages – systems should be non-volatile, dense, low power, radiation hard, and could have a natural interface to MRAM. Initial work includes experimental demonstrations of logic gates and wires and theoretical studies that consider their power dissipation. This paper looks at power dissipation too, but also considers the circuitry needed to drive a computation. Initial results are very encouraging and indicate that clocked m... M. T. Niemier; X. S. Hu http://biblioteca.universia.net/ficha.do?id=48020306 Abstract. In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive than previous strongly normalising cut-elimination procedures. In comparison, for example, with works by Dragalin and Danos et al., our procedure requires no special annotations on formulae and allows cut-rules to pass over other cut-rules. In order to adapt the notion of symmetric reducibility candidates for ... C. Urban; Marseille France; G. M. Bierman http://biblioteca.universia.net/ficha.do?id=45663466 We present a forward sequent calculus for intuitionistic propositional linear logic (# , 1, N, , 0, !) and a corresponding inverse-method search strategy. Our approach centres around resource management, inspired by similar approaches for backward-directed calculi such as top-down linear logic programming. Surprisingly, the resource management problems for the forward direction turn out to have a different character to those of the backward direction, arising for different connectives... Kaustuv Chaudhuri http://biblioteca.universia.net/ficha.do?id=46639333 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 tr... Yde Venema; Lou Goble (ed; Blackwell Guide; Philosophical Logic; Blackwell Publishers http://biblioteca.universia.net/ficha.do?id=37338740 Atualmente, em meio à grande variedade de processos e sistemas construtivosdisponíveis no mercado, o profissional da construção civil freqüentemente se deparacom várias questões do tipo: Qual sistema estrutural é o mais eficiente para o meuempreendimento? Deve ser em aço ou em concreto? Deve ser industrializado ouartesanal, ou deve ser ainda uma combinação de mais de um sistema?Essas escolhas são de fundamental importância para a eficiência da obra e para osucesso do empreendimento. É importa... Paulo André Rabelo Alkmin http://biblioteca.universia.net/ficha.do?id=979917 I will show that the semantic structure of a new imperfect-information propositional logic can be described in terms of extensive forms of semantic games. I will discuss some ensuing properties of these games such as imperfect recall, informational consistency, and team playing. Finally, I will suggest a couple of applications that arise in physics, and most notably in quantum theory and quantum logics. Pietarinen, Ahti-Veikko http://biblioteca.universia.net/ficha.do?id=46242530 Recent logic programming languages employ dynamic scheduling of calls to improve efficiency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically "delayed" until their arguments are sufficiently instantiated. To this end, logic languages are extended with constructs such as delay declarations. However, many declarative properties that hold for logic and pure Prolog programs do not apply any longer in this extended setting. In particular, the equivalenc... Annalisa Bossi; Sandro Etalle; Sabina Rossi http://biblioteca.universia.net/ficha.do?id=47180613 We present a new proof of cut elimination for linear logic which proceeds by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. The computational content of this proof is a non-deterministic algorithm for cut elimination which is amenable to an elegant implementation in Elf. We show this implementation in detail. Frank Pfenning http://biblioteca.universia.net/ficha.do?id=48039101 A lossless compression of images using coding schemes and patterns that include minterm, cube and coordinate data coding, Walsh, triangular and Reed–Muller weights based patterns, Reed–Muller spectra and reference row technique is proposed. The experimental results indicate that the technique is fairly efficient when compared with other methods based on representations of logic functions. Bogdan J. Falkowski http://biblioteca.universia.net/ficha.do?id=45674095 Abstract In this paper we introduce the logic programming language Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the xpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof proc... Manolis Gergatsoulis; Panos Rondogiannis; Themis Panayiotopoulos; M. Gergatsoulis; P. Rondogiannis; T. Panayiotopoulos http://biblioteca.universia.net/ficha.do?id=660928