Results 21  30
of
486
Chapter 12 Rough Sets and Rough Logic: A KDD Perspective
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract
 Add to MetaCart
Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations
Author manuscript, published in "WWW (Companion Volume) (2012) 211214" The ERC Webdam on Foundations of Web Data Management ∗
, 2012
"... The Webdam ERC grant is a fiveyear project that started in December 2008. The goal is to develop a formal model for Web data management that would open new horizons for the development of the Web in a wellprincipled way, enhancing its functionality, performance, and reliability. Specifically, the ..."
Abstract
 Add to MetaCart
, the goal is to develop a universally accepted formal framework for describing complex and flexible interacting Web applications featuring notably data exchange, sharing, integration, querying, and updating. We also propose to develop formal foundations that will enable peers to concurrently reason about
Stateful Authorization Logic  Proof Theory and a Case Study
, 2010
"... Authorization policies can be conveniently represented and reasoned about in logic. Proof theory is important for many such applications of logic. However, so far, there has been no systematic study of proof theory that incorporates system state, upon which access policies often rely. The present p ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
and validate the logic both foundationally, by proving relevant metatheoretic properties of the logic’s proof system, and empirically, through a case study of policies that control access to sensitive intelligence information in the U.S.
MultiAgent ¢¡¤ £ Logic Wooldridge
"... Abstract. We present a formalism for reasoning about the information properties of multiagent systems. Multiagent ©��� � logic allows us to represent what is objectively true of some environment, what is visible, or accessible of the environment to individual agents, what these agents actually per ..."
Abstract
 Add to MetaCart
model of multiagent systems, we systematically investigate a number of possible interaction axioms, and characterise these axioms in terms of the properties of agents that they correspond to. Finally, we illustrate the use of the logic through a case study, and discuss issues for future work. 1
Information Assurance Cases: Problems and Approaches
"... An Information Assurance Case (IAC) is an argument that a system meets some IA requirements. This paper examines the analogy between IACs and security cases and the problem of integrating diverse forms of evidence into an IAC. Some of the most pressing research problems in IAC construction, maintena ..."
Abstract
 Add to MetaCart
made explicit) that a information system has satisfactory IA properties. Its function is to convince system assessors — users, potential customers, certifiers, and so on — that the system satisfies their IA requirements. To properly perform this function, an IA case must be both logically strong
Foundational certification of dataflow analyses
 IN: TASE
, 2007
"... Dataflow analyses, such as live variables analysis, available expressions analysis etc., are usefully specifiable as type systems. These are sound and, in the case of distributive analysis frameworks, complete wrt. appropriate natural semantics on abstract properties. Applications include certifica ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
on transition traces of a suitable kind (future defs and uses). The rules of the type property semantics and those in turn in the Hoare logic for the transition trace semantics. This reduction of the burden of trusting the certification vehicle can be compared to foundational proofcarrying code, where general
The Logic and Mathematics of Occasion Sentences
"... The prime purpose of this paper is to contribute to the development of an adequate logic of occasion sentences and a mathematical (Boolean) foundation for such a logic, thus preparing the ground for a more principled and better founded semantics of occasion sentences. Some of the insights elaborated ..."
Abstract
 Add to MetaCart
of occasion sentences to eternal sentences, as proposed by Russell and Quine, is semantically and thus logically inadequate. Natural language is a system of occasion sentences, eternal sentences being merely boundary cases. The logic has fewer tasks than is standardly assumed, as it excludes semantic calculi
Maintenance of Consistency in WellFounded Models of Extended Logic Programs with Explicit Negation
"... This paper deals with contradictory information in commonsense reasoning. It is often the case that our beliefs will become inconsistent when new knowledge is acquired and thus added. The traditional treatment of inconsistency is to simply regard inconsistent information useless, since everything i ..."
Abstract
 Add to MetaCart
source of inconsistency of beliefs is due to assumptions which were made to derive beliefs. We present an algorithm to eliminate inconsistency in paraconsistent wellfounded models of extended logic programs by using a basic assumptionbased truth maintenance system ATMS. The general idea of the algorithm
Pointfree foundations for (generic) lossless decomposition
, 2007
"... This report presents a typed, “pointfree ” generalization of relational data dependency theory expressed not in the standard settheoretic way, “à la Codd”, but in the calculus of binary relations which, initiated by De Morgan in the 1860s, is the core of modern algebra of programming. Contrary to t ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
theory paves the way to interesting synergies with other branches of computer science, namely formal modeling and transition systems theory. A number of open topics for research in the field are proposed as future work. Pointfree Foundations for (Generic) Lossless
Title of Document: QUANTUM MECHANICS AND QUANTUM INFORMATION THEORY
"... The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main quest ..."
Abstract
 Add to MetaCart
The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main
Results 21  30
of
486