http://biblioteca.universia.net/vernivel.do?start=260&nivel=11 Mostrando recursos 261 - 280 de 88,631 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=41866822 . In many so called interactive applications we are interested not only in the result of a program as a function of its input, but mainly in the behavior of the program while it is running. Such interactive programs are often described by execution traces, which are chronological sequences of states of the program during its execution. In this paper a logic for describing processes -- generalizations of execution traces is presented. It is shown that expressive power of this logic is not wors... http://biblioteca.universia.net/ficha.do?id=21050997 Mixed logic-systems contain both standard and nonstandard coordinate values. In this paper, it is shown that each of the specifically defined mixed logic-systems generates an internal nonstandard consequence operator. Herrmann, Robert A. http://biblioteca.universia.net/ficha.do?id=46278310 The elevator control program described in this journal by Dyck and Caines [2] can be implemented more concisely in d-Prolog, a defeasible logic programming system developed by Nute [3, 4, 5]. In defeasible logic, more specific rules take precedence over more general ones. Thus, the d-Prolog programmer can state general rules and then give explicit exceptions, just as humans do when explaining complex regularities to each other. Keywords: logic modeling, defeasible logic, defaults, elevator 1 Michael A. Covington http://biblioteca.universia.net/ficha.do?id=46213609 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 fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof proc... Manolis Gergatsoulis; Panos Rondogiannis; Themis Panayiotopoulos http://biblioteca.universia.net/ficha.do?id=41435136 In this paper we define a real-time logic called SC logic. This logic is defined in the framework of State Clock automata, the state variant of the Event Clock automata of Alur et al [6]. Unlike timed automata [4], they are complementable and thus language inclusion becomes decidable. SC automata and SC logic are less expressive than timed automata and MITL but seem expressive enough in practice. A procedure to translate each SC formula into a SC automaton is presented. The main contribution ... Pierre-yves Schobbens http://biblioteca.universia.net/ficha.do?id=46324789 This study aims to develop the logic of relativism, then to apply that logic to the question of self-refutation in relativism. Ressler, M. R. http://biblioteca.universia.net/ficha.do?id=46199671 fuzzy logic to solve problems that were previously assumed difficult to solve. These include, for example, the use of fuzzy logic for control and pattern recognition. However, the application of fuzzy logic to the establishment of correlations between independent and dependent process variables, i.e. regression modeling, has received less attention. Brian Schaible; Y. C. Lee http://biblioteca.universia.net/ficha.do?id=46211530 To help make logic programming more suitable for writing large systems, we develop linguistic mechanisms that permit the organization of logic programs around abstractions. In particular, we present the design of Denali, an equational logic programming language that supports predicate and data abstraction. Into The; Joseph Lawrence Zachary; Joseph Lawrence Zachary http://biblioteca.universia.net/ficha.do?id=19384096 Protoalgebraic logics are characterized by the monotonicity of the Leibniz operator on their theory lattices and are at the lower end of the Leibniz hierarchy of abstract algebraic logic. They have been shown to be the most primitive among those logics with a strong enough algebraic character to be amenable to algebraic study techniques. Protoalgebraic ?-institutions were introduced recently as an analog of protoalgebraic sentential logics with the goal of extending the Leibniz hierarchy from... Voutsadakis, George http://biblioteca.universia.net/ficha.do?id=44778839 We present a new prover for propositional 3-valued logics, TAS-M3, which is an extension of the TAS-D prover for classical propositional logic. TAS-M3 uses the TAS methodology and, consequently, it is a reduction-based method. Thus, its power is based on the reductions of the size of the formula executed by the F transformation. This transformation dynamically filters the information contained in the syntactic structure of the formula to avoid as much distributions as possible, in order to im... Aguilera Venegas, G.; Ojeda Aciego, Manuel; Guzmán, I. P. de http://biblioteca.universia.net/ficha.do?id=46304105 We present a logic-based programming language that features meta-level composition operations over programs. Object programs are parameterised named collections of denite clauses which may contain formulae of the form A in Pexp, where A is a standard atomic formula and Pexp is a program expression obtained by applying composition operations over named object programs. The semantics of the language is presented in two dierent equivalent styles. An operational, top-down semantics is given ... Antonio Brogi; Chiara Renso; Franco Turini http://biblioteca.universia.net/ficha.do?id=46370944 The paper presents an efficient algorithm for checking the satisfiability of a propositional linear time temporal logic formula, which may have past as well as future operators. This algorithm can be used to check validity of such formulas over all models as well as over computations of a finite-state program (model checking). Unlike previous theoretical presentations of a decision method for checking satisfiability or validity, whose first step is to construct the full set of all possib... Kesten Manna Mcguire; Y. Kesten; Z. Manna; H. Mcguire; A. Pnueli http://biblioteca.universia.net/ficha.do?id=46374711 A logic grammar formalism called DCG (Definite Clause Grammars), which has proved to be useful, is part of most Prolog implementations. We develop two new logic grammar formalisms called DCG' and HHG (higher-order Hereditary Harrop Grammars) that can be used in Prolog implementations. The relations between DCG, DCG', and HHG, and Prolog and Prolog can be illustrated by the following diagram: DCG --3--? DCG' --------4---------? LambdaHHG --- " --- 1 --- "3 --- 4 --... Serge Le Huitouze; Pascale Louvet; Olivier Ridoux http://biblioteca.universia.net/ficha.do?id=46382924 . In some phases of system development state-based methods are adequate; in others event-based methods are adequate. Petri nets provide a system model which supports both methods and thus allow a smooth transition between the different phases of system development. Most temporal logics for Petri nets, however, do not support both methods. In this paper we introduce a temporal logic for Petri nets which allows to argue on states as well as on events. This way, specifications in the earl... Ekkart Kindler; Tobias Vesper http://biblioteca.universia.net/ficha.do?id=46667484 The paper presents an efficient algorithm for checking the satisfiability of a propositional linear time temporal logic formula, which may have past as well as future operators. This algorithm can be used to check validity of such formulas over all models as well as over computations of a finite-state program (model checking). Unlike previous theoretical presentations of a decision method for checking satisfiability or validity, whose first step is to construct the full set of all possible a... Y. Kesten; Zohar Manna; Z. Manna; Amir Pnueli; H. Mcguire; A. Pnueli http://biblioteca.universia.net/ficha.do?id=46883146 The paper presents an efficient algorithm for checking the satisfiability of a propositional linear time temporal logic formula, which may have past as well as future operators. This algorithm can be used to check validity of such formulas over all models as well as over computations of a finite-state program (model checking). Unlike previous theoretical presentations of a decision method for checking satisfiability or validity, whose first step is to construct the full set of all possible a... Kesten Manna; Y. Kesten; Z. Manna; H. Mcguire; A. Pnueli http://biblioteca.universia.net/ficha.do?id=47282555 This paper describes the Altera Stratix II ™ logic and routing architecture. This architecture features a novel adaptive logic module (ALM) that is based on a 6-LUT, but can be partitioned into two smaller LUTs to efficiently implement circuits containing a range of LUT sizes that arises in conventional synthesis flows. This provides a performance increase of 15 % in the Stratix II architecture while reducing area by 2%. The ALM also includes a more powerful arithmetic structure that can perf... David Lewis; Elias Ahmed; Gregg Baeckler; Vaughn Betz; Mark Bourgeault; David Galloway; Mike Hutton; Chris Lane; Andy Lee; Paul Leventis; Cameron Mcclintock; Ketan Padalia; Bruce Pedersen; Giles Powell; Boris Ratchev; Srinivas Reddy; Jay Schleicher; Kevin Stevens; Richard Yuan; Richard Cliff; Jonathan Rose http://biblioteca.universia.net/ficha.do?id=47343386 This paper describes the Altera Stratix II ™ logic and routing architecture. This architecture features a novel adaptive logic module (ALM) that is based on a 6-LUT, but can be partitioned into two smaller LUTs to efficiently implement circuits containing a range of LUT sizes that arises in conventional synthesis flows. This provides a performance increase of 15 % in the Stratix II architecture while reducing area by 2%. The ALM also includes a more powerful arithmetic structure that can perf... David Lewis; Elias Ahmed; Gregg Baeckler; Vaughn Betz; Mark Bourgeault; David Galloway; Mike Hutton; Chris Lane; Andy Lee; Paul Leventis; Cameron Mcclintock; Ketan Padalia; Bruce Pedersen; Giles Powell; Boris Ratchev; Srinivas Reddy; Jay Schleicher; Kevin Stevens; Richard Yuan; Richard Cliff; Jonathan Rose http://biblioteca.universia.net/ficha.do?id=47435523 There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The most basic such extension is public announcement logic (PAL), which is obtained from EL by adding an operator for truthful public announcements. In this paper, we consider the computational complexity of PAL and show that it coincides with that of EL. This holds in the single- and multi-agent case, and also in the pres... http://biblioteca.universia.net/ficha.do?id=48014373 This paper describes the Altera Stratix II ™ logic and routing architecture. This architecture features a novel adaptive logic module (ALM) that is based on a 6-LUT, but can be partitioned into two smaller LUTs to efficiently implement circuits containing a range of LUT sizes that arises in conventional synthesis flows. This provides a performance increase of 15 % in the Stratix II architecture while reducing area by 2%. The ALM also includes a more powerful arithmetic structure that can perf... David Lewis; Elias Ahmed; Gregg Baeckler; Vaughn Betz; Mark Bourgeault; David Galloway; Mike Hutton; Chris Lane; Andy Lee; Paul Leventis; Cameron Mcclintock; Ketan Padalia; Bruce Pedersen; Giles Powell; Boris Ratchev; Srinivas Reddy; Jay Schleicher; Kevin Stevens; Richard Yuan; Richard Cliff; Jonathan Rose