Sciweavers

4488 search results - page 173 / 898
» Properties of NP-Complete Sets
Sort
View
ENTCS
2002
112views more  ENTCS 2002»
13 years 8 months ago
Ambient Calculus and its Logic in the Calculus of Inductive Constructions
The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of t...
Ivan Scagnetto, Marino Miculan
IANDC
2010
119views more  IANDC 2010»
13 years 6 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder
JAIR
2011
72views more  JAIR 2011»
13 years 3 months ago
A Logical Study of Partial Entailment
We introduce a novel logical notion–partial entailment–to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with...
Y. Zhou, Y. Zhang
MSR
2011
ACM
12 years 11 months ago
A simpler model of software readability
Software readability is a property that influences how easily a given piece of code can be read and understood. Since readability can affect maintainability, quality, etc., prog...
Daryl Posnett, Abram Hindle, Premkumar T. Devanbu
PODS
2008
ACM
174views Database» more  PODS 2008»
14 years 8 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...