Sciweavers

605 search results - page 7 / 121
» Dealing with logical omniscience
Sort
View
FAC
2010
93views more  FAC 2010»
13 years 4 months ago
Inter-process buffers in separation logic with rely-guarantee
Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of...
Richard Bornat, Hasan Amjad
DLOG
2009
13 years 5 months ago
Quasi-Classical Semantics for Expressive Description Logics
Abstract. Inconsistency handling in expressive description logics is an important problem because inconsistency may naturally occur in an open world. In this paper, we present the ...
Xiaowang Zhang, Guilin Qi, Yue Ma, Zuoquan Lin
DLOG
2007
13 years 10 months ago
A Possibilistic Extension of Description Logics
Possibilistic logic provides a convenient tool for dealing with inconsistency and handling uncertainty. In this paper, we propose possibilistic description logics (DLs) as an exten...
Guilin Qi, Jeff Z. Pan, Qiu Ji
CCS
2005
ACM
14 years 1 months ago
PeerAccess: a logic for distributed authorization
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
Marianne Winslett, Charles C. Zhang, Piero A. Bona...
ATAL
2007
Springer
14 years 1 months ago
An adversarial environment model for bounded rational agents in zero-sum interactions
Multiagent environments are often not cooperative nor collaborative; in many cases, agents have conflicting interests, leading to adversarial interactions. This paper presents a ...
Inon Zuckerman, Sarit Kraus, Jeffrey S. Rosenschei...