Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination

Abstract

In the context of the Semantic Web, several approaches for combining ontologies, given in terms of theories of classical first-order logic and rule bases, have been proposed. They either cast rules into classical logic or limit the interaction between rules and ontologies. Autoepistemic logic (AEL) is an attractive formalism which allows overcoming these limitations by serving as a uniform host language to embed ontologies and nonmonotonic logic programs into it. For the latter, so far only the propositional setting has been considered. In this article, we present three embeddings of normal and three embeddings of disjunctive nonground logic programs under the stable model semantics into first-order AEL. While all embeddings correspond with respect to objective ground atoms, differences arise when considering nonatomic formulas and combinations with first-order theories. We compare the embeddings with respect to stable expansions and autoepistemic consequences, considering the embeddings by themselves, as well as combinations with classical theories. Our results reveal differences and correspondences of the embeddings, and provide useful guidance in the choice of a particular embedding for knowledge combination.

DOI: 10.1145/1929954.1929957

Extracted Key Phrases

2 Figures and Tables

Statistics

051015'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

55 Citations

Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Bruijn2007EmbeddingNL, title={Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination}, author={Jos de Bruijn and Thomas Eiter and Axel Polleres and Hans Tompits}, journal={ACM Trans. Comput. Log.}, year={2007}, volume={12}, pages={20:1-20:39} }