Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities
暂无分享,去创建一个
[1] Y. Gurevich. On Finite Model Theory , 1990 .
[2] Dov M. Gabbay,et al. Quantifier Elimination in Second-Order Predicate Logic , 1992, KR.
[3] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[4] Jerzy W. Grzymala-Busse,et al. Rough Sets , 1995, Commun. ACM.
[5] Janusz Zalewski,et al. Rough sets: Theoretical aspects of reasoning about data , 1996 .
[6] A. Szałas,et al. A Fixpoint Approach to Second-Order Quantifier Elimination with Applications to Correspondence Theory , 1999 .
[7] Patrick Doherty,et al. Declarative PTIME Queries for Relational Databases using Quantifier Elimination , 1999, J. Log. Comput..
[8] A. Szałas,et al. ELIMINATION OF PREDICATE QUANTIFIERS , 1999 .
[9] Neil Immerman,et al. Descriptive Complexity , 1999, Graduate Texts in Computer Science.
[10] Tim Berners-Lee,et al. Weaving The Web: The Original Design And Ultimate Destiny of the World Wide Web , 1999 .
[11] Uwe Reyle,et al. Logic, Language and Reasoning , 1999 .
[12] Fangzhen Lin,et al. On strongest necessary and weakest sufficient conditions , 2000, Artif. Intell..
[13] Patrick Doherty,et al. Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas , 2001, IJCAI.
[14] Walter Truszkowski,et al. Ontology negotiation between intelligent information agents , 2002, The Knowledge Engineering Review.
[15] Patrick Doherty,et al. Tolerance Spaces and Approximative Representational Structures , 2003, KI.
[16] Patrick Doherty,et al. Computing Circumscription Revisited: A Reduction Algorithm , 1997, Journal of Automated Reasoning.
[17] Patrick Doherty,et al. On the Correspondence between Approximations and Similarity , 2004, Rough Sets and Current Trends in Computing.