281.

Pure Inductive Logic Workshop Notes for ISLA 2014
- Jeff Paris
Introduction Broadly speaking Inductive Logic is the study of how to ra-tionally or logically assign probabilities, subjective probabilities, to events on the basis of some knowledge. Pure Inductive Logic is intended to address this question in perhaps the simplest possible case, when there actually is no prior contingent knowledge, just the uninterpreted context.

282.

J. LOGIC PROGRAMMING 1993:12:1{199 1 DETECTION AND OPTIMIZATION OF SUSPENSION-FREE LOGIC PROGRAMS
- Saumya Debray; David Gudeman; Peter
In recent years, language mechanisms to suspend, or delay, the execution of goals until certain variables become bound have become increasingly popular in logic programming languages. While convenient, such mecha-nisms can make control
ow within a program dicult to predict at compile time and therefore render many traditional compiler optimizations inappli-cable. Unfortunately, this performance cost is also incurred by programs that do not use any delay primitives. In this paper we describe a sim-ple data
ow analysis for detecting computations where suspension eects can be ignored, and discuss several low-level optimizations that rely on this information. Our algorithm has been implemented...

283.

The “Bologna Zone ” or European Higher Education Area
- The Trivium
literary arts: grammar, logic, and rethoric

284.

• Essays in pure and applied game theory.
- Tai-wei Hu; Kalyan Chatterjee; Neil Wallace
• Published papers: 1. “On p- rationalizability and approximate common certainty of rationality, ” Journal of Economic Theory, Volume 136, Issue 1, September 2007, Pages 379-391. 2. “Expected utility theory from the frequentist perspective.” accepted by Economic Theory. • Working papers: 1. “Coalition-proof trade and the Friedman rule in the Lagos-Wright model. ” joint with John Kennan and Neil Wallace. 2. “Counterfeiting substitute media-of-exchange: a threat to monetary systems. ” CAPCP working paper. 3. “Complexity and mixed strategy equilibria. ” Job market paper. 4. “Logic for games of perfect information and epistemic conditions for backward induction and for subgame perfectness....

285.

The Logic and Metaphysics of Leibniz
- Roger Bishop Jones
Formal models of aspects of the Logic and Metaphysics of Gottfried Wilhelm Leibniz. Created 2009/9/2

286.

Approximate Nature of Traditional Fuzzy Methodology Naturally Leads to Complex-Valued Fuzzy Degrees
- Olga Kosheleva; Vladik Kreinovich
Abstract—In the traditional fuzzy logic, the experts ’ degrees of confidence in their statements is described by numbers from the interval [0; 1]. These degree have a clear intuitive meaning. Somewhat surprisingly, in some applications, it turns out to be useful to also consider different numerical degrees – e.g., complex-valued degrees. While these complex-valued degrees are helpful in solving practical problems, their intuitive meaning is not clear. In this paper, we provide a possible explanation for the success of complex-valued degrees which makes their use more intuitively understandable – namely, we show that these degrees naturally appear due to the...

287.

Real Time Production Monitoring Using Sensors
- Vinni Sharma
Abstract- The objective of the paper is production monitoring using sensors [HMDs], PLC and Client-Server programs. This has been practically implemented in the wire rod mill, Bhilai Steel Plant [SAIL]. Earlier the mill condition was only known to the persons on shop floor. The data from HMDs are processed and shown in mimics in real time so that any interested person can observe the real time rolling condition of the mill. The metal presence is each strand is sensed by a series of hot metal detectors [sensors], which are located at various points along the rolling line. Based on the...

288.

Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements
- Tsan-sheng Hsu; Churn-jung Liau; Da-wei Wang
In this paper, we propose a probabilistic hybrid logic for the specification of data pri-vacy requirements. The proposed logic is a combination of quantitative uncertainty logic and basic hybrid logic with a satisfaction operator. We show that it is expressive enough for the specification of many well-known data privacy requirements, such as k-anonymity, l-diversity and its precursor logical safety, t-closeness, and δ-disclosure privacy. The main contribution of the work is twofold. On one hand, the logic provides a common ground to express and compare existing privacy criteria. On the other hand, the uniform framework can meet the specification needs of...

289.

Design patterns for developing dynamically adaptive systems
- Andres J. Ramirez; Betty H. C. Cheng
As applications grow in size and complexity, and computing infrastructure continues to evolve, it becomes increasingly difficult to build a system that satisfies all requirements and constraints that might arise during its lifetime. As a result, there is an increasing need for software to adapt in response to new requirements and environmental conditions after it has been deployed. Due to their high complexity, adaptive programs are generally difficult to specify, design, verify, and validate. In addition, the current lack of reusable design ex-pertise that can be leveraged from one adaptive system to another further exacerbates the problem. To address this...

290.

2. How much do the Spartan-6 and Virtex-6 FPGA Connectivity Kits cost? A: The Virtex-6 FPGA Connectivity Kit costs $2995 USD. The Spartan-6 FPGA Connectivity Kit costs $1995 USD.
- Virtex- Fpga; Connectivity Kit Faq
Kit is now open. The lead times are posted on the kit ordering pages. The ISE Design Suite Embedded Edition software included in the kit is available for you to download immediately upon purchasing the kit. You will be sent an email with instructions to help you to register and generate a software license when you place your order. See FAQ answer to “How do I register and install my software? ” below for instructions. For the Spartan-6 FPGA Connectivity Kit only, the full version of the Northwest Logic DMA IP core is also included as part of the kit...

291.

Richard Routley’s Exploring Meinong’s Jungle and Beyond is perhaps the most
- R. Routley; Michele Paolini Paoletti
comprehensive and representative work in Neo-Meinongianism. It covers several topics: theory of items,1 ontology, logics, aesthetics, theory of knowledge, philosophy of mathematics, philosophy of time. Routley aims at presenting a Meinong-inspired theory of items and at showing the advantages of such a theory within several fields. This book includes some articles published from the ‘60s and it partly inspired modal Neo-Meinongianism, even though Routley seems to accept the property-centered Neo-Meinongianism (see the Foreword). I cannot give here an exhaustive account of Routley’s whole investigation of noneism (i.e., the theory according to which, roughly, there are items that do not exist,...

292.

Logic programming
- Iliano Cervesato
Indexing is generally viewed as an implementation artifact, indispensable to speed up the execution of logic programs and theorem provers, but with little intrinsically logical about it. We show that indexing can be given a justification in proof theory on the basis of focusing and linearity. We demonstrate this approach on predicate indexing for Horn clauses and several formulations of hereditary Harrop formu-las. We also show how to refine this approach to discriminate on function symbols as well.

293.

G.: SMART: Secure and Minimal Architecture for (Establishing a Dynamic) Root of Trust
- Karim El Defrawy; Daniele Perito; Gene Tsudik
Remote attestation is the process of securely veri-fying internal state of a remote hardware platform. It can be achieved either statically (at boot time) or dy-namically, at run-time in order to establish a dynamic root of trust. The latter allows full isolation of a code region from preexisting software (including the oper-ating system) and guarantees untampered execution of this code. Despite the untrusted state of the overall platform, a dynamic root of trust facilitates execution of critical code. Prior software-based techniques lack concrete security guarantees, while hardware-based approaches involve security co-processors that are too costly for low-end embedded devices. In...

294.

USING PULL LOGIC OF FLOW SIMULATION IN THE PROCESS OF THE PRODUCTION PLANNING SYSTEM TRANSFORMATION
- Łukasz Hadaś; Paweł Pawlewski
Shop floor control transformation, pull logic of flow,

295.

Weak MSO+U with Path Quantifiers over Infinite Trees
- Miko Laj Bojańczyk
Abstract. This paper shows that over infinite trees, satisfiability is de-cidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by re-duction to emptiness for a certain automaton model, while emptiness for the automaton model is decided using profinite trees. This paper presents a logic over infinite trees with decidable satisfiabil-ity. The logic is weak monadic second-order logic with U and path quantifiers (wmso+up). A formula of the logic is evaluated in an infinite binary labelled tree. The logic can quantify over: nodes, finite sets of nodes, and paths (a...

296.

Axiomatic and Tableau-Based Reasoning for Kt(H,R)
- Renate A. Schmidt; John G. Stell; David Rydeheard
We introduce a tense logic, called Kt(H,R), arising from logics for spatial reasoning. Kt(H,R) is a multi-modal logic with two modalities and their converses defined with respect to a pre-order and a relation stable over this pre-order. We show Kt(H,R) is decidable, it has the effective finite model property and reasoning in Kt(H,R) is PSPACE-complete. Two complete Hilbert-style axiomatisations are given. The main focus of the paper is tableau-based reasoning. Our aim is to gain insight into the numerous possibilities of defining tableau calculi and their properties. We present several labelled tableau calculi for Kt(H,R) in which the theory rules...

297.

A neuro-fuzzy controller for mobile robot navigation and multirobot convoying
- Kim C. Ng; Mohan M. Trivedi; Senior Member
Abstract—A Neural integrated Fuzzy conTroller (NiF-T) which integrates the fuzzy logic representation of human knowledge with the learning capability of neural networks is developed for nonlinear dynamic control problems. NiF-T architecture com-prises of three distinct parts: 1) Fuzzy logic Membership Func-

298.

Verification of Context-Sensitive Knowledge and Action Bases
- Diego Calvanese; Marco Montali; Ario Santoso
Abstract. Knowledge and Action Bases (KABs) have been recently proposed as a formal framework to capture the dynamics of systems which manipulate Description Logic (DL) Knowledge Bases (KBs) through action execution. In this work, we enrich the KAB setting with contextual information, making use of different context dimensions. On the one hand, context is determined by the environment using context-changing actions that make use of the current state of the KB and the current context. On the other hand, it affects the set of TBox assertions that are relevant at each time point, and that have to be considered when...

299.

Histogram-Based Color Image Transformation Using Fuzzy Membership Functions
- Gwanggil Jeon
This paper describes a novel color image enhancement method using fuzzy membership functions. We use three well-known fuzzy membership functions smf, sigmamf,and trapezmf for fuzzy logic. The shape of the membership functions used in fuzzy logic is formed in an versatile fashion in accord with the given parameters. By applying fuzzy process and defuzzification, we acquire a relationship between input and output values. Simulation results indicate that the proposed method yields satisfactory results in all test images.

300.

Ontology-Based Data Access with Closed Predicates is Inherently Intractable (Sometimes)
- Carsten Lutz; Fachbereich Informatik; Frank Wolter
When answering queries in the presence of on-tologies, adopting the closed world assumption for some predicates easily results in intractability. We analyze this situation on the level of individual on-tologies formulated in the description logics DL-Lite and EL and show that in all cases where an-swering conjunctive queries (CQs) with (open and) closed predicates is tractable, it coincides with an-swering CQs with all predicates assumed open. In this sense, CQ answering with closed predicates is inherently intractable. Our analysis also yields a di-chotomy between AC0 and CONP for CQ answer-ing w.r.t. ontologies formulated in DL-Lite and a dichotomy between PTIME...