
In this paper we present a refutation procedure to compute goals in a deductive database ac- cording to particular views of it. Views are de ned by a set of constraints rules. The declarative semantics of the constrained database is de ned and the given refutation procedure is proved correct and complete for positive range{restricted databases. The extension of the procedure to deal with negation is also outlined.
Mathematical logic: proof theory, Deduction and theorem proving: resolution, Mathematical logic: model theory, Mathematical logic: logic and constraint programming, integrity, SRP_IC refutation procedure, Deduction and theorem proving: deduction, General: security, and protection
Mathematical logic: proof theory, Deduction and theorem proving: resolution, Mathematical logic: model theory, Mathematical logic: logic and constraint programming, integrity, SRP_IC refutation procedure, Deduction and theorem proving: deduction, General: security, and protection
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
