Composite Distributive Lattices as Annotation Domains for Mediators

Authors:
Jacques Calmet;Peter Kullmann;Morio Taneda
Affiliations:
-;-;-
Venue:
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Year:
2000

Citing 12
Cited 0

Paraconsistent logic programming

Theoretical Computer Science
Optimizing the clausal normal form transformation

Journal of Automated Reasoning
Theory of generalized annotated logic programming and its applications

Journal of Logic Programming
Towards a theory of hybrid knowledge bases

Towards a theory of hybrid knowledge bases
A logic for reasoning with inconsistency

Journal of Automated Reasoning
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
Multi-valued logic programming semantics: an algebraic approach

Selected papers from the international workshop on Uncertainty in databases and deductive systems
Specification and integration of theorem provers and computer algebra systems

Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
Hybrid Knowledge Bases

IEEE Transactions on Knowledge and Data Engineering
A Data Structure for Subsumption-Based Tabling in Top-Drown Resolution Engines for Data-Intensive Logic Applications

ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
Coherent Well-founded Annotated Logic Programs

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.