Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR'08)This work is about changing action domain descriptions in dynamic logic. We here revisit the semantics of action theory contraction, giving more robust operators that express minimal change based on a notion of distance between models. We then define syntactical contraction operators and establish their correctness w.r.t. our semantics. Finally we show that our operators satisfy the PDL-counterpart of the standard postulates for theory change adopted in the literature
When using tableaux algorithms to reason about Description Logics (DLs), new informa-tion is inferre...
. Certain constraints that should be interpreted as definitions or quasi-definitions can cause predi...
In this paper we investigate minimal semantics for Propositional Dynamic Logic formulas. The goal is...
This work is about changing action domain descriptions in dynamic logic. We here revisit the semanti...
As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a...
!2th Workshop on Nonmonotonic Reasoning (NMR'08)Like any other logical theory, action theories in re...
In this work we address the problem of elaborating domain descriptions (alias action theories), in p...
Traditionally, consistency is the only criterion for the quality of a theory in logic-based approach...
Traditionally, consistency is the only criterion for the quality of a theory in logic-based approach...
We present a decision-theoretically motivated notion of contraction which, we claim, encodes the pri...
International audienceIn this work we address the problem of elaborating domain descriptions (alias ...
The operation of contraction (referring to the removal of knowledge from a knowledge base) has been...
International audienceBuilding on a simple modal logic of context, the paper presents a dynamic logi...
This paper defines a minimal change semantics for PDL, that is based on minimization over a change o...
AbstractIncorporating new information into a knowledge base is an important problem which has been w...
When using tableaux algorithms to reason about Description Logics (DLs), new informa-tion is inferre...
. Certain constraints that should be interpreted as definitions or quasi-definitions can cause predi...
In this paper we investigate minimal semantics for Propositional Dynamic Logic formulas. The goal is...
This work is about changing action domain descriptions in dynamic logic. We here revisit the semanti...
As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a...
!2th Workshop on Nonmonotonic Reasoning (NMR'08)Like any other logical theory, action theories in re...
In this work we address the problem of elaborating domain descriptions (alias action theories), in p...
Traditionally, consistency is the only criterion for the quality of a theory in logic-based approach...
Traditionally, consistency is the only criterion for the quality of a theory in logic-based approach...
We present a decision-theoretically motivated notion of contraction which, we claim, encodes the pri...
International audienceIn this work we address the problem of elaborating domain descriptions (alias ...
The operation of contraction (referring to the removal of knowledge from a knowledge base) has been...
International audienceBuilding on a simple modal logic of context, the paper presents a dynamic logi...
This paper defines a minimal change semantics for PDL, that is based on minimization over a change o...
AbstractIncorporating new information into a knowledge base is an important problem which has been w...
When using tableaux algorithms to reason about Description Logics (DLs), new informa-tion is inferre...
. Certain constraints that should be interpreted as definitions or quasi-definitions can cause predi...
In this paper we investigate minimal semantics for Propositional Dynamic Logic formulas. The goal is...