Add to ORKGAbstract. Grounding is the task of reducing a given first-order theory T and finite domain to an equivalent propositional theory. It is used as preprocessing step in many logic-based reasoning systems. In this paper, we present a method to improve grounding for FO(ID), the extension of first-order logic with inductive definitions. The method consists of com-puting bounds for subformulas of T, indicating for which part of the given domain, the truth value of their subformula is the same in every model of T. Bounds can be used to efficiently produce compact groundings. We present both theoretical results and experiments to support this claim.
In this paper, we present GidL, a grounder for FO+. FO+ is a very expressive extension of first-orde...
In the field of knowledge representation and reasoning, many different logics are developed. Often, ...
We define a class of formal systems inspired by Prawitz’s theory of grounds. The latter is a semanti...
Grounding is the task of reducing a given first-order theory T and finite domain to an equivalent pr...
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositio...
In this dissertation, we investigate various sorts of reasoning on finite structures and theories in...
Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (...
The Problem of Iterated Ground is to explain what grounds truths about ground: if Γ grounds φ, what ...
AbstractIn the context of the abstract interpretation theory, we study the relations among various a...
Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (...
The traditional approach to model expansion (generating models of a logic theory extending a partial...
International audienceThe notion of grounding is usually conceived as an objective and explanatory r...
AbstractIt is well known that propositional formulas form a useful and computationally efficient abs...
AbstractWorking within a semantic framework for sequent calculi developed in [3], we propose a coupl...
In this paper, we present GIDL, a grounder for FO+. FO+ is a very expressive extension of first-orde...
In this paper, we present GidL, a grounder for FO+. FO+ is a very expressive extension of first-orde...
In the field of knowledge representation and reasoning, many different logics are developed. Often, ...
We define a class of formal systems inspired by Prawitz’s theory of grounds. The latter is a semanti...
Grounding is the task of reducing a given first-order theory T and finite domain to an equivalent pr...
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositio...
In this dissertation, we investigate various sorts of reasoning on finite structures and theories in...
Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (...
The Problem of Iterated Ground is to explain what grounds truths about ground: if Γ grounds φ, what ...
AbstractIn the context of the abstract interpretation theory, we study the relations among various a...
Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (...
The traditional approach to model expansion (generating models of a logic theory extending a partial...
International audienceThe notion of grounding is usually conceived as an objective and explanatory r...
AbstractIt is well known that propositional formulas form a useful and computationally efficient abs...
AbstractWorking within a semantic framework for sequent calculi developed in [3], we propose a coupl...
In this paper, we present GIDL, a grounder for FO+. FO+ is a very expressive extension of first-orde...
In this paper, we present GidL, a grounder for FO+. FO+ is a very expressive extension of first-orde...
In the field of knowledge representation and reasoning, many different logics are developed. Often, ...
We define a class of formal systems inspired by Prawitz’s theory of grounds. The latter is a semanti...