Simplifying Negative Goals Using Typed Existence Properties

Details Simplifying Negative Goals Using Typed Existence Properties Simplifying Negative Goals Using Typed Existence Properties

2010-09-11

arxiv.org/abs/1009.2178v1

Computer Science

Programming Languages

Scientific paper

A method for extracting positive information from negative goals is proposed. It makes use of typed existence properties between arguments of a predicate to rewrite negative goals in a logic program. A typed existence property is a generalization of functional dependencies in that an input value maps to a fixed number of output values. Types are used to specify the domains of the input and output values. An implementation of the simplification method is presented and its complexity is analyzed. A key algorithm of the implementation checks if an atom in a negative goal can be extracted using a given typed existence property. A digraph links an atom to the quantified variables occurring in the atom and is used to quickly retrieve atoms in the negative goal that may become extractable after some other atom is extracted.

Affiliated with

Also associated with

No associations

Rating

Simplifying Negative Goals Using Typed Existence Properties 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 Simplifying Negative Goals Using Typed Existence Properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simplifying Negative Goals Using Typed Existence Properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-562851