A Sound and Complete Axiomatization of Majority- Logic
نویسندگان
چکیده
منابع مشابه
A Sound and Complete Axiomatization of Majority-n Logic
Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional synthesis tools. Also, the Boolean satisfiability problem finds new solution approaches when described in terms of majority decisions. To support computer logic applic...
متن کاملMajority Logic: Axiomatization and Completeness
Graded modal logic, as presented in [5], extends propositional modal systems with a set of modal operators ♦n (n ∈ N) that express “there are more than n accessible worlds such that...”. We extend∗ GML with a modal operator W that can express “there are more than or equal to half of the accessible worlds such that...”. The semantics of W is straightforward provided there are only finitely many ...
متن کاملA sound and complete axiomatization for Dynamic Topological Logic
Dynamic Topological Logic (DT L) is a multimodal system for reasoning about dynamical systems. It is defined semantically and, as such, most of the work done in the field has been model-theoretic. In particular, the problem of finding a complete axiomatization for the full language of DT L over the class of all dynamical systems has proven to be quite elusive. Here we propose to enrich the lang...
متن کاملTowards a Complete Axiomatization for Spatial Logic
The process-based Spatial Logics are multi-modal logics developed for semantics on Process Algebras and designed to specify concurrent properties of dynamic systems. On the syntactic level, they combine modal operators similar to operators of Hennessy-Milner logic, dynamic logic, arrow logic, relevant logic, or linear logic. This combination generates expressive logics, sometimes undecidable, f...
متن کاملSound and Complete Axiomatization of Trace Semantics for Probabilistic Systems
We present a sound and complete axiomatization of finite complete trace semantics for generative probabilistic transition systems. Our approach is coalgebraic, which opens the door to axiomatize other types of systems. In order to prove soundness and completeness, we employ determinization and show that coalgebraic traces can be recovered via determinization, a result interesting in itself. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2016
ISSN: 0018-9340
DOI: 10.1109/tc.2015.2506566