Two results for prioritized logic programming

Theory and Practice of Logic Programming

Volumn 3, Issue 2, 2003, Pages 223-242

  Zhang, Yan ^a  

^a UNIVERSITY OF WESTERN SYDNEY   (Australia)

Author keywords

Knowledge representation; Nonmonotonic reasoning; Prioritized logic programs

Indexed keywords

KNOWLEDGE REPRESENTATION; SEMANTICS; SET THEORY; THEOREM PROVING;

NONMONOTONIC REASONING; SPLITTING TECHNIQUES;

LOGIC PROGRAMMING;

EID: 0344531469     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068402001552     Document Type: Article

References (16)

1. Apt, K. R. and Bol, R. N. (1994) Logic programming and negation: A survey. J. Logic Program. 19,20, 9-71.
2. Brewka, G. (1996) Well-founded semantics for extended logic programs with dynamic preferences. J. Artif. Intell. Res. 4, 19-36.
3. Brewka, G. and Eiter, T. (1999) Preferred answer sets for extended logic programs. Artif. Intell. 109, 297-356.
4. Choelwinski, P. (1994) Stratified default logic. Proceedings Computer Science Logic: Lecture Notes in Computer Science 933, pp. 456-470. Springer-Verlag.
5. Das, S. K. (1992) Deductive Database and Logic Programming. Addison-Wesley.
6. Delgrande, J., Schaub, T. and Tompits, H. (2000) Logic programs with complied preferences. Proceedings 14th European Conference on Artificial Intelligence (ECAI-2000), pp. 392-398.
7. Gelfond, M. and Lifschitz, V. (1988) The stable model semantics for logic programming. Proceedings 5th Joint International Conference and Symposium, pp. 1070-1080. MIT Press.
8. Gelfond, M. and Lifschitz, V. (1991) Classical negation in logic programs and disjunctive databases. New Generat. Comput. 9, 365-386.
9. Gelfond, M. and Son, T. C. (1998) Reasoning with prioritized defaults. Lecture Notes in Artificial Intelligence 1471, pp. 164-224. Springer-Verlag.
10. Grosof, B. N. (1997) Prioritized conflict handling for logic programs. Proceedings International Logic Program Symposium (ILPS'97), pp. 197-212. MIT Press.
11. Lifschitz, V. and Turner, H. (1994) Splitting a logic program. Proceedings 11th International Conference on Logic Programming, pp. 23-37. MIT Press.
12. Schaub, T. and Wang, K. (2001) A comparative study of logic programs with preference. Proceedings 17th International Joint Conference on Artificial Intelligence (IJCAI-2001), pp. 597-602. Morgan-Kaufmann.
13. Wang, K., Zhou, L. and Lin, F. (2000) Alternating fixpoint theory for logic programs with priority. Proceedings International Joint Conference on Computational Logic (CL-2000), pp. 164-178.
14. Zhang, Y. (1999) Monotonicity in rule based update. Proceedings International Conference on Logic Programming (ICLP'99), pp. 471-485. MIT Press.
15. Zhang, Y. (2001) The complexity of logic program update. Proceedings 14th Australian Joint Conference on Artificial Intelligence (AI2001): Lecture Notes in Artificial Intelligence 2256, pp. 630-643. Springer-Verlag.
16. Zhang, Y. and Foo, N. Y. (1997) Answer sets for prioritized logic programs. Proceedings International Logic Programming Symposium (ILPS'97), pp. 69-83. MIT Press.