Name
Abstract | ||
|---|---|---|
In this paper, we outline a proof procedure which combines reasoning with defined predicates together with reasoning with undefined, abducible, predicates. Defined predicates are defined in if-and-only-if form. Abducible predicates are constrained by means of integrity constraints. Given an initial query, the task of the proof procedure is to construct a definition of the abducible predicates and a substitution for the variables in the query, such that both the resulting instance of the query and the integrity constraints are implied by the extended set of definitions. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0743-1066(97)00026-5 | The Journal of Logic Programming |
Keywords | Field | DocType |
abductive logic programming,inference rule,integrity constraints | Discrete mathematics,Unification,Distributivity,Algorithm,Abductive logic programming,Data integrity,Soundness,Proof procedure,Completeness (statistics),Rule of inference,Mathematics | Journal |
Volume | Issue | ISSN |
33 | 2 | 0743-1066 |
Citations | PageRank | References |
123 | 5.71 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tze Ho Fung | 1 | 123 | 5.71 |
| Robert A. Kowalski | 2 | 4187 | 1066.36 |