Semantic forcing in disjunctive logic programs

Computational Intelligence

Volumn 17, Issue 4, 2001, Pages 651-684

  De Vos, Marina ^a   Vermeir, Dirk ^a  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS; SEMANTICS; SET THEORY;

DISJUNCTIVE-FREE LOGIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 0035510131     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00168     Document Type: Article

References (22)

1. Logic programming and knowledge representation
2. Generalised well-fouded semantics for logic programs
3. A posible world semantics for disjunctive databases
4. On the partial semantics for disjunctive deductive databases
5. The stable model semantics for logic programming
6. Unfounded sets and well-founded semantics for general logic programs
7. The well-founded semantics for general logic programs
8. Preferred extensions are partial stable models
9. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
10. Logic programming semantics made easy
11. Stable semantics for disjunctive programs
12. Computing stable and partial stable models of extended disjunctive logic programs
13. Forcing in model theory
14. The well-founded semantics for disjuncted logic programs
15. Possible model semantics for disjunctive databases (preliminary report)
16. An alternative approach to the semantics of disjunctive logic programs and deductive databases
17. Stable models and non-determinism in logic programs with negation
18. Skeptical reason maintenance and belief revision
19. Three-valued formalization of logic programming: Is it needed?
20. On the equivalence of semantics for normal logic programs
21. Regular extension semantics and disjunctive eshghi-kowalski procedure