Premium
Domain circumscription: a reevaluation
Author(s) -
Etherington David W.,
Mercer Robert E.
Publication year - 1987
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1987.tb00177.x
Subject(s) - circumscription , rotation formalisms in three dimensions , axiom , predicate (mathematical logic) , natrix , domain (mathematical analysis) , computer science , mathematics , artificial intelligence , algorithm , programming language , zoology , mathematical analysis , geometry , biology
Some time ago, McCarthy developed the domain circumscription formalism for closed‐world reasoning. Recently, attention has been directed towards other circumscriptive formalisms. The best known of these, predicate and formula circumscription, cannot be used to produce domain‐closure axioms; nor does it appear likely that the other forms can. Since these axioms are important in deductive database theory (and elsewhere), and since domain circumscription often can conjecture these axioms, there is reason to resurrect domain circumscription.