Results 1  10
of
32
Reaching agreements through argumentation: a logical model and implementation
 ARTIFICIAL INTELLIGENCE
, 1998
"... ..."
(Show Context)
A Modal Logic for Coalitional Power in Games
, 2002
"... We present a modal logic for reasoning about what groups of agents can bring about by collective action. Given a set of states, we introduce game frames which associate with every state a strategic game among the agents. Game frames are essentially extensive games of perfect information with simulta ..."
Abstract

Cited by 190 (6 self)
 Add to MetaCart
We present a modal logic for reasoning about what groups of agents can bring about by collective action. Given a set of states, we introduce game frames which associate with every state a strategic game among the agents. Game frames are essentially extensive games of perfect information with simultaneous actions, where every action profile is associated with a new state, the outcome of the game. A coalition of players is effective for a set of states # in a game if the coalition can guarantee the outcome of the game to lie in # . We propose a modal logic (Coalition Logic) to formalize reasoning about effectivity in game frames, where #### expresses that coalition # is effective for #. An axiomatization is presented and completeness proved. Coalition Logic provides a unifying gametheoretic view of modal logic: Since nondeterministic processes and extensive games without parallel moves emerge as particular instances of game frames, normal and nonnormal modal logics correspond to 1 and 2player versions of Coalition Logic. The satisfiability problem for Coalition Logic is shown to be PSPACEcomplete.
is modal logic so robustly decidable?, in
 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society
, 1996
"... vardi ..."
A ModelTheoretic Analysis of Knowledge
 in Proc. 25th IEEE Symposium on Foundations of Computer Science
, 1988
"... Understanding knowledge is a fundamental issue in many disciplines. In computer science, knowledge arises not only in the obvious contexts (such as knowledgebased systems), but also in distributed systems (where the goal is to have each processor "know" something, as in agreement protoc ..."
Abstract

Cited by 66 (12 self)
 Add to MetaCart
Understanding knowledge is a fundamental issue in many disciplines. In computer science, knowledge arises not only in the obvious contexts (such as knowledgebased systems), but also in distributed systems (where the goal is to have each processor "know" something, as in agreement protocols). A general semantic model of knowledge is introduced, to allow reasoning about statements such as "He knows that I know whether or not she knows whether or not it is raining." This approach more naturally models a state of knowledge than previous proposals (including Kripke structures). Using this notion of model, a model theory for knowledge is developed. This theory enables one to interpret the notion of a "finite amount of information". A preliminary version of this paper appeared in Proc. 25th IEEE Symp. on Foundations of Computer Science, 1984, pp. 268278. This version is essentially identical to the version that appears in Journal of the ACM 38:2, 1991, pp. 382428. y Part of th...
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 36 (19 self)
 Add to MetaCart
(Show Context)
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.
Reasoning About Knowledge: A Survey
 Handbook of Logic in Artificial Intelligence and Logic Programming
, 1995
"... : In this survey, I attempt to identify and describe some of the common threads that tie together work in reasoning about knowledge in such diverse fields as philosophy, economics, linguistics, artificial intelligence, and theoretical computer science, with particular emphasis on work of the past fi ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
(Show Context)
: In this survey, I attempt to identify and describe some of the common threads that tie together work in reasoning about knowledge in such diverse fields as philosophy, economics, linguistics, artificial intelligence, and theoretical computer science, with particular emphasis on work of the past five years, particularly in computer science. This articule is essentially the same as one that appears in Handbook of of Logic in Artificial Intelligence and Logic Programming, Vol. 4, D. Gabbay, C. J. Hogger, and J. A. Robinson, eds., Oxford University Press, 1995, pp. 134. It is a revised and updated version of a paper entitled "Reasoning about knowledge: a survey circa 1991", which appears in the Encyclopedia of Computer Science and Technology, Vol. 27, Supplement 12 (ed. A. Kent and J. G. Williams), Marcel Dekker, 1993, pp. 275296. That article, in turn is a revision of an article entitled "Reasoning About Knowledge: An Overview" that appears in Theoretical Aspects of Reasoning Abou...
Monotonic Modal Logics
, 2003
"... Monotonic modal logics form a generalization of normal modal logics... ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
(Show Context)
Monotonic modal logics form a generalization of normal modal logics...
SATBased Decision Procedures for Classical Modal Logics
 JOURNAL OF AUTOMATED REASONING
, 2000
"... We present a set of SATbased decision procedures for various classical modal logics. By SATbased, we mean built on top of a SAT solver. We show how the SATbased approach allows for a modular implementation for these logics. For some of the logics we deal with, we are not aware of any other implem ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
We present a set of SATbased decision procedures for various classical modal logics. By SATbased, we mean built on top of a SAT solver. We show how the SATbased approach allows for a modular implementation for these logics. For some of the logics we deal with, we are not aware of any other implementation. For the others, we dene a testing methodology which generalizes the 3CNFK methodology by Giunchiglia and Sebastiani. The experimental evaluation shows that our decision procedures perform better than or as well as other stateoftheart decision procedures.