×

A rule based knowledge transaction model for mobile environments. (English) Zbl 1101.68093

Summary: We propose and formalize a rule based knowledge transaction model for mobile environments. Our model integrates the features of both mobile environments and intelligent agents. We use logic programming as a mathematic tool and formal specification method to study knowledge transaction in mobile environments. Our knowledge transaction model has the following major advantages: (1) It can be used for knowledge transaction representation, formalization and knowledge reasoning in mobile environments. (2) It is knowledge oriented and has a declarative semantics inherited from logic programming. (3) It is a formalization that can be applied to general problem domains. We show that our model can be used for knowledge transaction representation, formalization and knowledge reasoning in mobile environments.

MSC:

68T35 Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
68N17 Logic programming

Software:

Klava
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] M. Ahamad, S. Smith, Detecting mutual consistency of shared objects, in: Proceedings of the IEEE Conference on Mobile Computing, 1995, pp. 45-50.; M. Ahamad, S. Smith, Detecting mutual consistency of shared objects, in: Proceedings of the IEEE Conference on Mobile Computing, 1995, pp. 45-50.
[2] Aiello, L. C.; Massacci, F., Verifying security protocols as planning in logic programming, ACM Transactions on Computational Logic, 123, 542-580 (2001) · Zbl 1365.68386
[3] Bhalla, S., Evolving a model of transaction management with embedded concurrency control for mobile database systems, Information and Software Technology, 45, 587-596 (2003)
[4] Baral, C., Knowledge Representation, Reasoning and Declarative Problem Solving (2003), Cambridge University Press: Cambridge University Press United Kingdom · Zbl 1056.68139
[5] Baral, C.; Gelfond, M., Logic programming and knowledge representation, Logic Programming, 19, 73-148 (1994) · Zbl 0820.68028
[6] D. Barbara, T. Imielinski, Sleepers and workaholics: caching strategies in mobile environments, in: Proceedings of ACM-SIGMOD 1993 International Conference on Management of Data, 1994, pp. 1-13.; D. Barbara, T. Imielinski, Sleepers and workaholics: caching strategies in mobile environments, in: Proceedings of ACM-SIGMOD 1993 International Conference on Management of Data, 1994, pp. 1-13.
[7] Blaybrook, B., On Line Transaction Processing Systems (1992), Wiley: Wiley New York
[8] Bettini, L., KLAVA: a Java package for distributed and mobile applications, Software Practice and Experience, 32, 1365-1394 (2002) · Zbl 1009.68933
[9] W.K. Chan, J. Chen, Serializability and epsilon serializability in a mobile environment, in: Proceedings of seventeenth IASTED International Conference in Applied Informatics, Innsbruck, Austria, 1999, pp. 273-297.; W.K. Chan, J. Chen, Serializability and epsilon serializability in a mobile environment, in: Proceedings of seventeenth IASTED International Conference in Applied Informatics, Innsbruck, Austria, 1999, pp. 273-297.
[10] Chen, W.; Swift, T., Efficient top-down computation of queries under the well-founded semantics, Journal of Logic Programming, 24, 161-201 (1995) · Zbl 0866.68017
[11] J. Chen, Y. Zhang, A mobile logic programming multi-agent system, in: Proceedings of 4th IEEE International Conference on Intelligent Systems Design and Application, Budapest, Hungary, 2004, pp. 759-765.; J. Chen, Y. Zhang, A mobile logic programming multi-agent system, in: Proceedings of 4th IEEE International Conference on Intelligent Systems Design and Application, Budapest, Hungary, 2004, pp. 759-765.
[12] Cockayne, W.; Zyda, M., Mobile Agent (1997), Manning Publications: Manning Publications United States
[13] D. Deugo, Choosing a mobile agent messaging model, in: Proceedings of ISADS 2001, 2001, pp. 278-286.; D. Deugo, Choosing a mobile agent messaging model, in: Proceedings of ISADS 2001, 2001, pp. 278-286.
[14] T. Eiter, A deductive system for nonmonotonic reasoning, in: Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, 1997, pp. 363-374.; T. Eiter, A deductive system for nonmonotonic reasoning, in: Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, 1997, pp. 363-374.
[15] T. Eiter, The DLV system, in: Workshop on Logic-Based AI, 2000, pp. 120-134.; T. Eiter, The DLV system, in: Workshop on Logic-Based AI, 2000, pp. 120-134.
[16] M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the Fifth International Conference in Logic Programming, 1988, pp. 1070-1080.; M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the Fifth International Conference in Logic Programming, 1988, pp. 1070-1080.
[17] M. Gelfond, V. Lifschitz, Logic programs with classical negation, in: Proceedings of Seventh International Conference in Logic Programming, 1990, pp. 579-597.; M. Gelfond, V. Lifschitz, Logic programs with classical negation, in: Proceedings of Seventh International Conference in Logic Programming, 1990, pp. 579-597.
[18] Gelfond, M.; Lifschitz, V., Classical negation in logic programs and disjunctive databases, New Generation Computing, 9, 365-385 (1991) · Zbl 0735.68012
[19] M. Gelfond, Representing knowledge in A-Prolog, computational logic: from logic programming to the future, Collection of papers in honour of R. Lowalski, 2001, pp. 9-21.; M. Gelfond, Representing knowledge in A-Prolog, computational logic: from logic programming to the future, Collection of papers in honour of R. Lowalski, 2001, pp. 9-21.
[20] Gray, J.; Reuter, A., Transaction Processing: Concepts and Techniques (1993), Morgan Kaufmann Publishers: Morgan Kaufmann Publishers San Francisco, California · Zbl 0781.68006
[21] Hanks, S.; McDermott, D., Nonmonotonic logic and temporal projection, Artificial Intelligence, 23, 379-412 (1987) · Zbl 0654.68107
[22] Imielinski, T.; Korth, H. F., Mobile Computing (1996), Kluwer Academic Publishers: Kluwer Academic Publishers Norwell, Massachusetts
[23] Komiya, T.; Enokido, T.; Takizawa, M., Mobile agent model for transaction processing on distributed objects, Information Sciences, 154, 23-28 (2003)
[24] R. Kowalski, F. Sadri, Logic programs with exceptions, in: Proceedings of the Seventh International Conference: Logic Programming, 1990, pp. 598-613.; R. Kowalski, F. Sadri, Logic programs with exceptions, in: Proceedings of the Seventh International Conference: Logic Programming, 1990, pp. 598-613. · Zbl 0737.68015
[25] Levi, S.; Agrawala, A., Real Time System Design (1990), McGraw-Hill
[26] Lifschitz, V., Answer set programming and plan generation, Artificial Intelligence, 138, 39-54 (2002) · Zbl 0995.68020
[27] Lynch, N.; Merit, M., Introduction to the theory of nested transactions, Theoretical Computer Science, 62, 123-185 (1988) · Zbl 0671.68043
[28] Madria, S. K.; Maheshwari, S. N.; Chandra, B., Virtual partition algorithm in a nested transaction environment and its correctness, Information Sciences, 137, 211-244 (2001) · Zbl 1052.68029
[29] Milojicic, D., Mobile agent applications, IEEE Concurrency, 236, 80-90 (1999)
[30] N. Mirghafori, A. Fontaine, A design for file access in a mobile environment, in: Proceedings of the IEEE Conference on Mobile Computing, 1995, pp. 57-61.; N. Mirghafori, A. Fontaine, A design for file access in a mobile environment, in: Proceedings of the IEEE Conference on Mobile Computing, 1995, pp. 57-61.
[31] I. Nemela, P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proceedings of the International Joint Conference and Symposium on Logic Programming, New York, United States, 1996, pp. 289-303.; I. Nemela, P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proceedings of the International Joint Conference and Symposium on Logic Programming, New York, United States, 1996, pp. 289-303.
[32] L. Pereira, J. Alferes, Well founded semantics for logic programs with explicit negation, in: Proceedings of European Conference on AI, Berlin, Germany, 1992.; L. Pereira, J. Alferes, Well founded semantics for logic programs with explicit negation, in: Proceedings of European Conference on AI, Berlin, Germany, 1992. · Zbl 0925.68097
[33] Pereira, L.; Alferes, J., Nonmonotonic reasoning with logic programming, Journal of Logic Programming, 16, 227-264 (1993)
[34] P. Rao, XSB: A system for efficiently computing well-founded semantics, in: Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, 1997, pp. 2-17.; P. Rao, XSB: A system for efficiently computing well-founded semantics, in: Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, 1997, pp. 2-17.
[35] Wagner, G., Logic programming with strong negation and inexact predicates, Journal of Logic and Computation, 63, 835-861 (1991) · Zbl 0738.68018
[36] Weiss, G., Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence (1999), The MIT Press: The MIT Press Cambridge, Massachusetts
[37] K. Wu, P. Yu, C. Pu, Divergence control algorithms for epsilon serializability, in: Proceedings of 8th International Conference on Data Engineering, 1992, pp. 506-515.; K. Wu, P. Yu, C. Pu, Divergence control algorithms for epsilon serializability, in: Proceedings of 8th International Conference on Data Engineering, 1992, pp. 506-515.
[38] Wooldridge, M., An Introduction to Multiagent Systems (2002), Wiley: Wiley England
[39] Yu, P.; Dias, D.; Lavenberg, S., On the analytical modeling of database concurrency control, Journal of ACM, 40, 831-872 (1993) · Zbl 0782.68038
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.