Abstract. To find a minimal real change after an update of a database with integrity constraints (IC) expressed by an extended logic program is proven to be a Σp2-complete problem. We define a class of operators expanding the input updates correctly with respect to the IC. The par-ticular monotone expansion operator we describe is incrementally com-puted in square time. It provides a practical optimization of the standard complete choice algorithm resolving the update problem.
Integrity constraints are very useful in many contexts, such as, for example, deductive databases, a...
Abstract. We study revision programming, a logic-based mechanism for enforcing constraints on databa...
Several problems may arise when a deductive database is updated. The problems that are addressed in ...
We introduce a logic-based framework for database updating under constraints. In our framework, the ...
We present a procedure for deriving the weakest precondition for a database update and an integrity ...
An important characteristic for many formulations of knowledge representation and reasoning is that ...
The aim of this paper is to propose linear logic as a proof system allowing to perform updates of da...
In an active database, an update may be constrained by integrity constraints, and may also trigger r...
Integrity constraints are useful for the specification of deductive databases, as well as for induct...
In his paper “Making Counterfactual Assumptions ” Frank Veltman has proposed a new semantics for cou...
International audienceIn his paper ``Making Counterfactual Assumptions'' Frank Veltman has proposed ...
In his paper ``Making Counterfactual Assumptions\u27\u27 Frank Veltman has proposed a new semantics ...
In his paper ``Making Counterfactual Assumptions\u27\u27 Frank Veltman has proposed a new semantics ...
AbstractIntegrity constraints are useful for the specification of deductive databases, as well as fo...
In the field of logic databases the static semantics and the evaluation of queries is well understoo...
Integrity constraints are very useful in many contexts, such as, for example, deductive databases, a...
Abstract. We study revision programming, a logic-based mechanism for enforcing constraints on databa...
Several problems may arise when a deductive database is updated. The problems that are addressed in ...
We introduce a logic-based framework for database updating under constraints. In our framework, the ...
We present a procedure for deriving the weakest precondition for a database update and an integrity ...
An important characteristic for many formulations of knowledge representation and reasoning is that ...
The aim of this paper is to propose linear logic as a proof system allowing to perform updates of da...
In an active database, an update may be constrained by integrity constraints, and may also trigger r...
Integrity constraints are useful for the specification of deductive databases, as well as for induct...
In his paper “Making Counterfactual Assumptions ” Frank Veltman has proposed a new semantics for cou...
International audienceIn his paper ``Making Counterfactual Assumptions'' Frank Veltman has proposed ...
In his paper ``Making Counterfactual Assumptions\u27\u27 Frank Veltman has proposed a new semantics ...
In his paper ``Making Counterfactual Assumptions\u27\u27 Frank Veltman has proposed a new semantics ...
AbstractIntegrity constraints are useful for the specification of deductive databases, as well as fo...
In the field of logic databases the static semantics and the evaluation of queries is well understoo...
Integrity constraints are very useful in many contexts, such as, for example, deductive databases, a...
Abstract. We study revision programming, a logic-based mechanism for enforcing constraints on databa...
Several problems may arise when a deductive database is updated. The problems that are addressed in ...