Abstract | ||
---|---|---|
. Baral and Subrahmanian introduced the notion of stableclasses for normal logic programs. In contrast to stable models stableclasses always exist and can be given a constructive characterization.We generalize the Baral-Subrahmanian approach to disjunctive programsand propose mf -stable classes for different functions mf . Such mf -stableclasses always exist and are sound with respect to stable model semantics.Operationalizations for approximate but efficient query evaluationare defined... |
Year | DOI | Venue |
---|---|---|
1995 | 10.1007/3-540-59487-6_26 | LPNMR |
Keywords | Field | DocType |
stable classes,disjunctive programs,operator pairs,stable model semantics | Bitwise operation,Constructive,Computer science,Algorithm,Theoretical computer science,Stable model semantics | Conference |
Volume | ISBN | Citations |
928 | 3-540-59487-6 | 2 |
PageRank | References | Authors |
2.37 | 19 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jürgen Kalinski | 1 | 22 | 41.22 |