Several studies about complexity of NMR showed that inferring in non-monotonic knowledge bases is significantly harder than reasoning in monotonic ones. This contrasts with the general idea that NMR can be used to make knowledge representation and reasoning simpler, not harder. In this paper we show that, to some extent, NMR has fulfilled its goal. In particular we prove that circumscription allows for more compact and natural representation of knowledge. Results about intractability of circumscription can therefore be interpreted as the price one has to pay for having such an extra-compact representation. On the other hand, sometimes NMR really makes reasoning simpler; we give prototypical scenarios where closed-world reasoning accounts for a faster and unsound approximation of classical reasoning.

Is intractability of non-monotonic reasoning a real drawback? / Cadoli, Marco; Donini Francesco, M.; Schaerf, Marco. - 2:(1994), pp. 946-951. (Intervento presentato al convegno Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) tenutosi a Seattle, WA; USA).

Is intractability of non-monotonic reasoning a real drawback?

Cadoli Marco;Donini Francesco M.;Schaerf Marco
1994

Abstract

Several studies about complexity of NMR showed that inferring in non-monotonic knowledge bases is significantly harder than reasoning in monotonic ones. This contrasts with the general idea that NMR can be used to make knowledge representation and reasoning simpler, not harder. In this paper we show that, to some extent, NMR has fulfilled its goal. In particular we prove that circumscription allows for more compact and natural representation of knowledge. Results about intractability of circumscription can therefore be interpreted as the price one has to pay for having such an extra-compact representation. On the other hand, sometimes NMR really makes reasoning simpler; we give prototypical scenarios where closed-world reasoning accounts for a faster and unsound approximation of classical reasoning.
1994
Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2)
Computational complexity; Knowledge based systems; Circumscription, intractability
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Is intractability of non-monotonic reasoning a real drawback? / Cadoli, Marco; Donini Francesco, M.; Schaerf, Marco. - 2:(1994), pp. 946-951. (Intervento presentato al convegno Proceedings of the 12th National Conference on Artificial Intelligence. Part 1 (of 2) tenutosi a Seattle, WA; USA).
File allegati a questo prodotto
File Dimensione Formato  
Cadoli_Is-intractability_1994.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.05 MB
Formato Adobe PDF
1.05 MB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1325172
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? 15
social impact