Skip to main content

A local handling of inconsistent knowledge and default bases

  • Chapter
  • First Online:
Applications of Uncertainty Formalisms

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1455))

Abstract

This paper contains two parts: we first investigate the idea of reasoning, in a “local” way, with prioritized and possibly inconsistent knowledge bases. Priorities are not given globally between all the beliefs in the knowledge base, but locally within each minimal set of pieces of information responsible for inconsistencies. This local stratification offers more flexibility for representing priorities between beliefs. When this stratification is available, we show that the task of coping with inconsistency is greatly simplified, since it determines what beliefs must be removed in order to restore consistency in the knowledge base. Three local approaches are developed in this paper. The second part of the paper applies one of these three approaches to default reasoning. Our proposal for defining the specificity relation inside conflicts allows us to infer plausible conclusions which cannot be obtained if a global stratification is used. In each part, we provide a comparative study with existing inconsistency-handling approaches and with various default reasoning systems, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.W. Adams (1975). The logic of conditionals. D. Reidel.

    Google Scholar 

  2. S. Benferhat, D. Dubois and H. Prade (1992). Representing default rules in possibilistic logic. Proc. of the 3rd Inter. Conf. on Principles of Knowledge Representation and Reasoning (KR’92). 673–684.

    Google Scholar 

  3. S. Benferhat, C. Cayrol, D. Dubois, J. Lang and H. Prade (1993). Inconsistency management and prioritized syntax-based entailment. Proc. of the 13th Inter. Joint Conf. on Artificial Intelligence (IJCAI’93). 640–645.

    Google Scholar 

  4. S. Benferhat, D. Dubois and H. Prade (1995). How to infer from inconsistent beliefs without revising? Proc. of the 14th Inter. Joint Conf. on Artificial Intelligence (IJCAI’95). 1449–1455. Extended version of this paper: Some syntactic approaches to the handling of inconsistent knowledge bases: a comparative study. Technical report IRIT/94-55-R.

    Google Scholar 

  5. S. Benferhat, A. Saffiotti and P. Smets (1995). Belief functions and default reasoning. Proc. of Uncertainty in Artificial Intelligence (UAI’95). 19–26.

    Google Scholar 

  6. S. Benferhat, D. Dubois et H. Prade (1997) Possibilistic and standard probabilistic semantics of conditional knowledge. Proc. of the 14th National Conf. on Artificial Intelligence (AAAI’97), pp. 70–75.

    Google Scholar 

  7. W. Bibel (1985). Methods of automated reasoning. Fundamentals in Artificial Intelligence, LNCS 232.

    Google Scholar 

  8. C. Boutilier (1992). What is a Default priority? Proc. of the 9th Canadian Conf. on Artificial Intelligence (AI’92). 140–147.

    Google Scholar 

  9. G. Brewka (1989). Preferred subtheories: an extended logical framework for default reasoning. Proc. of the 11th Inter. Joint Conf. on Artificial Intelligence (IJCAI’89). 1043–1048.

    Google Scholar 

  10. G. Brewka (1994). Reasoning about priorities in default logic. Proc. of the 1994 National Conf. on Artificial Intelligence (AAAI’94). 940–945.

    Google Scholar 

  11. T. Castell, C. Cayrol, M. Cayrol and D. Le Berre (1996). Using the Davis and Putnam procedure for an efficient computation of preferred models. Proc. of the 12th European Conference on Artificial Intelligence (ECAI’96). 350–354.

    Google Scholar 

  12. C. Cayrol (1995). On the relation between argumentation and non-monotonic coherence-based entailment. Proc. of the 14th Inter. Joint Conf. on Artificial Intelligence (IJCAI’95). 1443–1448.

    Google Scholar 

  13. C. Cayrol and M.C. Lagasquie-Schiex (1994). On the complexity of nonmonotonic entailment in syntax-based approaches. Proc. of Workshop ECAI’94 on Algorithms, Complexity and Commonsense Reasoning.

    Google Scholar 

  14. L. Cholvy (1995). Automated reasoning with merged contradictory information whose reliability depends on topics. Proc. of the 1995 European Conference on Symbolic and Quantitative Approaches to Reasoning under Uncertainty (ECSQARU’95).

    Google Scholar 

  15. N. C. A. Da Costa (1963). Calcul propositionnel pour les systèmes formels inconsistants. Compte Rendu Acad. des Sciences (Paris), 257. 3790–3792.

    MATH  Google Scholar 

  16. N.C.A. Da Costa and D. Marconi (1987). An overview of paraconsistent logic in the 80s. Monografias da Sociedade Paranense de Matematica.

    Google Scholar 

  17. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Assoc. for Computing Machinery, 7. 201–215.

    Google Scholar 

  18. J. De Kleer (1986). An assumption-based TMS. Artificial Intelligence, 28. 127–162.

    Article  Google Scholar 

  19. J. De Kleer (1990). Using crude probability estimates to guide diagnosis. Artificial Intelligence, 45. 381–391.

    Article  Google Scholar 

  20. J. De Kleer and B. C. Williams (1987). Diagnosing multiple faults. Artificial Intelligence, 32. 97–130.

    Article  Google Scholar 

  21. J. P. Delgrande and T. H. Schaub (1994). A general approach to specificity in default reasoning. Proc. of the 4th Inter. Conf. on Principles of Knowledge Representation and Reasoning (KR’94). 146–157.

    Google Scholar 

  22. D. Dubois, J. Lang and H. Prade (1994). Possibilistic logic. Handbook of Logic in A. I. and Logic Programming, vol. 3. 439–513.

    MathSciNet  MATH  Google Scholar 

  23. M. Elvang-Goransson, P. Krause and J. Fox (1993). Dialectic reasoning with inconsistent information. Proc. of Uncertainty in Artificial Intelligence (UAI’93). 114–121.

    Google Scholar 

  24. R. Fagin, J. D. Ullman and M. Y. Vardi (1983). On the semantics of updates in database. Proc. of the 2nd ACM SIGACT-SIGMOD Symp. on the Principles of Databases Systems. 352–365.

    Google Scholar 

  25. D.M. Gabbay and A. Hunter (1991). Making inconsistency respectable (Part 1). Fundamentals of Artificial Intelligence Research, LNAI 535. 19–32.

    Google Scholar 

  26. P. Gärdenfors (1988). Knowledge in flux-Modeling the dynamic of epistemic states. MIT Press.

    Google Scholar 

  27. H. Geffner (1992). Default reasoning: Causal and conditional theories. MIT Press.

    Google Scholar 

  28. S. Kraus, D. Lehmann and M. Magidor (1990). Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44. 167–207.

    Article  MathSciNet  Google Scholar 

  29. D. Lehmann (1993). Another perspective on default reasoning. Technical report. Hebrew University, Jerusalem.

    MATH  Google Scholar 

  30. D. Lehmann and M. Magidor (1992). What does a conditional knowledge base entail? Artificial Intelligence, 55. 1–60.

    Article  MathSciNet  Google Scholar 

  31. D. Makinson (1989). General theory of cumulative inference. Non-monotonic reasoning, LNCS 346. 1–18.

    Chapter  Google Scholar 

  32. Y. Moinard (1987). Donner la préférence au défaut le plus spécifique. Proc. of the 6th Conf. on Reconnaissance des Formes et Intelligence Artificielle (RFIA’87). 1123–1132.

    Google Scholar 

  33. B. Nebel (1991). Belief revision and default reasoning: syntax-based approaches. Proc. of the 2nd Inter. Conf. on Principles of Knowledge Representation and Reasoning (KR’91). 417–428.

    Google Scholar 

  34. B. Nebel (1994). Base revision operator and schemes: semantics representation and complexity. Proc. of the 11th European Conference on Artificial Intelligence (ECAI’94). 341–345.

    Google Scholar 

  35. O. Papini (1992). A complete revision function in propositional calculus. Proc. of the 10th European Conference on Artificial Intelligence (ECAI’92). 339–343.

    Google Scholar 

  36. O. Papini and A. Rauzy (1995). Révision: mettons un bémol. Revue d’Intelligence Artificielle, vol. 9, no4. 455–473.

    Google Scholar 

  37. J. Pearl (1988) Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.

    MATH  Google Scholar 

  38. J. Pearl (1990). System Z: A natural ordering of defaults with tractable applications to default reasoning. Proc. of the 3rd Conf. on Theoretical Aspects of Reasoning about Knowledge (TARK’90). 121–135.

    Google Scholar 

  39. G. M. Provan (1988). The computational complexity of assumption-based truth maintenance systems. Technical report. University of British Columbia, Vancouver.

    Google Scholar 

  40. R. Reiter (1980). A logic for default reasoning. Artificial Intelligence, 13. 81–132.

    Article  MathSciNet  Google Scholar 

  41. R. Reiter (1987). A theory of diagnosis from first principles. Artificial Intelligence, 32. 57–95.

    Article  MathSciNet  Google Scholar 

  42. R. Reiter and G. Criscuolo (1981). On interacting defaults. Proc. of the 7th Inter. Joint Conf. on Artificial Intelligence (IJCAI’81). 270–276.

    Google Scholar 

  43. N. Rescher (1976). Plausible Reasoning: An introduction to the theory and practice of plausibilistic inference. Van Gorcum.

    Google Scholar 

  44. N. Roos (1992). A logic for reasoning with inconsistent knowledge. Artificial Intelligence, 57. 69–103.

    Article  MathSciNet  Google Scholar 

  45. P. Snow (1996) Standard probability distributions described by rational default entailment. Technical Report.

    Google Scholar 

  46. S. Toulmin (1956). The uses of argument. Cambridge University Press.

    Google Scholar 

  47. D. S. Touretzky (1984). Implicit ordering of defaults in inheritance systems. Proc. of the 1984 National Conf. on Artificial Intelligence (AAAI’84). 322–325.

    Google Scholar 

  48. M. A. Williams (1996). Towards a Practical Approach to Belief Revision: Reason-Based Change. Proc. of the 5th Inter. Conf. on Principles of Knowledge Representation and Reasoning (KR’96). 412–421.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Benferhat, S., Garcia, L. (1998). A local handling of inconsistent knowledge and default bases. In: Hunter, A., Parsons, S. (eds) Applications of Uncertainty Formalisms. Lecture Notes in Computer Science(), vol 1455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49426-X_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-49426-X_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65312-7

  • Online ISBN: 978-3-540-49426-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics