Implementing prioritized logic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1609, Issue , 1999, Pages 85-93

  Wu, Cheng Min ^a   Zhang, Yan ^a  

^a UNIVERSITY OF WESTERN SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; INTELLIGENT SYSTEMS; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

CONFLICT RESOLUTION; EXTENDED LOGIC; KNOWLEDGE REPRESENTATION AND REASONING; LOGIC PROGRAMS; NON-TRIVIAL; PRIORITIZED LOGIC PROGRAMS; REASONING MECHANISM; STABLE MODEL;

COMPUTER CIRCUITS;

EID: 84957701390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0095093     Document Type: Conference Paper

References (4)

1. G. Brewka, Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research, 4 (1996) 19-36.
2. I. Niemelä and P. Simons, Efficient implementation of the well-founded and stable model semantics. International Joint Conference and Symposium on Logic programming (IJCSLP '96), pp 289-303, 1996.
3. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases. New Generation Computing, 9: 365-386, 1991.
4. Y. Zhang and N. Y. Foo, Answer sets for prioritized logic programs. In Procceedings of the 1997 International Logic Programming Symposium (ILPS'97), pp69-83. MIT Press, 1997.