TY - JOUR
T1 - Logic programming and knowledge representation
AU - Baral, Chitta
AU - Gelfond, Michael
N1 - Funding Information:
Many people (knowingly or unknowingly) contributed to this survey by sharing with us their views on the field and particular results discussed in the paper. To all of them-our deepest thanks. We would like to thanka ll five refereesw hoses uggestionasn dc riticismh elpedu s to improvet he paper.S pecialt hanks also to G. Gottlobf or his help on the complexitys ection. This work was supportedin part by Grants NSF-IRI-92-I l-662, NSF-CDA-90-15-006a, ndN SF-IRI-91-03-112.
PY - 1994
Y1 - 1994
N2 - In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in artificial intelligence. We consider extensions of the language of definite logic programs by classical (strong) negation, disjunction, and some modal operators and show how each of the added features extends the representational power of the language. We also discuss extensions of logic programming allowing abductive reasoning, meta-reasoning and reasoning in open domains. We investigate the methodology of using these languages for representing various forms of nonmonotonic reasoning and for describing knowledge in specific domains. We also address recent work on properties of programs needed for successful applications of this methodology such as consistency, categoricity and complexity.
AB - In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in artificial intelligence. We consider extensions of the language of definite logic programs by classical (strong) negation, disjunction, and some modal operators and show how each of the added features extends the representational power of the language. We also discuss extensions of logic programming allowing abductive reasoning, meta-reasoning and reasoning in open domains. We investigate the methodology of using these languages for representing various forms of nonmonotonic reasoning and for describing knowledge in specific domains. We also address recent work on properties of programs needed for successful applications of this methodology such as consistency, categoricity and complexity.
UR - http://www.scopus.com/inward/record.url?scp=19244381332&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=19244381332&partnerID=8YFLogxK
U2 - 10.1016/0743-1066(94)90025-6
DO - 10.1016/0743-1066(94)90025-6
M3 - Article
AN - SCOPUS:19244381332
SN - 0743-1066
VL - 19-20
SP - 73
EP - 148
JO - The Journal of Logic Programming
JF - The Journal of Logic Programming
IS - SUPPL. 1
ER -