Sunday, January 25, 2015

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía
 

rss_1.0 Clasificación por Disciplina

Nomenclatura Unesco > (11) Lógica

Mostrando recursos 161 - 180 de 139,146

161. Embedded Fuzzy Logic-Based Wall-Following Behavior for Mobile Robot Navigation - Eddie Tunstel; Mo Jamshidi
The synthesis of a fuzzy logic controller that provides a small mobile robot with the capability to exhibit a wall-following behavior is described. A general account of the procedure is given with emphasis placed on the embedded realization of the fuzzy controller and its feasibility using commercially available tools. I. INTRODUCTION Embedded systems are physically embodied or purely computational processors embedded in environments whose dynamics they can influence but not completely control [1]. Mobile robots equipped with onboard computational resources are good examples of embedded systems. In some applications (e.g. planetary exploration by microrovers) these robots must satisfy the dual...

162. Real-time Logics: Complexity and Expressiveness - Rajeev Alur; Thomas A. Henzinger
. The theory of the natural numbers with linear order and monadic predicates underlies propositional linear temporal logic. To study temporal logics that are suitable for reasoning about real-time systems, we combine this classical theory of infinite state sequences with a theory of discrete time, via a monotonic function that maps every state to its time. The resulting theory of timed state sequences is shown to be decidable, albeit nonelementary, and its expressive power is characterized by !-regular sets. Several more expressive variants are proved to be highly undecidable. This framework allows us to classify a wide variety of real-time...

163. Spatial Database Querying with Logic Languages - Jean-pierre Cheiney; Vincent Oria
Several different data structures, generally grouped in Raster and Vectors representation models, are used to store images and all kinds of spatial data. One solution, for a spatial data manipulation language to be independent of the storage model, is to base the language on the spatial relations of objects (i.e. the positions of objects relative to each other). This paper proposes a logic intermediate language allowing a declarative querying. We show that this language can be easily computed by a procedural execution using a small set of operators. This language enables expression of direction and topological spatial relations and ensures...

164. An Empirical Study of the LSS Specification Toolkit in Use - David Robertson
The LSS (Lightweight Specification System) toolkit assists in the development of logic programs, using a variety of high level specification methods. Many other high level specification systems impose a single, uniform view of how specification should proceed. In practice, there is normally no single understanding of how to describe specifications - there are instead a variety of different forms of description which have evolved from the work practices of various domains. Any attempt to disturb these work practices in a radical way will, naturally, meet with resistance unless those who must be educated in new methods can see clearly that...

165. Towards Full Completeness of the Linear Logic of Chu Spaces - Vaughan Pratt
We investigate the linear logic of Chu spaces as defined by its dinaturality semantics. For those formulas of multiplicative linear logic limited to at most two occurrences of each variable we prove full completeness of Girard's MIX-free axiomatization, namely that the cut-free proofnets of such formulas are in a natural bijection with the dinatural elements of the corresponding functors. 1 Introduction Whereas ordinary logic axiomatizes theorems, linear logic axiomatizes proofs. The semantic criterion for theoremhood is validity: the truth function denoted by a formula is required to be universally true. Following Lambek and Scott [11] and (as applied to linear...

166. Domain-Independent Constraint Solver Extension - Eric Monfroy; Christophe Ringeissen
Constraint Logic Programming (CLP) is a class of programming languages inheriting declarativity from logic programming and efficiency from constraint solving. The CLP scheme enables to design applications by declaring relations (the constraints) between high-level objects. However, constraints are restricted to formulae handled by solvers. Thus, the declarativity may be jeopardized due to the scope of solvers. SoleX is a mechanism for extending constraint solvers in order to handle new function symbols on the computation domain. This extension consists in building two kinds of rule-based transformations: domain independent rules for symbolically processing constraints with additional function symbols and rules for completing...

