Verifying local stratifiability of logic programs and databases |
| |
Authors: | Yi-Dong Shen |
| |
Affiliation: | 1. Department of Computer Science, Chongqing University, 630044, Chongqing, P. R. China
|
| |
Abstract: | In this paper, we deal with the problem of verifying local stratifiability of logic programs and databases presented by Przymusinski.
The notion of dependency graphs is generalized from representing the priority relation between predicate symbols to representing
the priority between atoms. Necessary and sufficient conditions for the local stratifiability of logic programs are presented
and algorithms for performing the verification are developed. Finally, we prove that a database DB containing clauses with
disjunctive consequents can easily be converted into a logic program P such that DB is locally stratified iff P is locally
stratified.
Yi-Dong Shen, Dr.: Department of Computer Science, Chongqing University, Chongqing, 630044, P.R. China (Present Address) c/o Ping Ran, Department
of Heat Power Engineering, Chongqing UniversityResearch interests: Artificial Intelligence, Deductive Databases, Logic Programming, Non-Monotonic Reasoning, Parallel Processing |
| |
Keywords: | Logic Programming Deductive Databases Local Stratifiability Verification Algorithms |
本文献已被 SpringerLink 等数据库收录! |
|