The issue of updates in Disjunctive Deductive Databases DDDBs under the minimal model semantics is addressed. We consider ground clause addition and deletion in a DDDB. The approach of this paper is based on manipulating the clauses of the theory to produce the required change to the minimal model structure necessary to achieve the clause addition/deletion update. First we deal with ground positive clause updates in ground DDDBs. Later we consider positive then general clause addition deletion in the class of range restricted DDDBs. When we give more than one algorithm for a case we comment on the comparative merits and limitations of each. We use the freedom offered by the multiple possibilities for achieving an update to select the...
AbstractTwo main approaches have been followed in the literature to give a semantics to non-Horn dat...
Disjunctive deductive databases (DDDBs) capture indefinite information, i.e., imprecise or partial k...
AbstractWe present a new fixpoint characterization of the minimal models of disjunctive logic progra...
The issue of updates in Disjunctive Deductive Databases (DDDBs) under the minimal model semantics is...
In this paper we study the problem of updating disjunctive databases, which contain indefinite dat...
The concepts of the dual and complementary databases as alternative representations for a given dis...
Minimal models underly one of the major semantics for disjunctive theories and a substantial resear...
Generalized queries are defined as sets of clauses in implication form. They cover several tasks of ...
Algorithms for computing several classes of models for disjunctive normal databases are presented. W...
Minimal Herbrand models of sets of first-order clauses are useful in several areas of computer scien...
AbstractUnlike sets of definite Horn clauses, logic programs with disjunctions of atoms in clause he...
AbstractIn this paper, we show how techniques from first-order theorem proving can be used for effic...
It has been argued that some sort of control must be introduced in order to perform update operation...
In this paper, we prove that the problem of updating (monotonic) deductive databases (both insertion...
. It is well known that the minimal change principle was widely used in knowledge base updates. Howe...
AbstractTwo main approaches have been followed in the literature to give a semantics to non-Horn dat...
Disjunctive deductive databases (DDDBs) capture indefinite information, i.e., imprecise or partial k...
AbstractWe present a new fixpoint characterization of the minimal models of disjunctive logic progra...
The issue of updates in Disjunctive Deductive Databases (DDDBs) under the minimal model semantics is...
In this paper we study the problem of updating disjunctive databases, which contain indefinite dat...
The concepts of the dual and complementary databases as alternative representations for a given dis...
Minimal models underly one of the major semantics for disjunctive theories and a substantial resear...
Generalized queries are defined as sets of clauses in implication form. They cover several tasks of ...
Algorithms for computing several classes of models for disjunctive normal databases are presented. W...
Minimal Herbrand models of sets of first-order clauses are useful in several areas of computer scien...
AbstractUnlike sets of definite Horn clauses, logic programs with disjunctions of atoms in clause he...
AbstractIn this paper, we show how techniques from first-order theorem proving can be used for effic...
It has been argued that some sort of control must be introduced in order to perform update operation...
In this paper, we prove that the problem of updating (monotonic) deductive databases (both insertion...
. It is well known that the minimal change principle was widely used in knowledge base updates. Howe...
AbstractTwo main approaches have been followed in the literature to give a semantics to non-Horn dat...
Disjunctive deductive databases (DDDBs) capture indefinite information, i.e., imprecise or partial k...
AbstractWe present a new fixpoint characterization of the minimal models of disjunctive logic progra...