LPForget:

A System of Forgetting in Answer Set Programming

Fu-Leung Cheng1 Thomas Eiter2 Nathan Robinson1 Abdul Sattar1 Kewen Wang1
1Griffith University, Australia
2Technische Universität Wien, Austria

 

Other work

 

  • There are currently two other projects being undertaken by members of this team which relate to this work.

    One of these projects is the development of forgetting, merging and aligning algorithms for dl-programs [Wang et al., 2005]. dl-programs add reasoning functionality to ontologies by building answer set programs on top of OWL (Web Ontology Language) knowledge bases. A demonstration system for these algorithms is currently under development and will be posted on this page soon. However, here is an example which shows some ideas of our approach.
  • The other is a joint project with Vienna University of Technology, in which forgetting is extended to hex-programs. Motivated by the need to interoperate with a broader set of external computation sources and the observation, that for meta-reasoning in the context of the Semantic Web, no adequate support is available in ASP to date, the dl-program approach has been extended to hex-programs, that is, higher-order logic programs (which accommodate meta-reasoning through higher-order atoms) with external atoms for software interoperability (cf. hexdlv’s website at TU Vienna). This project explores applications of forgetting in managing ontologies represented by hex-programs.

Back

 

[Wang et al., 2005] K. Wang, G. Antoniou, R. Topor and A. Sattar. Merging and aligning ontologies in dl-programs. In Proceedings of the International Conference on Rules and Rule Markup Languages for the Semantic Web (RuleML 2005), LNCS 3791, pages 160-171, 2005.