Add to ORKGIn this dissertation, we investigate various sorts of rea-soning on finite structures and theories in the logic FO(·), a rich extension of classical logic with, amongst others, inductive definitions and aggregates. In par-ticular, we study the tasks of constraint propagation, grounding, model revision, and debugging for FO(·)
AbstractIn this paper we combine concepts from algebraic semantics and first-order logic programming...
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositio...
The logic of knowledge and justified assumptions, also known as the logic of grounded knowledge (GK)...
In this dissertation, we investigate various sorts of reasoning on finite structures and theories in...
The traditional approach to model expansion (generating models of a logic theory extending a partial...
The authors of [MT05] proposed a declarative constraint programming framework based on classical log...
In Constraint Programming, constraint propagation is a basic component of constraint satisfaction ...
Knowledge Representation and Reasoning is the area of artificial intelligence that is concerned with...
Abstract. This paper presents a Knowledge Base project for FO(ID), an exten-sion of classical logic ...
The field of Knowledge Representation is devoted to the study of how knowledge can be represented an...
This dissertation addresses some problems raised by the well-known intractability of deductive reaso...
Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (...
Grounding is the task of reducing a given first-order theory T and finite domain to an equivalent pr...
We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(F...
Abstract. Grounding is the task of reducing a given first-order theory T and finite domain to an equ...
AbstractIn this paper we combine concepts from algebraic semantics and first-order logic programming...
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositio...
The logic of knowledge and justified assumptions, also known as the logic of grounded knowledge (GK)...
In this dissertation, we investigate various sorts of reasoning on finite structures and theories in...
The traditional approach to model expansion (generating models of a logic theory extending a partial...
The authors of [MT05] proposed a declarative constraint programming framework based on classical log...
In Constraint Programming, constraint propagation is a basic component of constraint satisfaction ...
Knowledge Representation and Reasoning is the area of artificial intelligence that is concerned with...
Abstract. This paper presents a Knowledge Base project for FO(ID), an exten-sion of classical logic ...
The field of Knowledge Representation is devoted to the study of how knowledge can be represented an...
This dissertation addresses some problems raised by the well-known intractability of deductive reaso...
Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (...
Grounding is the task of reducing a given first-order theory T and finite domain to an equivalent pr...
We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(F...
Abstract. Grounding is the task of reducing a given first-order theory T and finite domain to an equ...
AbstractIn this paper we combine concepts from algebraic semantics and first-order logic programming...
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositio...
The logic of knowledge and justified assumptions, also known as the logic of grounded knowledge (GK)...