Bisimilar and Logically Equivalent Programs in PDL
نویسندگان
چکیده
منابع مشابه
Possibilities of logically equivalent expressions
If A is logically equivalent to B, it is not necessary that #(A) = p(B). This technical note proves, however, that if A is in CNF, there exists some logically equivalent DNF, B, such that p(A) = #(B). It is well known that this admits anomalies, such as #(P/x ~P) > 0 and #(P v ~P) < 1. Further, two logically equivalent expressions can have different possibility values. For example, P v Q-~(P ^ ...
متن کاملLogically automorphically equivalent knowledge bases
Knowledge bases theory provide an important example of the field where applications of universal algebra and algebraic logic look very natural, and their interaction with practical problems arising in computer science might be very productive. In this paper we study the equivalence problem for knowledge bases. Our interest is to find out how the informational equivalence is related to the logic...
متن کاملInformation leakage from logically equivalent frames q
Framing effects are said to occur when equivalent frames lead to different choices. However, the equivalence in question has been incompletely conceptualized. In a new normative analysis of framing effects, we complete the conceptualization by introducing the notion of information equivalence. Information equivalence obtains when no choice-relevant inferences can be drawn from the speaker s cho...
متن کاملon the equivalence of constructed-response and multiple-choice : stem-equivalent, stem non-equivalent but content equivalent, and stem and content non-equivalent items in reading comprehension using multifaceted rasch
the present study investigated construct equivalence of multiple choice (mc) and constructed response (cr) item types across stem and content equivalent mc and cr items (item type ‘a’), non-stem-equivalent but content equivalent mc and cr items (item type ‘b’), and non-stem and non-content equivalent mc and cr items (item type ‘c’). one hundred seventy english-major undergraduates completed mc ...
PDL with Negation of Atomic Programs
Propositional dynamic logic (PDL) is one of the most successful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. A very natural and useful such extension is with negation of programs. Unfortunately, as long-known, reasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2014
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2014.06.002