http://biblioteca.universia.net/vernivel.do?start=200&nivel=11 Mostrando recursos 201 - 220 de 88,633 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=46549301 this paper is to establish a class of models for solving the weight problem in fuzzy logic. First, some constraints that weighted fuzzy logic should satisfy are given based on Triangular norms and conorms. Then, based on these constraints, a class of models (referred to as relative weighted models) are established for handling weights in fuzzy logic. These models are novel in three aspects: (1) they include non-weighted models as their special cases, (2) the weighted conjunction and weighted ... Xudong Luo; Chengqi Zhang; J. Cai; Jingqiu Cai http://biblioteca.universia.net/ficha.do?id=46904313 . 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, simplif... Robert Kowalski; Francesca Toni; Gerhard Wetzel http://biblioteca.universia.net/ficha.do?id=43240078 Traducción castellana de José Juan Moreso del original, Tecla Mazzarese: Fuzzy Logic and Judicial Decision-Making: The Peril of a Rationalist Fallacy. Texto de la ponencia presentada por la autora en el Congreso de Filosofía del Derecho en Homenaje al Prof. Ernesto Garzón Valdés, celebrado en Vaquerías (Córdoba-Argentina) en septiembre de 1992. Mazzarese, Tecla http://biblioteca.universia.net/ficha.do?id=46008978 Monads have been recognized by Moggi as an elegant device for dealing with stateful computation in functional programming languages. In previous work, we have introduced a Hoare calculus for partial correctness of monadic programs. All this has been done in an entirely monad-independent way. Here, we extend this to a monad-independent dynamic logic (assuming a moderate amount of additional infrastructure for the monad). Dynamic logic is more expressive than the Hoare calculus; in particular, ... Lutz Schröder; Till Mossakowski http://biblioteca.universia.net/ficha.do?id=46197126 Conditional equational theories can be built into logic programming using a generalized resolution rule which calls a universal unification procedure. Such unification procedures are often defined by sound and strongly complete sets of inference rules. Steffen Hölldobler http://biblioteca.universia.net/ficha.do?id=46244542 We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore the relationship between coherence-based and classical modeltheoretic probabilistic logic. Interestingly, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Using these results, we analyze the computational complexity of probabilistic reasoning under ... Veronica Biazzo; Angelo Gilio; Thomas Lukasiewicz http://biblioteca.universia.net/ficha.do?id=46430448 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. This work was supported by NSF Grant CCR-9303383 The views and conclusions contained in this document are th... Frank Pfenning December; Frank Pfenning http://biblioteca.universia.net/ficha.do?id=46565608 Two complete loop checking mechanisms have been presented in the literature for logic programs with functions: OS-check and EVA-check. OS-check is computationally ecient but quite unreliable in that it often mis-identies innite loops, whereas EVA-check is reliable for a majority of cases but quite expensive. In this paper, we develop a series of new complete loop checking mechanisms, called VAFchecks. The key technique we introduce is the notion of expanded variants, which captures a key stru... Yi-Dong Shen; Li-yan Yuan; Jia-huai You http://biblioteca.universia.net/ficha.do?id=47130962 Abstract. Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the question of which are most adequate to model updates. A systematic approach to face this question is to identify general principles against which such semantics could be evaluated. In this paper we motivate and introduce a new such principle – the refined extension principle. Such principle is complied with by... José Júlio Alferes; Federico Banti; Antonio Brogi; João Alexandre Leite http://biblioteca.universia.net/ficha.do?id=47387194 Monads have been recognized by Moggi as an elegant device for dealing with stateful computation in functional programming languages. In previous work, we have introduced a Hoare calculus for partial correctness of monadic programs. All this has been done in an entirely monad-independent way. Here, we extend this to a monad-independent dynamic logic (assuming a moderate amount of additional infrastructure for the monad). Dynamic logic is more expressive than the Hoare calculus; in particular, ... Lutz Schröder; Till Mossakowski http://biblioteca.universia.net/ficha.do?id=47810530 Monads have been recognized by Moggi as an elegant device for dealing with stateful computation in functional programming languages. In previous work, we have introduced a Hoare calculus for partial correctness of monadic programs. All this has been done in an entirely monad-independent way. Here, we extend this to a monad-independent dynamic logic (assuming a moderate amount of additional infrastructure for the monad). Dynamic logic is more expressive than the Hoare calculus; in particular, ... Till Mossakowski; Lutz Schröder; Lutz Schröder http://biblioteca.universia.net/ficha.do?id=46462859 This paper proposes a general framework for integrating a constraint logic programming system with a stochastic constraint solver to solve constraint satisfaction problems efficiently. Stochastic solvers can solve hard constraint satisfaction problems very efficiently, and constraint logic programming allows heuristics and problem breakdown to be encoded in the same language as the constraints. Hence their combination is attractive. Unfortunately there is a mismatch in the kinds of informatio... Peter J. Stuckey; Vincent W. L. Tam http://biblioteca.universia.net/ficha.do?id=46483706 We describe and discuss several semantical views of linear logic. Our primary topic is game semantics, including modifications suggested by Abramsky, Jagadeesan, Hyland, Ong, and Japaridze. We also briefly discuss Girard's coherence spaces and de Paiva's Dialectica-like semantics. 1 Keywords: linear logic, semantics, games, determinacy 1 Introduction The WoLLIC talk on which this paper is based consisted of some introductory material on linear logic and several observations abou... Andreas Blass Mathematics http://biblioteca.universia.net/ficha.do?id=46396887 . We present an institution of observational logic which generalizes earlier approaches to observational systems specification in various ways. First, we introduce a notion of an observational signature which incorporates the declaration of a distinguished set of observers. Then, we define observational algebras whose operations are required to be compatible with the indistinguishability relation determined by the observers of an observational signature. In particular, we introduce a homomorp... Observational Logic; Ecole Normale; Suprieure Cachan; Rolf Hennicker; Michel Bidoit http://biblioteca.universia.net/ficha.do?id=48077987 Tejeda Moreno, V. Antonio http://biblioteca.universia.net/ficha.do?id=48981454 Russell, Bertrand http://biblioteca.universia.net/ficha.do?id=41536425 this paper, I present a new method that is based on non-executable logic specifications derived from Hoare correctness formulae for logic programs. Logic specifications specify the same programs, they are equivalent to correctness formulae. 2 Norbert E. Fuchs http://biblioteca.universia.net/ficha.do?id=47198960 Abstract: Given a sequence {Πn} of Horn logic programs, the limit Π of {Πn} is the set of the clauses such that every clause in Π belongs to almost every Πn and every clause in infinitely many Πn’s belongs to Π also. The limit program Π is still Horn but may be infinite. In this paper, we consider if the least Herbrand model of the limit of a given Horn logic program sequence {Πn} equals the limit of the least Herbrand models of each logic program Πn. It is proved that this property is not tr... Shilong Ma; Yuefei Sui; Ke Xu http://biblioteca.universia.net/ficha.do?id=41986631 We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL) which is an expressive fragment of first-order logic (FOL). DLP provides a... Benjamin N. Grosof,Ian Horrocks http://biblioteca.universia.net/ficha.do?id=47353060 This paper focuses on the integration of reachability and observability concepts within an algebraic, institution-based framework. In the first part of this work, we develop the essential ingredients that are needed to define the constructorbased observational logic institution, called COL, which takes into account both the generation- and observation-oriented aspects of software systems. The underlying paradigm of our approach is that the semantics of a specification should be as loose as po... Observational Logic; Michel Bidoit A; Rolf Hennicker B