An Optimization for Reasoning with Forest Logic Programs

Details An Optimization for Reasoning with Forest Logic Programs An Optimization for Reasoning with Forest Logic Programs

2010-11-25

arxiv.org/abs/1011.5894v1

Computer Science

Logic in Computer Science

ASPOCP 2010

Scientific paper

Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based algorithm for satisfiability checking w.r.t. forest logic programs, a decidable fragment of OASP, which has the forest model property. In this paper we introduce an optimized version of that algorithm achieved by means of a knowledge compilation technique. So-called unit completion structures, which are possible building blocks of a forest model, in the form of trees of depth 1, are computed in an initial step of the algorithm. Repeated computations are avoided by using these structures in a pattern-matching style when constructing a model. Furthermore we identify and discard redundant unit completion structures: a structure is redundant if there is another structure which can always replace the original structure in a forest model.

Affiliated with

Also associated with

No associations

Rating

An Optimization for Reasoning with Forest Logic Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Optimization for Reasoning with Forest Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Optimization for Reasoning with Forest Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463676