Skip to main content
SpringerLink
Log in

Composite Distributive Lattices as Annotation Domains for Mediators

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

In a mediator system based on annotated logics it is a suitable requirement to allow annotations from different lattices in one program on a per-predicate basis. These lattices however may be related through common sublattices, hence demanding predicates which are able to carry combinations of annotations, or access to components of annotations. We show both demands to be satisifiable by using various composition operations on the domain of complete bounded distributive lattices or bilattices, most importantly the free distributive product. An implementation of the presented concepts, based on the KOMET implementation of SLG-AL with constraints, is briefly introduced.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P.G. Bertoli, J. Calmet, F. Giunchiglia and K. Homann, Specification and integration of theorem provers and computer algebra systems, Fund. Inform. 39(1,2) (1999) 39-57.

    Google Scholar 

  2. G. Bittencourt, Concurrent inference through dual transformation, L. J. IGPL 6(6) (1998) 795-833.

    Google Scholar 

  3. H.A. Blair and V.S. Subrahmanian, Paraconsistent logic programming, Theor. Comput. Sci. 68(2) (1989) 135-154.

    Google Scholar 

  4. J. Calmet, S. Jekutsch, P. Kullmann and J. Schü, KOMET-a system for the integration of heterogeneous information sources, in: Proceedings of the Foundations of Intelligent Systems, 10th International Symposium, ISMIS'97, Charlotte, North Carolina, USA, October 1997, eds. Z. W. Ras and A. Skowron, Lecture Notes in Computer Science, Vol. 1325 (Springer, New York, 1997) pp. 318-327.

    Google Scholar 

  5. J. Calmet, S. Jekutsch, P. Kullmann, J. Schü, J. Svec, M. Taneda, S. Trcek and J. Weißkopf, KOMET, Interner Bericht (1997).

  6. J. Calmet and P. Kullmann, A data structure for subsumption-based tabling in top-down resolution engines for data-intensive logic applications, in: Proceedings of the Foundations of Intelligent Systems, 11th International Symposium, ISMIS'99, Warsaw, Poland, June 8-1, 1999. eds. Z.W. Ras and A. Skowron, Lecture Notes in Computer Science, Vol. 1609 (Springer, New York, 1999) pp. 475-483.

    Google Scholar 

  7. J. Calmet and P. Kullmann, Meta web search with KOMET, in: Workshop for Intelligent Information Integration (IJCAI-99), Stockholm, Sweden (July, 1999).

  8. W. Chen and D.S. Warren, Tabled evaluation with delaying for general logic programs, J. Assoc. Comput. Mach. 43(1) (1996) 20-74.

    Google Scholar 

  9. C.V. Damásio, L.M. Pereira and T. Swift, Coherent well-founded annotated logic programs, in: LPNMR 99, eds. M. Gelfond, N. Leone and G. Pfeifer, Lecture Notes in Artificial Intelligence, Vol. 1730 (Springer, New York, 1999) pp. 262-276.

    Google Scholar 

  10. G. Graetzer, Lattice Theory (Freeman, San Francisco, CA, 1971).

    Google Scholar 

  11. M. Kifer and E.L. Lozinskii, A logic for reasoning with inconsistency, J. Automat. Reason. 9 (1992) 179-215.

    Google Scholar 

  12. M. Kifer and V.S. Subrahmanian, Theory of generalized annotated logic programming, J. Logic Programming 12(1) (1992) 335-367.

    Google Scholar 

  13. P. Kullmann, Entwurf und Implementierung einer Expertensystem-Shell für annotierte Logik, Diplomarbeit, Institut für Algorithmen und Kognitive Systeme, Karlsruhe (1995).

    Google Scholar 

  14. J. Lu, N.V. Murray and E. Rosenthal, Signed formulas and annotated logics, in: Proceedings of the 23rd International Symposium on Multiple-Valued Logics (IEEE Press, 1993) pp. 48-53.

  15. J. Lu, A. Nerode, J. Remmel and V.S. Subrahmanian, Towards a theory of hybrid knowledge bases, Technical Report, University of Maryland (1993).

  16. J. Lu, A. Nerode and V.S. Subrahmanian, Hybrid knowledge bases, IEEE Trans. Data Knowledge Engrg. 8(5) (1996) 773-785.

    Google Scholar 

  17. B. Mobasher, D. Pigozzi and G. Slutzki, Multi-valued logic programming semantics. An algebraic approach, Theor. Comput. Sci. 171 (1997) 77-109.

    Google Scholar 

  18. J.R. Slagle, C. Chang and R.C.T. Lee, A new algorithm for generating prime implicants, IEEE Trans. Comput. 19(4) (1970) 304-310.

    Google Scholar 

  19. R. Socher, Optimizing the clausal normal form transformation, J. Automat. Reason. 7 (1991) 325-336.

    Google Scholar 

  20. V.S. Subrahmanian, Amalgamating knowledge bases, Technical Report, CS-TR-2949, University of Maryland (August 1992).

  21. M. Taneda, Semantik mehrfacher Annotationen und Implementation in der Mediatorshell KOMET, Diplomarbeit, Fakultät für Informatik, University of Karlsruhe (June 1999).

Download references

Author information

Authors and Affiliations

  1. IAKS, University of Karlsruhe, 76128, Karlsruhe, Germany

    Jacques Calmet, Peter Kullmann & Morio Taneda

Authors
  1. Jacques Calmet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Kullmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Morio Taneda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Calmet, J., Kullmann, P. & Taneda, M. Composite Distributive Lattices as Annotation Domains for Mediators. Annals of Mathematics and Artificial Intelligence 36, 263–277 (2002). https://doi.org/10.1023/A:1016099113173

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016099113173

Search

Navigation