This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert code...
Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Rem...
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...