Results 1  10
of
172
LTL over description logic axioms
 In Proceedings of DL08, CEUR Workshop Proceedings. CEURWS.org
, 2008
"... In many applications of Description Logics (DLs) [7], such as the use of DLs as ontology languages or conceptual modeling languages, being able to represent dynamic aspects of the application domain would be quite useful. This is, for instance, the case if one wants to use DLs as conceptual modeling ..."
Abstract

Cited by 43 (13 self)
 Add to MetaCart
(Show Context)
In many applications of Description Logics (DLs) [7], such as the use of DLs as ontology languages or conceptual modeling languages, being able to represent dynamic aspects of the application domain would be quite useful. This is, for instance, the case if one wants to use DLs as conceptual modeling languages
Relationshipbased access control: protection model and policy language
 In: Proceedings of the First ACM Conference on Data and Application Security and Privacy (CODASPY 2011
"... Social Network Systems pioneer a paradigm of access control that is distinct from traditional approaches to access control. Gates coined the term RelationshipBased Access Control (ReBAC) to refer to this paradigm. ReBAC is characterized by the explicit tracking of interpersonal relationships betwee ..."
Abstract

Cited by 40 (7 self)
 Add to MetaCart
(Show Context)
Social Network Systems pioneer a paradigm of access control that is distinct from traditional approaches to access control. Gates coined the term RelationshipBased Access Control (ReBAC) to refer to this paradigm. ReBAC is characterized by the explicit tracking of interpersonal relationships between users, and the expression of access control policies in terms of these relationships. This work explores what it takes to widen the applicability of ReBAC to application domains other than social computing. To this end, we formulate an archetypical ReBAC model to capture the essence of the paradigm, that is, authorization decisions are based on the relationship between the resource owner and the resource accessor in a social network maintained by the protection system. A novelty of the model is that it captures the contextual nature of relationships. We devise a policy language, based on modal logic, for composing access control policies that support delegation of trust. We use a case study in the domain of Electronic Health Records to demonstrate the utility of our model and its policy language. This work provides initial evidence to the feasibility and utility of ReBAC as a generalpurpose paradigm of access control.
Reasoning over Extended ER Models
 PROCEEDINGS OF ER 2007
, 2007
"... Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended EntityRelationship (EER) language, which includes a number of constructs: ISA between entities and relationships, disjointness and covering of entities and relationships, cardinality constraint ..."
Abstract

Cited by 33 (16 self)
 Add to MetaCart
(Show Context)
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended EntityRelationship (EER) language, which includes a number of constructs: ISA between entities and relationships, disjointness and covering of entities and relationships, cardinality constraints for entities in relationships and their refinements as well as multiplicity constraints for attributes. We extend the known EXPTIMEcompleteness result for UML class diagrams [5] and show that reasoning over EER diagrams with ISA between relationships is EXPTIMEcomplete even without relationship covering. Surprisingly, reasoning becomes NPcomplete when we drop ISA between relationships (while still allowing all types of constraints on entities). If we further omit disjointness and covering over entities, reasoning becomes polynomial. Our lower complexity bound results are proved by direct reductions, while the upper bounds follow from the correspondences with expressive variants of the description logic DLLite, which we establish in this paper. These correspondences also show the usefulness of DLLite as a language for reasoning over conceptual models and ontologies.
A Logical Analysis of Aliasing in Imperative HigherOrder Functions
 INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING, ICFP’05
, 2005
"... We present a compositional program logic for callbyvalue imperative higherorder functions with general forms of aliasing, which can arise from the use of reference names as function parameters, return values, content of references and part of data structures. The program logic ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
We present a compositional program logic for callbyvalue imperative higherorder functions with general forms of aliasing, which can arise from the use of reference names as function parameters, return values, content of references and part of data structures. The program logic
Connecting ManySorted Theories’, The
 Journal of Symbolic Logic
, 2007
"... Abstract. Basically, the connection of two manysorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must behave like homomorphisms on the shared signature. We determine conditions under which decidability of the validity of ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
(Show Context)
Abstract. Basically, the connection of two manysorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must behave like homomorphisms on the shared signature. We determine conditions under which decidability of the validity of universal formulae in the component theories transfers to their connection. In addition, we consider variants of the basic connection scheme. Our results can be seen as a generalization of the socalled Econnection approach for combining modal logics to an algebraic setting. §1. Introduction. The combination of decision procedures for logical theories arises in many areas of logic in computer science, such as constraint solving, automated deduction, term rewriting, modal logics, and description logics. In general, one has two firstorder theories T1 and T2 over signatures Σ1 and Σ2, for which validity of a certain type of formulae (e.g., universal, existential positive,
Preference logic, conditionals, and solution concepts in games
 Krister Segerberg. University of Uppsala
, 2005
"... Preference is a basic notion in human behaviour, underlying such varied phenomena as individual rationality in the philosophy of action and game theory, obligations in deontic logic (we should aim for the best of all possible worlds), or collective decisions in social choice theory. Also, in a more ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
(Show Context)
Preference is a basic notion in human behaviour, underlying such varied phenomena as individual rationality in the philosophy of action and game theory, obligations in deontic logic (we should aim for the best of all possible worlds), or collective decisions in social choice theory. Also, in a more
Erdős Graphs Resolve Fine's Canonicity Problem
 THE BULLETIN OF SYMBOLIC LOGIC
, 2003
"... We show that there exist 2^ℵ0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any firstorder definable class of relational structures. Using a variant of this construction, we resolve a longstanding question of Fine, by exhibiting ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
We show that there exist 2^&alefsym;0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any firstorder definable class of relational structures. Using a variant of this construction, we resolve a longstanding question of Fine, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any firstorder definable class of Kripke frames. The constructions use the result of Erdős that there are finite graphs with arbitrarily large chromatic number and girth.
Terminating tableau systems for hybrid logic with difference and converse
, 2009
"... This paper contributes to the principled construction of tableaubased decision procedures for hybrid logic with global, difference, and converse modalities. We also consider reflexive and transitive relations. For conversefree formulas we present a terminating control that does not rely on the usu ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
(Show Context)
This paper contributes to the principled construction of tableaubased decision procedures for hybrid logic with global, difference, and converse modalities. We also consider reflexive and transitive relations. For conversefree formulas we present a terminating control that does not rely on the usual chainbased blocking scheme. Our tableau systems are based on a new model existence theorem.
Dynamic epistemic temporal logic
 Interaction, Second International Workshop
"... We propose Dynamic Epistemic Temporal Logic, a dynamicprotocol framework that overcomes the Problem of Synchronicity in the popular Dynamic Epistemic Logic approach to reasoning about multiagent belief change. Dynamic Epistemic Temporal Logic not only extends the domain of applicability of standar ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
We propose Dynamic Epistemic Temporal Logic, a dynamicprotocol framework that overcomes the Problem of Synchronicity in the popular Dynamic Epistemic Logic approach to reasoning about multiagent belief change. Dynamic Epistemic Temporal Logic not only extends the domain of applicability of standard Dynamic Epistemic Logic, but it also clarifies how certain structural properties (such as synchronicity) arise from the inherent structure of the standard “update frames ” (or “action models”) of Dynamic Epistemic Logic. 1