Connections between default reasoning and partial constraint satisfaction

A. K. Ghose, G. Antoniou, R. G. Goebel, A. Sattar

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


This paper provides the foundation of connections between default reasoning and constraint satisfaction. Such connections are important because they combine fields with different strengths that complement each other: default reasoning is broadly seen as a promising method for reasoning from incomplete information, but is hard to implement. On the other hand, constraint satisfaction has evolved as a powerful, and efficiently implementable, problem solving paradigm in artificial intelligence. In this paper, we show how THEORIST knowledge bases and theories in Constrained Default Logic with prerequisite-free defaults may be mapped to partial constrained satisfaction problems. We also extend these results to deal with priorities among defaults.

Original languageEnglish
Pages (from-to)177-190
Number of pages14
JournalInformation Sciences
Issue number3-4
Publication statusPublished - 1 Aug 1999
Externally publishedYes


Dive into the research topics of 'Connections between default reasoning and partial constraint satisfaction'. Together they form a unique fingerprint.

Cite this