Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...