167. A mixed linear and non-linear logic: proofs, terms and models - P. N. Benton
) P. N. Benton y University of Cambridge Abstract Intuitionistic linear logic regains the expressive power of intuitionistic logic through the ! (`of course') modality. Benton, Bierman, Hyland and de Paiva have given a term assignment system for ILL and an associated notion of categorical model in which the ! modality is modelled by a comonad satisfying certain extra conditions. Ordinary intuitionistic logic is then modelled in a cartesian closed category which arises as a full subcategory of the category of coalgebras for the comonad. This paper attempts to explain the connection between ILL and IL more directly and symmetrically...

168. Extending Probabilistic Dynamic Epistemic Logic Joshua Sack
This paper aims to extend in two directions the proba-bilistic dynamic epistemic logic provided in Kooi’s paper [8]. Kooi’s probabilistic dynamic epistemic logic adds to probabilistic epistemic logic sentences that express conse-quences of public announcements. The first extension of-fered in this paper is to add a previous time operator to a probabilistic dynamic epistemic logic similar to Kooi’s. The other is to involve action models and update products in a probabilistic dynamic epistemic logic setting. This would allow for more kinds of actions, such as private announce-ments. 1

169. © 2006 SAGE Publications 10.1191/1464993406ps145oa - I Postmodernism The Beginning; Martin Müller
or the end of a radical mission? While postmodernity as the ontological manifes-tation of the postmodern condition in art, archi-tecture or culture has seldom been questioned, the epistemological position of postmodernism has been subject to multiple contestations. This is not surprising considering its downright radi-cal agenda. Postmodernism was described as marking the beginning of an era, when there is suspicion of reason and of the very idea of universal validity claims that can be justified through argument. There is a rage against humanism and the Enlightenment legacy.... [Postmodernism] eschews all metanarratives. The spirit of our times is one of deconstruction...

170. Updating Description Logic ABoxes - Hongkai Liu; Carsten Lutz; Frank Wolter
Description logic (DL) ABoxes are a tool for describing the state of affairs in an application domain. In this paper, we consider the problem of updating ABoxes when the state changes. We assume that changes are described at an atomic level, i.e., in terms of possibly negated ABox assertions that involve only atomic concepts and roles. We analyze such ba-sic ABox updates in several standard DLs by investigating whether the updated ABox can be expressed in these DLs and, if so, whether it is computable and what is its size. It turns out that DLs have to include nominals and...

171. Association of Human Papillomaviruses With a Subgroup of Head and Neck Squamous Cell Carcinomas - David T. W. Wong
Papillomaviruses, small DNA viruses with a pronounced tro-pism for epithelial cells, have been isolated from many organ-isms. In humans, approximately 100 different virus types have been described, and this list is likely to grow. The human pap-illomaviruses (HPVs) are associated with a large spectrum of epithelial lesions. Most of these are benign hyperplasias (warts) that only very rarely progress to cancers. A subgroup of HPVs, i.e., the “high-risk ” HPVs, however, are associated with lesions that have a propensity to undergo carcinogenic progression. Most notably, almost all human cervical carcinomas contain and express high-risk HPV sequences. During carcinogenic progres-sion, the...

172. RELEVANCE OF CORROSION RESEARCH IN THE MATERIAL SELECTION FOR DESALINATION PLANTS1 - Anees U Malik; Saleh A. Al-fozan; Mohammad Al Romiahl
Besides cost, availability and design considerations, the erosion and corrosion behavior of materials in the service environment is an important factor for selection of materials in processing plants. The phenomenon of local corrosion has been frequently observed in evaporators, heat exchangers, pressure pipings, pumps and valves of the seawater desalination plants. This paper describes the different types of materials used in seawa-ter multistage flash evaporation (MSF) and reverse osmosis (RO) plants and their per-formance since the inception of plants. The logic of using superior materials such as high alloy steels in place of conventional stainless steels and its consequences on...

173. Using circuit structural analysis techniques for networks in systems biology. In: SLIP ’09: Proceedings of the 11th international workshop on System level interconnect prediction - Sherief Reda
The cell contains numerous networks for information processing. These networks are responsible for carrying out all cell functions including gene transcription, signal transconduction, and metabolic activities. Many of these networks process information similar to digital logic circuits and classical logic methods have been success-fully used to analyze their behavior. The objective of this paper is to investigate the potential of circuit structural analysis techniques in analyzing the topologies of cellular networks arising in systems bi-ology context. Rent’s rule has been in particular a classical method that is used in analyzing the topologies of digital circuits. We in-vestigate the applicability of...

174. PROFILES OF INDUSTRIAL CONSOLIDATION: M&A ACTIVITIES IN THE LATIN AMERICAN ELECTRICITY AND GAS SECTOR - Marc Petz; Dr. Bryan; K. Temple; Senior Lecturer; Michael Zettl
Industrial consolidation is a global trend that evolved during the last three decades. Market liberalisation and privatisation represent initial key transformation processes for this phenomenon in the energy sector. The energy sector moved over to common interest during the last years: The number and volume of international large-scale mergers increased, and new multinational super-utility champions gained momentum (Graeme 2002). For example, the bid for the Spanish Endesa in 2006 included the second largest cash offer with an amount of nearly US $ 66 billion by Eon in history of Mergers and Acquisitions (M&A). In addition, those transformation processes allowed new...

175. Focalisation and classical realisability - Guillaume Munch-maccagnoni
Abstract We develop a polarised variant of Curien and Herbelin’s λ̄µµ ̃ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised when cut-free), such as Girard’s classical logic LC or linear logic. This gives a setting in which Krivine’s clas-sical realisability extends naturally (in particular to call-by-value), with a presentation in terms of orthogonality. We give examples of applications to the theory of program-ming languages. In this version extended with appendices, we in partic-ular give the two-sided formulation of classical logic with the involutive classical negation. We also show that there is, in...

176. Toward Ethical Robots via Mechanized Deontic Logic - Konstantine Arkoudas; Selmer Bringsjord; Paul Bello
We suggest that mechanized multi-agent deontic logics might be appropriate vehicles for engineering trustworthy robots. Mechanically checked proofs in such logics can serve to es-tablish the permissibility (or obligatoriness) of agent actions, and such proofs, when translated into English, can also ex-plain the rationale behind those actions. We use the logical framework Athena to encode a natural deduction system for a deontic logic recently proposed by Horty for reasoning about what agents ought to do. We present the syntax and seman-tics of the logic, discuss its encoding in Athena, and illustrate with an example of a mechanized proof.

177. GRADUATE STUDENTS - Vladimir Bulovic; Seth Coe; Conor Madigan; Debbie Mascaro
We are a new group at MIT. We study physical properties of organic thin films, structures, and devices. Our fundamental findings are applied to the development of optoelectronic, electronic, and photonic organic devices of nano-scale thickness, including visible LEDs, lasers, solar cells, photodetectors, transistors, flexible and transparent optoelectronics. In addition to working on small-molecular-weight van-der-Waals-bonded organic thin films, in the future we will also examine polymer solids, self-assembled materials, and hybrid organic/inorganic structures. We aim to reduce the size of active organic layers from the present nano-scale thickness of organic thin films to that of single molecules, with the ultimate...

178. Approximate Reasoning in MAS: Rough Set Approach - Andrzej Skowron
In modeling multiagent systems for real-life problems, techniques for approximate reasoning about vague concepts and dependencies (ARVCD) are necessary. We discuss an approach to approximate reasoning based on rough sets. In particular, we present a number of basic concepts such as approximation spaces, concept approximation, rough inclu-sion, construction of information granules in calculi of in-formation granules, and perception logic. The approach to ARVCD is illustrated by examples relative to interactions of agents, ontology approximation, adaptive hierarchical learning of compound concepts and skills, behavioral pat-tern identification, planning, conflict analysis and negotia-tions, and perception-based reasoning. The concept approximation problem is the basic...

179. First-Order LTL Model Checking Using Mdgs - Fang Wang; Otmane Ait Mohamed
Abstract. In this paper, we describe a first-order linear time temporal logic (LTL) model checker based on multiway decision graphs (MDG). We developed a first-order temporal language, L

180. 1 Weak Reference or the True Semantics of Relative Identity Statements - Friederike Moltmann
relative identity statements: (1) a. x is the same statue as y, but x is not the same lump as y. b. Joe is the same statue as Bill, but Joe is not the same lump of clay than Bill. Geach’s view: Identity is by nature relative; identity is always relative to a sortal concept- The world is divided into various equivalence classes via sortal concepts- Reference to objects requires a sortal concept (providing identity conditions for the object)- There are two kinds of quantifier restrictions: (2) a. Every A is B b. Everything that is A is B critique...

 

Busque un recurso