Introduction to P2P Systems: A Survey
Knowledge-based systems typically deals with incomplete and uncertain knowledge. Numerous extensions have been made to the logic programming and deductive databases in order to handle this incompleteness/uncertainty. These extensions can broadly be characterized into non-probabilistic and probabilistic formalisms. Approximate (uncertain) information can be considered as a kind of relativization of truth values for sentences. This is the standard approach used in several many-valued logics. For example, these many-valued logics include the smallest 4-valued logic programming based on Belnap’s bilattice [1] with two additional logic values (’unknown’ and ’possible’ values for incomplete and locally-inconsistent information respectively), and infinitary fuzzy logics and their extensions [2] and combinations [3] also. In query-answering from distributed databases, especially in the web framework, we often have to deal with partial information and query-algorithms which are defined for real-time applications. Hence the obtained results are generally incomplete. That is, the soft computing query-answering in web database applications is naturally correlated with effective non-omniscient query-agents. There does not exist a centralized control mechanism to handle the entire information in web database applications. The complete answers to such queries are practically undecidable because an enormous amount of time is required to compute the answers. As a result, such answering systems cannot be used in practice. Some approximative algorithms are needed to obtain reasonable but incomplete answers. In addition, these algorithms need to be parametrically incremental.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Majkić, Z.: Autoepistemic belief-revision for integration of mutually inconsistent knowledge. In: IICAI 2007, 3rd edn. Indian International Conference on Artificial Intelligence, Pune, India, December 17-19 (2007)
Majkić, Z.: Beyond fuzzy: Parameterized approximations of Heyting algebras for uncertain knowledge. In: IICAI 2005, 2nd edn. Indian International Conference on Artificial Intelligence, Pune, India, December 20-22 (2005)
Majkić, Z.: Intuitionistic truth-knowledge symmetric bilattices for uncertainty in intelligent systems. In: IS 2006, 3rd edn. Int.IEEE Conf. on Intelligent Systems, London, UK, September 4-6 (2006)
Hyperbee, World-wide web (2007), http://www.hyperbee.com
Sourceforge, World-wide web (2007), http://freenet.sourceforge.com
Napster, World-wide web (2001), http://www.napster.com
ICQ, World-wide web (2007), http://www.icq.com
Jabber Inc, World-wide web (2007), http://www.jabber.org
SETI, World-wide web (2007), http://setiathome.ssl.berkeley.edu
Zaihrayeu, I.: Query answering in peer-to-peer database networks. Technical Report DIT-03-012, University of Trento, Italy (2003)
Groove, World-wide web (2007), http://office.microsoft.com/en-us/groove
Gnutella, World-wide web (2007), http://www.gnutella.com
Aberer, K., et al.: Improving data access in P2P systems. IEEE Internet Computing, Los Alamitos (2002)
Gribble, S., et al.: What can databases do for Peer-to-Peer? In: WebDB Workshop on Databases and the Web (2001)
Serafini, L., et al.: The local relational model: Model and proof theory. Technical Report 0112-23, ITC-IRST (2001)
Ghidini, C., Giunchiglia, F.: Local models semantics or contextual reasoning = locality + compatibility. Artificial Intelligence 127, 221–259 (2001)
Reiter, R.: Towards a logical reconstruction of relational database theory. In: Brodie, M.L., Mylopoulos, J., Schmidt, J.W. (eds.) On Conceptual Modeling: Perspectives from Artificial Intelligence Databases and Programming Languages (1984)
Lenzerini, M., Majkić, Z.: General framework for query reformulation. Semantic Webs and Agents in Integrated Economies, D3.1, IST-2001-34825 (February 2003)
Franconi, E., et al.: A robust logical and computational characterization of Peer-to-Peer data systems. Technical Report DIT-03-051, University of Trento, Italy (September 2003)
Franconi, E., et al.: A robust logical and computational characterization of Peer-to-Peer data systems. In: Proc. of the Int. Workshop On Databases, Inf.Systems and P2P Computing, Berlin, Germany (September 2003)
Calvanese, D., et al.: Semantic data integration in P2P systems. In: Proc. of the Int. Workshop On Databases, Inf.Systems and P2P Computing, Berlin, Germany (September 2003)
Majkić, Z.: Flexible intentional query-answering for RDF Peer-to-Peer systems. In: Larsen, H.L., et al. (eds.) FQAS 2006. LNCS (LNAI), vol. 4027, pp. 7–10. Springer, Heidelberg (2006)
Calvanese, D., et al.: Logical foundations of Peer-to-Peer data integration, PODS 2004, June 14-16, Paris, France (2004)
Calvanese, D., et al.: Inconsistency tollerance in P2P data integration: an epistemic approach. In: Proc. 10th Int. Workshop on Database Programming Language (2005)
Majkić, Z.: Intensional semantics for P2P data integration. LNCS Journal on Data Semantics VI, Special Issue on Emergent Semantics (April 15, 2006)
Majkić, Z.: Weakly-coupled P2P system with a network repository. In: WDAS 2004. 6th Workshop on Distributed Data and Structures, Lausanne, Switzerland, July 5-7 (2004)
Majkić, Z.: Massive parallelism for query answering in weakly integrated P2P systems. In: Workshop GLOBE 2004, Zaragoza, Spain, August 30-September 3 (2004)
Montague, R.: Formal philosophy. selected papers of Richard Montague. In: Thomason, R. (ed.), Yale University Press, New Haven, London, pp. 108–221 (1974)
Majkić, Z.: Non omniscient intensional contextual reasoning for query-agents in P2P systems. In: IICAI 2007. 3rd Indian International Conference on Artificial Intelligence, Pune, India, December 17-19 (2007)
Kripke, S.A.: A completeness theorem in modal logic. The Journal of Symbolic Logic 24, 1–14 (1959)
Kripke, S.A.: Semantic analisys of modal logic. The Journal of Symbolic Logic 24, 323–324 (1959)
Calì, A., et al.: Data integration under integrity constraints, pp. 262–279 (2002)
Lenzerini, M.: Data integration: A theoretical perspective, pp. 233–246 (2002)
Alon, Y.: Answering queries using views: A survey. 10(4), 270–294 (2001)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases (1995)
Fagin, R., et al.: DATA Exchange: Semantics and query answering (2003)
Majkić, Z.: Querying with negation in data integration systems. In: IDEAS. 9th International Database Engineering and Application Symposium, Montreal, Canada, July 25-27, 2005, pp. 58–70. IEEE Computer Society Press, Los Alamitos (2005)
Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. Journal of Computer and System Sciences 28(1), 167–189 (1984)
Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 119–140 (1978)
Majkić, Z.: Fixpoint semantics for query answering in data integration systems. In: AGP03 - 8.th Joint Conference on Declarative Programming, Reggio Calabria, pp. 135–146 (2003)
Reiter, R.: What should a database know? 14, 127–153 (1990)
Majkić, Z.: Weakly-coupled ontology integration of P2P database systems. In: 1st Int. Workshop on Peer-to-Peer Knowledge Management (P2PKM), Boston, USA, August 22 (2004)
Majkić, Z.: Intensional logic and epistemic independency of intelligent database agents. In: WSPI 2005. 2nd International Workshop on Philosophy and Informatics, Kaiserslautern, Germany, April 10-13 (2005)
Levesque, H.J.: All I know: A study in autoepistemic logic 42, 263–310 (1990)
Halevy, A.Y.: Theory of answering queries using views 29(4), 40–47 (2000)
Prior, A.: Past, Present, and Future (1967)
Bull, R.: An approach to tense logic. Theoria 12, 171–182 (1970)
Passy, S., Tinchev, T.: An essay in combinatory dynamic logic. 93, 263–332 (1991)
Blackburn, P.: Representation, reasoning, and relational structures: A hybrid logic manifesto. Methods for Modalities 1, Logic Journal of the IGPL 8, 339–365 (2000)
Gabbay, D.: An irreflexivity lemma. In: Monnich, U. (ed.) Aspects of Philosophical Logic, Riedel, pp. 67–89 (1981)
Fine, K.: Failures of the interpolation lemma in quantified modal logic. Journal of Symbolic Logic 44, 201–206 (1979)
Arces, C., Blackburn, P., Marx, M.: Reparing the interpolation theorem in quantified modal logic (2001), available at http://www.hylo.net
Areces, C., Blackburn, P., Marx, M.: Hybrid logics: Characterization, interpolation and complexity. Tecn.Rep. CLAUS-Report 104, Universitat des Saarlandes (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Majkić, Z., Prasad, B. (2008). Soft Query-Answering Computing in P2P Systems with Epistemically Independent Peers. In: Prasad, B. (eds) Soft Computing Applications in Industry. Studies in Fuzziness and Soft Computing, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77465-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-77465-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77464-8
Online ISBN: 978-3-540-77465-5
eBook Packages: EngineeringEngineering (R0)