Composite Distributive Lattices as Annotation Domains for Mediators

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.

[1]  Anil Nerode,et al.  Towards a theory of hybrid knowledge bases , 1993 .

[2]  Anil Nerode,et al.  Hybrid Knowledge Bases , 1996, IEEE Trans. Knowl. Data Eng..

[3]  Rolf Socher.  Optimizing the clausal normal form transformation , 2004, Journal of Automated Reasoning.

[4]  Jacques Calmet,et al.  KOMET - A System for the Integration of Heterogeneous Information Sources , 1997, ISMIS.

[5]  Piergiorgio Bertoli,et al.  Specification and Integration of Theorem Provers and Computer Algebra Systems , 1998, Fundam. Informaticae.

[6]  Guilherme Bittencourt,et al.  Concurrent Inference through Dual Transformation , 1998, Log. J. IGPL.

[7]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, FSTTCS.

[8]  Jacques Calmet,et al.  Meta Web Search with KOMET , 1999, Intelligent Information Integration.

[9]  Jacques Calmet,et al.  A Data Structure for Subsumption-Based Tabling in Top-Drown Resolution Engines for Data-Intensive Logic Applications , 1999, ISMIS.

[10]  V. S. Subrahmanian.  Amalgamating knowledge bases , 1994, TODS.

[11]  Neil V. Murray,et al.  Signed formulas and annotated logics , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.

[12]  Giora Slutzki,et al.  Multi-Valued Logic Programming Semantics: An Algebraic Approach , 1997, Theor. Comput. Sci..

[13]  Michael Kifer,et al.  A logic for reasoning with inconsistency , 1992, Journal of Automated Reasoning.

[14]  K. A. Ross,et al.  Tabled Evaluation with Delaying for General Logic Programs , 1996 .

[15]  Richard C. T. Lee,et al.  A New Algorithm for Generating Prime Implicants , 1970, IEEE Transactions on Computers.

[16]  V. S. Subrahmanian,et al.  Theory of Generalized Annotated Logic Programming and its Applications , 1992, J. Log. Program..

[17]  Luís Moniz Pereira,et al.  Coherent Well-founded Annotated Logic Programs , 1999, LPNMR.