1999
DOI: 10.1007/10703163_5
|View full text |Cite
|
Sign up to set email alerts
|

On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2000
2000
2002
2002

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…Now, if M i is a stable model for P i * , then every stable model for M i ∪ P i+1 is a stable model for the program P * i+1 . Therefore, the stable models of stratified choice programs can be computed by modifying the iterated fixpoint procedure used for stratified programs so that choice models (rather than the least models) are computed for strata containing choice rules (Giannotti et al, 1998).…”
Section: Definition 22mentioning
confidence: 99%
See 2 more Smart Citations
“…Now, if M i is a stable model for P i * , then every stable model for M i ∪ P i+1 is a stable model for the program P * i+1 . Therefore, the stable models of stratified choice programs can be computed by modifying the iterated fixpoint procedure used for stratified programs so that choice models (rather than the least models) are computed for strata containing choice rules (Giannotti et al, 1998).…”
Section: Definition 22mentioning
confidence: 99%
“…Generalizing such notion, the LDL++ system supports the use of choice in programs that are XY-stratified with respect to negation. The following conditions are, however, enforced to assure the existence of stable models for a given program P (Giannotti et al, 1998):…”
Section: Choice and Aggregates In Xy-stratified Programsmentioning
confidence: 99%
See 1 more Smart Citation