Approximate databases:A support tool for approximate reasoning

Journal of Applied Non-Classical Logics

Volumn 16, Issue 1-2, 2006, Pages 87-117

  Doherty, Patrick ^a   Magnusson, Martin ^a   Szałas, Andrzej ^a,b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b University of Computer Science and Economics   (Poland)

Author keywords

Approximate databases; Approximate reasoning; Knowledge representation; Secondorder quantifier elimination

Indexed keywords

EID: 39149090629     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.3166/jancl.16.87-117     Document Type: Article

References (48)

1. [Abi 95] Abiteboul S., Hull R., Vianu V., Foundations Of Databases, Addison-Wesley, 1995.
2. [Ack 35] Ackermann W., "Untersuchungen Ü;Ber Das Eliminationsproblem Der Mathematischen Logik", Mathematische Annalen, Vol. 110, 1935, P. 390-413.
3. [Bel 77] Belnap N., "A Useful Four-Valued Logic", Eptein G., Dunn J., Eds., Modern Uses Of Many Valued Logic, Reidel, 1977, P. 8-37.
4. [Ben 84] Van Benthem J., "Correspondence Theory", Gabbay D., Guenthner F., Eds., Handbook Of Philosophical Logic, Vol. 2, D. Reidel Pub. Co., 1984, P. 167-247.
5. [Bus 96] Busch D., "Sequent Formalizations Of Three-Valued Logics", Doherty P., Ed., Partiality, Modality And Nonmonotonicity, P. 45-75, Csli Publications, 1996.
6. [Doh 96A] Doherty P., Lukaszewicz W., Szalas A., "General Domain Circumscription And Its First-Order Reduction", Fapr, Vol. 1085 Of Lecture Notes In Computer Science, Springer, 1996, P. 93-109. (Pubitemid 126079144)
7. [Doh 96B] Doherty P., Lukaszewicz W., Szalas A., "A Reduction Result For Circumscribed Semi-Horn Formulas", Fundamenta Informaticae, Vol. 28, Num. 3-4, 1996, P. 261-271. (Pubitemid 126715046)
8. [Doh 97] Doherty P., Lukaszewicz W., Szalas A., "Computing Circumscription Revisited: A Reduction Algorithm", Journal Of Automated Reasoning, Vol. 18, Num. 3, 1997, P. 297-336. (Pubitemid 127506722)
9. [Doh 98] Doherty P., Ukaszewicz W., Szaas A., "General Domain Circumscription And Its Effective Reductions", Fundamenta Informaticae, Vol. 36, Num. 1, 1998, P. 23-55. (Pubitemid 128436255)
10. [Doh 99] Doherty P., Ukaszewicz W., Szaas A., "Declarative Ptime Queries For Relational Databases Using Quantifier Elimination", Journal Of Logic And Computation, Vol. 9, Num. 5, 1999, P. 739-761.
11. [Doh 00A] Doherty P., Granlund G., Kuchcinski K., Nordberg K., Sandewall E., Skarman E., Wiklund J., "The Witas Unmanned Aerial Vehicle Project", Proceedings Of The 14Th European Conference On Artificial Intelligence, 2000, P. 747-755.
12. [Doh 00B] Doherty P., Ukaszewicz W., Szaas A., "Computing Strongest Necessary And Weakest Sufficient Conditions Of First-Order Formulas", Proceedings Of The International Joint Conference On Ai (Ijcai'2001), 2000, P. 145-151.
13. [Doh 00C] Doherty P., Ukaszewicz W., Szaas A., "Efficient Reasoning Using The Local Closed-World Assumption", Cerri A., Dochev D., Eds., Proc. 9Th Int. Conference Aimsa 2000, Vol. 1904 Of Lnai, Springer-Verlag, 2000, P. 49-58.
14. [Doh 02] Doherty P., Ukaszewicz W., Szaas A., "Cake: A Computer-Aided Knowledge Engineering Technique", Van Harmelen F., Ed., Proc. 15Th European Conference On Artificial Intelligence, Ecai'2002, Amsterdam, 2002, Ios Press, P. 220-224.
15. [Doh 03A] Doherty P., Ukaszewicz W., Szaas A., "Tolerance Spaces And Approximative Representational Structures", Gü;Nter A., Kruse R., Neumann B., Eds., Proc. 26Th German Conf. On Ai, Vol. 2821 Of Lnai, Springer-Verlag, 2003, P. 475-489. (Pubitemid 37171140)
16. [Doh 03B] Doherty P., Kachniarz J., Szaas A., "Using Contextually Closed Queries For Local Closed-World Reasoning In Rough Knowledge Databases", [Pal 04], 2003, P. 219-250.
17. [Doh 04A] Doherty P., "Advanced Research With Autonomous Unmanned Aerial Vehicles", Proc. Of International Conference On Principles Of Knowledge Representation And Reasoning, 2004, P. 731-732.
18. [Doh 04B] Doherty P., Kertes S., Magnusson M., Szaas A., "Towards A Logical Analysis Of Biochemical Pathways", Alferes J., Leite J., Eds., Proceedings Of The 9Th Conference On Artificial Intelligence Jelia'2004, Vol. 3229 Of Lnai, Springer Verlag, 2004, P. 667-679. (Pubitemid 41049972)
19. [Doh 04C] Doherty P., Ukaszewicz W., Skowron A., Szaas A., "Approximation Transducers And Trees: A Technique For Combining Rough And Crisp Knowledge
20. [Pal 04], 2004, P. 189-218.
21. [Doh 04D] Doherty P., Ukaszewicz W., Szaas A., "Approximate Databases And Query Techniques For Agents With Heterogenous Perceptual Capabilities", Proc. Of The 7Th Int. Conf. On Information Fusion, Fusion'2004, 2004, P. 175-182.
22. [Doh 04E] Doherty P., Ukaszewicz W., Szaas A., "Approximative Query Techniques For Agents With Heterogeneous Ontologies And Perceptive Capabilities", Dubois D., Welty C., Williams M.-A., Eds., Proc. Of The 9Th Int. Conf. Kr'2004, Aaai Press, 2004, P. 459-468.
23. [Doh 04F] Doherty P., Szaas A., "On The Correspondence Between Approximations And Similarity", Tsumoto S., Slowinski R., Komorowski J., Grzymala-Busse J., Eds., Proc. Of 4Th Int. Conf. Rsctc'2004, Vol. 3066 Of Lnai, Springer-Verlag, 2004, P. 143-152. (Pubitemid 38803518)
24. [Doh 05] Doherty P., Ukaszewicz W., Szaas A., "Similarity, Approximations And Vagueness", Slezak D., Yao J., Peters J., Ziarko W., Hu X., Eds., Proceedings Of The Conference Rsfdgrc 2005, Vol. 3641 Of Lnai, Springer-Verlag, 2005, P. 541-550.
25. [Doh 06] Doherty P., Ukaszewicz W., Skowron A., Szaas A., Knowledge Representation Techniques: A Rough Set Approach, Studies In Fuziness And Soft Computing, Springer Physica Verlag, 2006, To Appear.
26. [Ebb 95] Ebbinghaus H.-D., Flum J., Finite Model Theory, Springer-Verlag, Heidelberg, 1995.
27. [Etz 97] Etzioni O., Golden K., Weld D., "Sound And Efficient Closed-World Reasoning For Planning", Artificial Intelligence, Vol. 89, 1997, P. 113-148. (Pubitemid 127412232)
28. [Fef 84] Feferman S., "Towards Useful Type-Free Theories", Journal Of Symbolic Logic, Vol. 49, 1984, P. 75-111.
29. [Fit 85] Fitting M., "A Kripke-Kleene Semantics For Logic Programs", Journal Logic Programming, Vol. 2, Num. 4, 1985, P. 295-312.
30. [Gab 92] Gabbay D. M., Ohlbach H. J., "Quantifier Elimination In Second-Order Predicate Logic", Nebel B., Rich C., Swartout W., Eds., Principles Of Knowledge Representation And Reasoning, Kr 92, P. 425-435, Morgan Kauffman, 1992.
31. [Gil 74] Gilmore P., "The Consistency Of Partial Set Theory Without Extensionality", Axiomatic Set Theory, Proceedings Of Symposia In Pure Mathematics 13, 1974, P. 147-153.
32. [Gus 96] Gustafsson J., "The Dls Algorithm", 1996, http://www.Ida.Liu.Se/Labs/Kplab/Projects/Dls/.
33. [Imm 98] Immerman N., Descriptive Complexity, Springer-Verlag, New York, Berlin, 1998.
34. [Lif 91] Lifschitz V., "Circumscription", Gabbay D. M., Hogger C. J., Robinson J. A., Eds., Handbook Of Artificial Intelligence And Logic Programming, Vol. 3, P. 297-352, Oxford University Press, 1991.
35. [Lin 00] Lin F., "On Strongest Necessary And Weakest Sufficient Conditions", Cohn A., Giunchiglia F., Selman B., Eds., Proc. 7Th International Conf. On Principles Of Knowledge Representation And Reasoning, Kr2000, San Francisco, Ca., 2000,Morgan Kaufmann Pub., Inc., P. 167-175.
36. [Mag 05A] Magnusson M., "Approximate Knowledge Database Users Manual", 2005.
37. [Mag 05B] Magnusson M., "Dls", 2005, http://www.Ida.Liu.Se/ Labs/Kplab/Projects/Dlsstar/.
38. [Mcc 80] Mccarthy J., "Circumscription: A Form Of Non-Monotonic Reasoning", Artificial Intelligence Journal, Vol. 13, 1980, P. 27-39.
39. [Non 98] Nonnengart A., Szalas A., "A Fixpoint Approach To Second-Order Quantifier Elimination With Applications To Correspondence Theory", Orowska E., Ed., Logic At Work: Essays Dedicated To The Memory Of Helena Rasiowa, Vol. 24 Of Studies In Fuzziness And Soft Computing, Springer Physica-Verlag, 1998, P. 307-328.
40. [Non 99] Nonnengart A., Ohlbach H. J., Szalas A., "Elimination Of Predicate Quantifiers", Logic, Language And Reasoning. Essays In Honor Of Dov Gabbay, Part I, Kluwer, 1999, P. 159-181.
41. [Pal 04] Pal S., Polkowski L., Skowron A., Eds., Rough-Neural Computing: Techniques For Computing With Words, Cognitive Technologies, Springer-Verlag, Heidelberg, 2004.
42. [Paw 91] Pawlak Z., Rough Sets. Theoretical Aspects Of Reasoning About Data, Kluwer Academic Publishers, Dordrecht, 1991.
43. [Prz 90] Przymusinski T., Przymusinska H., "Semantic Issues In Deductive Databases And Logic Programs", Banerji R., Ed., Formal Techniques In Articial Intelligence, North Holland, 1990, P. 321-367.
44. [Rei 78] Reiter R., "On Closedworld Databases", Gallaire H., Minker J., Eds., Logic And Databases, 1978, P. 55-76.
45. [Rei 80] Reiter R., "A Logic For Default Reasoning", Artificial Intelligence Journal, Vol. 13, 1980, P. 81-132.
46. [Sza 93] Szalas A., "On The Correspondence Between Modal And Classical Logic: An Automated Approach", Journal Of Logic And Computation, Vol. 3, 1993, P. 605-620.
47. [Vit 03A] VitóRia A., DamáSio C., Mauszy'n Ski J., "From Rough Sets To Rough Knowledge Bases", Fundamenta Informaticae, Vol. 57, Num. 2-4, 2003, P. 215-246.
48. [Vit 03B] VitóRia A., DamáSio C., Mauszy'n Ski J., "Query Answering For Rough Knowledge Bases", Wang G., Liu Q., Yao Y., Skowron A., Eds., Proceedings Of 9Th Internatinal Conference On Rough Sets, Fuzzy Sets, Data Mining And Granular Computing, Vol. 2639 Of Lncs, Springer-Verlag, 2003, P. 197-204.