Resource separation in dynamic logic of propositional assignments
نویسندگان
چکیده
We extend dynamic logic of propositional assignments by adding an operator parallel composition that is inspired separation logics. provide axiomatization via reduction axioms, thereby establishing decidability. also prove the complexity both model checking and satisfiability problem stay in PSPACE.
منابع مشابه
Tableaux for Dynamic Logic of Propositional Assignments
The Dynamic Logic for Propositional Assignments (DL-PA) has recently been studied as an alternative to Propositional Dynamic Logic (PDL). In DL-PA, the abstract atomic programs of PDL are replaced by assignments of propositional variables to truth values. This makes DL-PA enjoy some interesting meta-logical properties that PDL does not, such as eliminability of the Kleene star, compactness and ...
متن کاملBelief Merging in Dynamic Logic of Propositional Assignments
We study syntactical merging operations that are defined semantically by means of the Hamming distance between valuations; more precisely, we investigate the Σ-semantics, Gmax-semantics and max-semantics. We work with a logical language containing merging operators as connectives, as opposed to the metalanguage operations of the literature. We capture these merging operators as programs of Dyna...
متن کاملJudgement Aggregation in Dynamic Logic of Propositional Assignments
Judgment aggregation studies situations where groups of agents take a collective decision over a number of logically interconnected issues. A recent stream of papers is dedicated to modelling frameworks of social choice theory, including judgment aggregation, within logical calculi usually designed ad hoc for this purpose. In contrast, we propose the use of dynamic logic of propositional assign...
متن کاملJudgment Aggregation in Dynamic Logic of Propositional Assignments
Judgment Aggregation studies how agents take a collective decision on a certain number of issues based on their individual opinions. In recent years, a line of research in Judgment Aggregation investigates how to model this framework within a logical calculus — usually designed ad hoc for this purpose. By contrast, in this thesis we show how it is possible to translate any aggregation problem f...
متن کاملBelief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments
We examine several belief change operations in the light of Dynamic Logic of Propositional Assignments DL-PA. We show that we can encode in a systematic way update operations (such as Winslett’s ‘Possible Models Approach’) and revision operations (such as Dalal’s) as particular DL-PA programs. Every DL-PA formula being equivalent to a boolean formula, we obtain syntactical counterparts for all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of logical and algebraic methods in programming
سال: 2021
ISSN: ['2352-2208', '2352-2216']
DOI: https://doi.org/10.1016/j.jlamp.2021.100683