BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrain...
Abstract. Results in social choice theory such as the Arrow and GibbardSatterthwaite theorems constrain the existence of rational collective decision making procedures in groups of...