Results 11  20
of
607
Social laws in alternating time: Effectiveness, feasibility, and synthesis
 SYNTHESE (2007) 156:1–19
, 2007
"... Since it was first proposed by Moses, Shoham, and Tennenholtz, the social laws paradigm has proved to be one of the most compelling approaches to the offline coordination of multiagent systems. In this paper, we make four key contributions to the theory and practice of social laws in multiagent syst ..."
Abstract

Cited by 45 (17 self)
 Add to MetaCart
Since it was first proposed by Moses, Shoham, and Tennenholtz, the social laws paradigm has proved to be one of the most compelling approaches to the offline coordination of multiagent systems. In this paper, we make four key contributions to the theory and practice of social laws in multiagent systems. First, we show that the Alternatingtime Temporal Logic (atl) of Alur, Henzinger, and Kupferman provides an elegant and powerful framework within which to express and understand social laws for multiagent systems. Second, we show that the effectiveness, feasibility, and synthesis problems for social laws may naturally be framed as atl model checking problems, and that as a consequence, existing atl model checkers may be applied to these problems. Third, we show that the complexity of the feasibility problem in our framework is no more complex in the general case than that of the corresponding problem in the Shoham–Tennenholtz framework (it is npcomplete). Finally, we show how our basic framework can easily be extended to permit social laws in which constraints on the legality or otherwise of some action may be explicitly required. We illustrate the concepts and techniques developed by means of a running example.
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
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
A Sahlqvist theorem for distributive modal logic
 Annals of Pure and Applied Logic 131, Issues
, 2002
"... Dedicated to Bjarni Jónsson In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragment of classical propositional logic given by conjunction, disjunction, true, and false. For ..."
Abstract

Cited by 42 (13 self)
 Add to MetaCart
(Show Context)
Dedicated to Bjarni Jónsson In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragment of classical propositional logic given by conjunction, disjunction, true, and false. For these logics we define both algebraic semantics, in the form of distributive modal algebras, and relational semantics, in the form of ordered Kripke structures. The main contributions of this paper lie in extending the notion of Sahlqvist axioms to our generalized setting and proving both a correspondence and a canonicity result for distributive modal logics axiomatized by Sahlqvist axioms. Our proof of the correspondence result relies on a reduction to the classical case, but our canonicity proof departs from the traditional style and uses the newly extended algebraic theory of canonical extensions.
A Combined System for Update Logic and Belief Revision
, 2003
"... Abstract. In this paper we propose a logical system combining the update logic of A. Baltag, L. Moss and S. Solecki (to which we will refer to by the generic term BMS, [BMS04]) with the belief revision theory as conceived by C. Alchouròn, P. Gärdenfors and D. Mackinson (that we will call the AGM the ..."
Abstract

Cited by 41 (9 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we propose a logical system combining the update logic of A. Baltag, L. Moss and S. Solecki (to which we will refer to by the generic term BMS, [BMS04]) with the belief revision theory as conceived by C. Alchouròn, P. Gärdenfors and D. Mackinson (that we will call the AGM theory, [GardRott95]) viewed from the point of view of W. Spohn ( [Spohn90], [Spohn88]). We also give a proof system and a comparison with the AGM postulates. Introduction and Motivation: Update
A modal walk through space
 JOURNAL OF APPLIED NONCLASSICAL LOGICS
, 2002
"... We investigate the major mathematical theories of space from a modal standpoint: topology, affine geometry, metric geometry, and vector algebra. This allows us to see new finestructure in spatial patterns which suggests analogies across these mathematical theories in terms of modal, temporal, and ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
We investigate the major mathematical theories of space from a modal standpoint: topology, affine geometry, metric geometry, and vector algebra. This allows us to see new finestructure in spatial patterns which suggests analogies across these mathematical theories in terms of modal, temporal, and conditional logics. Throughout the modal walk through space, expressive power is analyzed in terms of language design, bisimulations, and correspondence phenomena. The result is both unification across the areas visited, and the uncovering of interesting new questions.
Semantic characterizations of navigational XPath
 SIGMOD Record
, 2005
"... We give semantic characterizations of the expressive power of navigational XPath (a.k.a. Core XPath) in terms of first order logic. XPath can be used to specify sets of nodes and sets of paths in an XML document tree. We consider both uses. For sets of nodes, XPath is equally expressive as first ord ..."
Abstract

Cited by 39 (6 self)
 Add to MetaCart
(Show Context)
We give semantic characterizations of the expressive power of navigational XPath (a.k.a. Core XPath) in terms of first order logic. XPath can be used to specify sets of nodes and sets of paths in an XML document tree. We consider both uses. For sets of nodes, XPath is equally expressive as first order logic in two variables. For paths, XPath can be defined using four simple connectives, which together yield the class of first order definable relations which are safe for bisimulation. Furthermore, we give a characterization of the XPath expressible paths in terms of conjunctive queries. 1
Expressive Logics for Coalgebras via Terminal Sequence Induction
 Notre Dame J. Formal Logic
, 2002
"... This paper introduces the proof principle of terminal sequence induction and shows, how terminal sequence induction can be used to obtain expressiveness results for logics, interpreted over coalgebras. ..."
Abstract

Cited by 39 (12 self)
 Add to MetaCart
This paper introduces the proof principle of terminal sequence induction and shows, how terminal sequence induction can be used to obtain expressiveness results for logics, interpreted over coalgebras.
PSPACE bounds for rank 1 modal logics
 IN LICS’06
, 2006
"... For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank1 logics enjoy a sh ..."
Abstract

Cited by 37 (19 self)
 Add to MetaCart
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACEbounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generic algorithm moreover finds tableau proofs that witness pleasant prooftheoretic properties including a weak subformula property. This generality is made possible by a coalgebraic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way.