Logic programming and knowledge representation

Chitta Baral, Michael Gelfond

Research output: Contribution to journalArticle

254 Scopus citations

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 languageEnglish (US)
Pages (from-to)73-148
Number of pages76
JournalThe Journal of Logic Programming
Volume19-20
Issue numberSUPPL. 1
DOIs
StatePublished - Jan 1 1994
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Logic

Cite this