Skip to main content
SpringerLink
Log in

Approximate reasoning about combined knowledge

  • Section V: Theories
  • Conference paper
  • First Online:
Book cover Intelligent Agents IV Agent Theories, Architectures, and Languages (ATAL 1997)

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

Included in the following conference series:

Abstract

Just as cooperation in multi-agent systems is a central issue for solving complex decision problems, so too is the ability for an intelligent agent to reason about combined knowledge, coming from its background knowledge and the communicated information. Specifically, such an agent is confronted with three main difficulties: the prospect of inconsistency which arises when different beliefs are grouped together, the presence of uncertainty which may occur due to not fully reliable beliefs, and the high computational complexity of reasoning with very large pools of collected information. The purpose of this paper is to define a formal framework which handles these three aspects and which is useful to specify resource bounded agents. Based on the concept of approximate reasoning, our framework includes several major features. First, a model checking approach is advocated, which enables an agent to perform decidable reasoning with a first-order representation language. Second, a stepwise procedure is included for improving approximate answers and allowing their convergence to the correct answer. Third and finally, both sound approximations and complete ones are covered. This method is flexible enough for modeling tractable reasoning in very large, inconsistent and uncertain sets of knowledge.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, and V Vianu. Foundations of Databases. Addison-Wesley, Reading, Mass., 1995.

    Google Scholar 

  2. C. Baral, S. Kraus, and J. Minker. Combining multiple knowledge bases. IEEE Transactions on Knowledge and Data Engineering, 3(2):208–220, 1991.

    Article  Google Scholar 

  3. C. Baral, S. Kraus, J. Minker, and V. S. Subrahmanian. Combining knowledge bases consisting of first order theories. Computational Intelligence, 8(1):45–71, 1992.

    Google Scholar 

  4. N. D. Belnap. A useful four-valued logic. In J. M. Dunn and G. Epstein, editors, Modern Uses ofMultiple-valued Logic, pages 8–37. Reidel, Dordrecht, 1977.

    Google Scholar 

  5. S. Benferhat, D. Dubois, and H. Prade. How to infer form inconsistent beliefs without revising? In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 1449–1455, Toronto, Canada, 1995. Morgan Kaufmann.

    Google Scholar 

  6. M. Cadoli and M. Schaerf. Approximate inference in default reasoning and circumscription. In B. Neumann, editor, Proceedings 10th European Conference on Artificial Intelligence (ECAI-92), pages 319–323, Vienna, Austria, 1992. John Wiley & Sons.

    Google Scholar 

  7. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proceedings 9th Annual ACM Symposium on the Theory of Computing, pages 77–90, New York, 1977.

    Google Scholar 

  8. L. Cholvy. Proving theorems in a multi-source environment. In Proceedings 13th International Joint Conference on Artificial Intelligence (IJCAI-93), pages 66–71, Chambéry. France, 1993. Morgan Kaufmann.

    Google Scholar 

  9. H. N. Duc. On the epistemic foundations of agent theories. In this volume.

    Google Scholar 

  10. J. M. Dunn. Intuitive semantics for first-degree entailments and coupled trees. Philosophical Studies, 29:149–168, 1976.

    Article  Google Scholar 

  11. T. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence, 57(2–3):227–270, 1992.

    Article  Google Scholar 

  12. R. Fagin, J. Y. Halpern, Y. Moses, and M..Y. Vardi. Reasoning About Knowledge. MIT Press, Cambridge (MA), 1995.

    Google Scholar 

  13. R. Fagin, J. D. Ullman, and M. Y Vardi. On the semantics of updates in databases.In Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 352–365, Atlanta, (GA), 1983.

    Google Scholar 

  14. M. R. Genesereth and S. P. Ketchpel. Software agents. Communications of the ACM, 37(7):49–53, 1994.

    Article  Google Scholar 

  15. M. R. Genesereth and N. J. Nilsson. Logical Foundations of Artificial Intelligence. Morgan Kaufmann, Palo Alto (CA), 1987.

    Google Scholar 

  16. M. L. Ginsberg. Counterfactuals. Artificial Intelligence, 30(1):35–79, 1986.

    Article  Google Scholar 

  17. J. Grant and V S. Subrahmanian. Reasoning in inconsistent knowledge bases. Technical Report UMIACS-TR-90-118, Department of Computer Science, University of Maryland, 1990.

    Google Scholar 

  18. J. Y. Halpern and M. Y. Vardi. Model checking vs. theorem proving: A manifesto. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, pages 325–334, San Mateo, CA, USA, 1991. Morgan Kaufmann Publishers.

    Google Scholar 

  19. F. Koriche. Fault-tolerant and approximate reasoning in multi-source environments. In A. L. P. Chen, W. Klas, and M. P. Singh, editors, Proceedings of the Second IFCISInternational Conference on Cooperative Information Systems (CoopIS-97), pages 66–72, Kiawah Island (SC), 1997. IEEE Computer Society.

    Google Scholar 

  20. G. Lakemeyer. Limited reasoning in first-order knowledge bases. Artificial Intelligence, 71:213–255, 1994.

    Article  Google Scholar 

  21. H. J. Levesque. A logic of implicit and explicit belief. In R. J. Brachman, editor, Proceedings of the 6th National Conference on Artificial Intelligence, pages 198–202, Austin, Texas, 1984. William Kaufmann.

    Google Scholar 

  22. H. J. Levesque. A knowledge-level account of abduction. In N. S. Sridharan, editor, Proceedings of the 11th International Joint Conference on Artificial Intelligence, pages 1061–1067, Detroit (MI), 1989. Morgan Kaufmann.

    Google Scholar 

  23. H. J. Levesque and R. J. Brachman. Expressiveness and tractability in knowledge representation and reasoning. Computational Intelligence, 3(2):78–93, 1987.

    Google Scholar 

  24. B. Nebel. Belief revision and default reasoning: Syntax-based approaches. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, pages 417–428, San Mateo (CA), 1991. Morgan Kaufmann.

    Google Scholar 

  25. S. Pradhan and J. Minker. Using priorities to combine knowledge bases. International Journal of Cooperative Information Systems, 5(2–3):333–364, 1996.

    Article  Google Scholar 

  26. N. Rescher and R. Manor. On inference from inconsistent premises. Theory and Decision, 1:179–217,1970.

    Article  Google Scholar 

  27. M. Schaerf and M. Cadoli. Tractable reasoning via approximation. Artificial Intelligence, 74:249–310,1995.

    Article  Google Scholar 

  28. B. Selman and H. Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193–224, 1996.

    Article  Google Scholar 

  29. V. S. Subrahmanian. Amalgamating knowledge bases. ACM Transactions on Database Systems, 19(2):291–331, 1994.

    Article  Google Scholar 

  30. A. ten Teije and F. van Harmelen. Computing approximate diagnoses by using approximate entailment. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, pages 256–267, San Francisco (CA), 1996. Morgan Kaufmann.

    Google Scholar 

  31. B. A. Trahtenbrot. Impossibility of an algorithm for the decision problem in finite classes. American Mathematical Society Translation Series, 23(2):1–5, 1963.

    Google Scholar 

  32. M. Y. Vardi. The complexity of relational query languages. In ACM Symposion on Theory of Computation, pages 137–146, Baltimore, (MA),1982. ACM Press.

    Google Scholar 

  33. S. T. C. Wong. Preference-based decision making for cooperative knowledge-based systems. ACM Transactions on Information Systems, 12(4):407–435, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIRMM, UNIR 5506, Université Montpellier II CNRS, 161, rue Ada., 34392, Montpellier Cedex 5, France

    Frédéric Koriche

Authors
  1. Frédéric Koriche
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Munindar P. Singh Anand Rao Michael J. Wooldridge

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koriche, F. (1998). Approximate reasoning about combined knowledge. In: Singh, M.P., Rao, A., Wooldridge, M.J. (eds) Intelligent Agents IV Agent Theories, Architectures, and Languages. ATAL 1997. Lecture Notes in Computer Science, vol 1365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026764

Download citation

  • DOI: https://doi.org/10.1007/BFb0026764

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64162-9

  • Online ISBN: 978-3-540-69696-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation