Sciweavers

111 search results - page 11 / 23
» Definability in Logic and Rough Set Theory
Sort
View
POPL
2004
ACM
14 years 7 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
ENTCS
2006
142views more  ENTCS 2006»
13 years 7 months ago
Specialization of Interaction Protocols in a Temporal Action Logic
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...
Laura Giordano, Alberto Martelli, Camilla Schwind
SLOGICA
2002
74views more  SLOGICA 2002»
13 years 7 months ago
Transfers between Logics and their Applications
In this paper, logics are conceived as two-sorted first-order structures, and we argue that this broad definition encompasses a wide class of logics with theoretical interest as w...
Marcelo E. Coniglio, Walter Alexandre Carnielli
JOLLI
2002
109views more  JOLLI 2002»
13 years 7 months ago
Linear, Branching Time and Joint Closure Semantics for Temporal Logic
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
Joeri Engelfriet, Jan Treur
AIA
2006
13 years 9 months ago
Some Semantics for a Logical Language for the Game of Dominoes
Epistemic logic allows to reason not only about situations, but also about the knowledge that a set of agents have about situations. In later years, epistemic logic has been appli...
Fernando R. Velázquez-Quesada, Francisco He...