In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91)
Cambridge, MA: AAAI/MIT Press, 1991.
Negation and Pro of by Contradiction in
Logic Access Limited
J M Crawford B J Kuip ers
Department of Computer Sciences
The University of Texas At Austin
Austin Texas
jc cs utexas edu
kuip ers cs utexas edu
Abstract of a tractable and So cratically Completeness inference
metho d for a language in which complete inference is
Access Limited Logic ALL is a language for
complete Co ok The heart known to b e NP
knowledge representation which formalizes the ac
of the extension is the addition of classical negation
cess limitations inherent in a network structured