In this paper we consider two logics: temporal logic of common knowledge and temporal logic of common belief. These logics involve the discrete time linear temporal logic operators...
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
In this paper we propose computationally simple, pointwise formulas for extended t-norms and t-conorms on fuzzy truth values. The complex convolutions of the extended operations a...
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...