Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

This account of propositional logic concentrates on the algorithmic translation of important
methods, especially of decision procedures for (subclasses of) propositional logic. Important …

Abstract Knowledge compilation is an AI technique for addressing computationally
demanding reasoning problems. In this paper we survey recent results in knowledge …

This book describes a method called “attribute exploration”, its applications, its theory, and
some of the many possible generalizations. The basic task is very simple: for a given list of …

A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We
study some problems related to the redundancy of a CNF formula. In particular, any CNF …

Horn knowledge bases are widely used in many applications. The paper is concerned with
the optimal compression of propositional Horn production rule bases-one of the most …

In fair division problems, we are given a set $ S $ of $ m $ items and a set $ N $ of $ n $
agents with individual preferences, and the goal is to find an allocation of items among …

Understanding a linguistic theory within OT requires an exact characterization of the ranking
conditions necessitated by data. These conditions determine the formal shape of the …

We report results about the redundancy of formulae in 2CNF form. In particular, we give a
slight improvement over the trivial redundancy algorithm and give some complexity results …

This paper studies functional dependencies in Horn theories, both when the theory is
represented by its clausal form and when it is defined as the Horn envelope of a set of …