Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 73-148 |
| Number of pages | 76 |
| Journal | The Journal of Logic Programming |
| Volume | 19-20 |
| Issue number | SUPPL. 1 |
| DOIs | |
| State | Published - 1994 |
| Externally published | Yes |
Fingerprint
ASJC Scopus subject areas
- Logic
Cite this
Logic programming and knowledge representation. / Baral, Chitta; Gelfond, Michael.
In: The Journal of Logic Programming, Vol. 19-20, No. SUPPL. 1, 1994, p. 73-148.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Logic programming and knowledge representation
AU - Baral, Chitta
AU - Gelfond, Michael
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
VL - 19-20
SP - 73
EP - 148
JO - Journal of Logic Programming
JF - Journal of Logic Programming
SN - 1567-8326
IS - SUPPL. 1
ER -