We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
We recall the concept of a linguistic variable and the representation of its values (i.e. linguistic terms) by means of fuzzy sets. In this framework adverbs are represented by fuz...
Abstract. The conditions under which a formal system for reasoning about structural specifications, built over one logical system could be reused for reasoning about structured spe...
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...