Approximate reasoning about combined knowledge

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1365, Issue , 1998, Pages 259-273

  Koriche, Frédéric ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTABILITY AND DECIDABILITY; MODEL CHECKING; MULTI AGENT SYSTEMS;

APPROXIMATE REASONING; BACK-GROUND KNOWLEDGE; COMPLEX DECISION; FIRST-ORDER REPRESENTATION; FORMAL FRAMEWORK; RESOURCE-BOUNDED; STEPWISE PROCEDURE; TRACTABLE REASONING;

INTELLIGENT AGENTS;

EID: 84961340705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0026764     Document Type: Conference Paper

References (33)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, Reading, Mass., 1995.
2. C. Baral, S. Kraus, and J. Minker, Combining multiple knowledge bases. IEEE Transactions on Knowledge and Data Engineering, 3(2): 208-220, 1991.
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.
4. N. D. Belnap. A useful four-valued logic. In J. M. Dunn and G. Epstein, editors, Modem Uses of Multiple-valued Logic, pages 8-37. Reidel, Dordrecht, 1977.
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.
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.
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.
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.
9. H. N. Due. On the epistemic foundations of agent theories. In this volume.
10. J. M. Dunn. Intuitive semantics for first-degree entailments and coupled trees. Philosophical Studies, 29: 149-168, 1976.
11. T. Eiter and G. Gottlob. On the complexity of prepositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence, 57(2-3): 227-270, 1992.
12. R. Fagin, J. Y. Halpem, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. MIT-Press, Cambridge (MA), 1995.
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.
14. M. R. Genesereth and S. R Ketchpel. Software agents. Communications of the ACM, 37(7): 49-53, 1994.
15. M. R. Genesereth and N. J. Nilsson. Logical Foundations of Artificial Intelligence. Morgan Kaufmann, Palo Alto (CA), 1987.
16. M. L. Ginsberg. Counterfactuals. Artificial Intelligence, 30(1): 35-79, 1986.
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.
18. J. Y. Halpem 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.
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 IFCIS International Conference on Cooperative Information Systems (CoopIS-97), pages 66-72, Kiawah Island (SC), 1997. IEEE Computer Society.
20. G. Lakemeyer, Limited reasoning in first-order knowledge bases. Artificial Intelligence, 71: 213-255, 1994.
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.
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.
23. H. J, Levesque and R. J. Brachman. Expressiveness and tractability in knowledge representation and reasoning. Computational Intelligence, 3(2): 78-93, 1987.
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), 1990. Morgan Kaufmann.
25. S. Pradhan and J. Minker. Using priorities to combine knowledge bases. International Journal of Cooperative Information Systems, 5(2-3): 333-364, 1996.
26. N. Rescher and R. Manor. On inference from inconsistent premises. Theory and Decision, 1: 179-217, 1970.
27. M. Schaerf and M. Cadoli. Tractable reasoning via approximation. Artificial Intelligence, 74: 249-310, 1995.
28. B. Selman and H. Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2): 193-224, 1996.
29. V. S. Subrahmanian. Amalgamating knowledge bases. ACM Transactions on Database Systems, 19(2): 291-331, 1994.
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.
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.
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.
33. S. T. C. Wong. Preference-based decision making for cooperative knowledge-based systems. ACM Transactions on Information Systems, 12(4): 407-435, 1994.