1989
DOI: 10.1016/s0747-7171(89)80031-8
|View full text |Cite
|
Sign up to set email alerts
|

Stratification and knowledge base management

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

1992
1992
2011
2011

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…In analytical stratification, each stratum is determined by a specific name (label) and all elements from this stratum have this label (name). Knowledge base stratification used for handling inconsistent knowledge bases [56,57], for constructing models of a knowledge base [58] and for merging multiple knowledge bases [59,60] is analytical. The same is logic stratification used for formalization of commonsense reasoning [61].…”
Section: Stratification Of Knowledge Systemsmentioning
confidence: 99%
See 1 more Smart Citation
“…In analytical stratification, each stratum is determined by a specific name (label) and all elements from this stratum have this label (name). Knowledge base stratification used for handling inconsistent knowledge bases [56,57], for constructing models of a knowledge base [58] and for merging multiple knowledge bases [59,60] is analytical. The same is logic stratification used for formalization of commonsense reasoning [61].…”
Section: Stratification Of Knowledge Systemsmentioning
confidence: 99%
“…Benferhat and Garcia [57] employ stratification for handling inconsistent knowledge bases. Lassez, et al, [58] show how stratification can be used as a tool in the interactive model-building process. Namely it is possible to reduce the computational complexity of the process by the use of stratification, which limits consistency checking to minimal strata.…”
Section: Short-term Memorymentioning
confidence: 99%
“…By exploiting standard methods for testing whether a logic program is stratified (cf. [ 38 ] ), one can efficiently decide whether a given DDLP program P is N-acyclic in linear time in the size of P .…”
Section: Logic Programs With Double Negationmentioning
confidence: 99%
“…In this way it is possible to prove that the operator T corresponding to the program is monotone. A different approach was taken by C. Lassez, K. McAloon, and G. Port [1987] in data base management. Their stratification is not necessarily linear; it is a quasi-ordering of predicates in so-called disjunctive databases.…”
Section: Ivan Soskov Maximal Concepts Of Computability On Abstract Smentioning
confidence: 99%