Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities

Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference, KR 2004

Volumn , Issue , 2004, Pages 459-468

  Doherty, Patrick ^a   Szałas, Andrzej ^a   Łukaszewicz, Witold ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b TWP   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE AGENTS;

AGENT ONTOLOGIES; APPROXIMATE QUERY; APPROXIMATE REASONING; HETEROGENEOUS ONTOLOGY; LOWER AND UPPER APPROXIMATIONS; ROBOTIC AGENTS; TOLERANCE SPACES; WEAKEST SUFFICIENT AND STRONGEST NECESSARY CONDITIONS;

ONTOLOGY;

EID: 33947424634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Abiteboul, S.; Hull, R.; and Vianu, V. 1996. Foundations of Databases. Addison-Wesley Pub. Co.
2. Bailin, S. C., and Truszkowski, W. 2002. Ontology negotiations between intelligent information agents. The Knowledge Engineering Review 17(1):7-19.
3. Berners-Lee, T. 2000. Weaving the Web. HarperBusiness.
4. Doherty, P., and Szałas, A. 2004. On the correspondence between approximations and similarity. In Proceedings of the 4th International Conference on Rough Sets and Current Trends in Computing.
5. Doherty, P.; Łukaszewicz, W.; and Szałas, A. 1997. Computing circumscription revisited. Journal of Automated Reasoning 18(3):297-336.
6. Doherty, P.; Łukaszewicz, W.; and Szałas, A. 1999. Declarative PTIME queries for relational databases using quantifier elimination. Journal of Logic and Computation 9(5):739-761.
7. Doherty, P.; Łukaszewicz, W.; and Szałas, A. 2001. Computing strongest necessary and weakest sufficient conditions of first-order formulas. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 145-151.
8. Doherty, P.; Łukaszewicz, W.; and Szałas, A. 2003. Tolerance spaces and approximative representational structures. In Günter, A.; Kruse, R.; and Neumann, B., eds., Proceedings of the 26th German Conference on Artificial Intelligence, volume 2821 of LNAI, 475-489. Springer-Verlag.
9. Ebbinghaus, H.-D., and Flum, J. 1995. Finite Model Theory. Heidelberg: Springer-Verlag.
10. Gabbay, D. M., and Ohlbach, H. J. 1992. Quantifier elimination in second-order predicate logic. In Nebel, B.; Rich, C.; and Swartout, W., eds., Proc. of the 3rd Int'l Conference on the Principles of Knowledge Representation and Reasoning. Morgan Kauffman. 425-435.
11. Immerman, N. 1998. Descriptive Complexity. New York, Berlin: Springer-Verlag.
12. Lin, F. 2000. On strongest necessary and weakest sufficient conditions. In Cohn, A.; Giunchiglia, F.; and Selman, B., eds., Proc. of the 7th Int'l Conference on the Principles of Knowledge Representation and Reasoning, 167-175.
13. Nonnengart, A., and Szałas, A. 1998. A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In Orłowska, E., ed., Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, volume 24, 307-328. Springer Physica-Verlag.
14. Nonnengart, A.; Ohlbach, H.; and Szałas, A. 1999. Elimination of predicate quantifiers. In Ohlbach, H., and Reyle, U., eds., Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I, 159-181. Kluwer.
15. Pawlak, Z. 1991. Rough Sets. Theoretical Aspects of Reasoning about Data. Dordrecht: Kluwer Academic Publishers.