The IDP framework is a declarative problem solving paradigm, in which the computational task is to expand a given finite interpretation of a set of symbols into a model of a given ID-logic theory, a… (More)

A grounding of a formulaφ over a given finite domain is a ground formula which is equivalent toφ on that domain. Very effective propositional solvers have m ade grounding-based methods for problem… (More)

The logic FO(ID) extends classical first order logic with inductive definitions. This paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for… (More)

Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning systems. Such systems… (More)

This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the level of declarative… (More)

Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain elements and… (More)

We study the transformation of “predicate introduction” in non-monotonic logics. By this, we mean the act of replacing a complex formula by a newly defined predicate. From a knowledge representation… (More)

Many computational settings are concerned with finding (all) models of a first-order logic theory for a fixed, finite domain. In this paper, we present a method to compute from a given theory and… (More)