http://biblioteca.universia.net/vernivel.do?start=320&nivel=11 Mostrando recursos 321 - 340 de 88,633 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=41810058 We present MSL, a specification logic for generic concurrent open systems with Milner-style mobility. MSL draws its expressiveness from the integration of certain operators expressing component distribution and name scoping into a first-order many-sorted logic of actions with fixed-points. MSL semantics is presented in terms of a class of generic structures, allowing its application to diverse concrete computational models, for instance process calculi and systems of mobile objects. We will a... http://biblioteca.universia.net/ficha.do?id=41861883 potheses and their restrictions are critical for linear logic, we give here a formulation of natural deduction for intuitionistic logic with localized hypotheses, but not parameters. For this we need a notation for hypotheses which we call a context. Contexts Gamma ::= Delta j Gamma; u:A Here, "Delta" represents the empty context, and Gamma; u:A adds hypothesis ` A labelled u to Gamma. We assume that each label u occurs at most once in a context in order to avoid ambiguities. The main judgmen... http://biblioteca.universia.net/ficha.do?id=47266671 We introduce a hybrid variant of a dynamic logic with continuous state transitions along differential equations, and we present a sequent calculus for this extended hybrid dynamic logic. With the addition of satisfaction operators, this hybrid logic provides improved system introspection by referring to properties of states during system evolution. In addition to this, our calculus introduces state-based reasoning as a paradigm for delaying expansion of transitions using nominals as symbolic ... André Platzer http://biblioteca.universia.net/ficha.do?id=45767246 Possibilistic logic o#ers a natural qualitative framework for handling uncertain information. This paper discusses its extension to dealing with partially ordered knowledge. Salem Benferhat; Sylvain Lagrue; Odile Papini http://biblioteca.universia.net/ficha.do?id=46389110 . Prioritized logic programming has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, some important aspects of prioritized logic programs have yet to be thoroughly explored. In this paper, we investigate several properties of prioritized logic programs in the context of answer set semantics. Specifically, we propose a characterization on the uniqueness of answer set for prioritized logic programs. We then prove two splitting theorems for ... Yan Zhang http://biblioteca.universia.net/ficha.do?id=46256371 This paper is a first attempt towards a theory for reactive planning systems, i.e. systems able to plan and control execution of plans in a partially known and unpredictable environment. We start from an experimental real world application developed at IRST, discuss some of the fundamental requirements and propose a formal theory based on these requirements. The theory takes into account the following facts: (1) actions may fail, since they correspond to complex programs controlling sensors a... Luca Spalazzi; Paolo Traverso http://biblioteca.universia.net/ficha.do?id=46379568 In joining defects on semiconductor wafer maps into clusters, it is common for defects caused by different sources to overlap. Simple morphological image processing tends to either join too many unrelated defects together or not enough together. Expert semiconductor fabrication engineers have demonstrated that they can easily group clusters of defects from a common manufacturing problem source into a single signature. Capturing this thought process is ideally suited for fuzzy logic. A system ... Thomas Karnowski Shaun; Shaun S. Gleason; Kenneth W. Tobin http://biblioteca.universia.net/ficha.do?id=47080369 In this paper we investigate the applicability of a bottom-up evaluation strategy for a first order fragment of linear logic [7] for the purposes of automated validation of authentication protocols. Following [11], we use multi-conclusion clauses to represent the behaviour of agents in a protocol session, and we adopt the Dolev-Yao intruder model and related message and cryptographic assumptions. Also, we use universal quantification to provide a logical and clean way to express creation ... Marco Bozzano; Giorgio Delzanno http://biblioteca.universia.net/ficha.do?id=46473756 We introduce the notion of 9-universal termination of logic programs. A program P and a goal G 9-universally terminate iff there exists a selection rule S such that every SLD-derivation of P [ fGg via S is finite. We claim that it is an essential concept for declarative programming, where a crucial point is to associate a terminating control strategy to programs and goals. We show that 9-universal termination and universal termination via fair selection rules coincide. Then we offer a ... Salvatore Ruggieri http://biblioteca.universia.net/ficha.do?id=45682583 Abstract. The Mayfly, a parallel processor being built at HP Labs in Palo Alto, has architectural support for several important aspects of the OM virtual machine for parallel logic programs. Each node has an extra processor that is able to relieve the main processor of a significant amount of the “housekeeping ” work of memory management, task switching, and message handling. This paper describes how the second processor implements kernel level functions in OM, with particular attention to th... John S. Conery http://biblioteca.universia.net/ficha.do?id=46261633 Probability, be it inherent or explicitly introduced, has become an important issue in the verification of programs. In this paper we study a formalism which allows reasoning about programs which can act probabilistically. To describe probabilistic programs, a basic programming language with an operator for probabilistic choice is introduced and a denotational semantics is given for this language. To specify properties of probabilistic programs, standard first order logic predicates are insuf... J. I. Den Hartog; E. P. De Vink http://biblioteca.universia.net/ficha.do?id=46271577 Model-based diagnosis is a general technique of Artificial Intelligence that has applications to engineering design, networking, planning, and other domains. These applications have led to the creation of special-purpose systems for model-based diagnosis, based on theories of truth maintenance. In this paper we focus on circuit diagnosis, and consider several logic programming approaches, which in contrast to the special-purpose systems, require very small amounts of code, yet are often quite... J. J. Alferes; F. Azevedo; P. Barahona; C. V. Damasio; T. Swift http://biblioteca.universia.net/ficha.do?id=47159174 This paper develops an inference system for natural language within the ‘Natural Logic ’ paradigm as advocated by Van Benthem [11], Sánchez [10] and others. The system that we propose is based on the Lambek calculus and works directly on the Curry-Howard counterparts for syntactic representations of natural language, with no intermediate translation to logical formulae. The Lambek-based system we propose extends the system by Fyodorov et al. [3], which is based on the Ajdukiewicz/Bar-Hillel (... Anna Zamansky; Nissim Francez; Yoad Winter http://biblioteca.universia.net/ficha.do?id=47197024 Abstract. Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision procedures are usually not based on tableau systems, a kind of formal proof procedure that lends itself towards computer implementation. In this paper we give four different tableaubased decision procedures for a very expressive hybrid logic including the universal modality; three of the procedures are base... Thomas Bolander; Torben; Bra Üner http://biblioteca.universia.net/ficha.do?id=45908061 We introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalizes to programs with monotone constraint atoms, but the generalization involves nondeterminism. Our main results demonstrate that our formalism is a common generalization of (1) normal logic programming with its semantics of models, supported models and stable models, (2) logic programming with weight atoms (lparse pr... Victor W. Marek; Ilkka Niemelä http://biblioteca.universia.net/ficha.do?id=41626541 Contents 1 Introduction 5 2 Logical Theories 7 2.1 First-Order Languages . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 Mathematical Structures . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Proofs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.4 Completeness of theories and decidability of structures . . . . . . . . 12 3 Constraint logic programs 17 3.1 Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.2 CLP(S) Pr... http://biblioteca.universia.net/ficha.do?id=42036410 This paper defends a pragmatical approach to vagueness. The vaguenessadaptive logic VAL is a good reconstruction of and an excellent instrument for human reasoning processes in which vague predicates are involved. Apart from its proof-theory and semantics, a Sorites-treating model based on it is presented, disarming the paradox. The paper opens perspectives with respect to the construction of theories by means of vague predicates. http://biblioteca.universia.net/ficha.do?id=37476186 In the present paper we prove that the poset of all extensions of the logic defined by a class of matrices whose sets of distinguished values are equationally definable by their algebra reducts is the retract, under a Galois connection, of the poset of all subprevarieties of the prevariety generated by the class of the algebra reducts of the matrices involved. We apply this general result to the problem of finding and studying all extensions of the logic of paradox (viz., the implication-free... Pynko, Alexej P. http://biblioteca.universia.net/ficha.do?id=46184735 In this paper it is argued that Hintikka's game theoretical semantics for Independence Friendly logic does not formalize the intuitions about independent choices; it rather is a formalization of imperfect information. Furthermore it is shown that the logic has several strange properties. An alternative semantics is proposed which formalizes intuitions about independence. Theo M. V. Janssen http://biblioteca.universia.net/ficha.do?id=46339191 We propose a new way to generalize logical operations from the discrete classical logic to a continuous fuzzy logic; namely, we propose to define derivatives for discrete case, and then to use these derivatives to derive the continuous operations. We show that this natural approach leads to "algebraic" fuzzy operations a \Delta b and a + b \Gamma a \Delta b. 1 Bernadette Bouchon-Meunier Hung; Vladik Kreinovich