Automated Synthesis of a Finite Complexity Ordering for Saturation

Details Automated Synthesis of a Finite Complexity Ordering for Saturation Automated Synthesis of a Finite Complexity Ordering for Saturation

2012-03-11

arxiv.org/abs/1203.2809v1

Computer Science

Logic in Computer Science

Scientific paper

We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A < B implies Var(A) {\subseteq} Var(B) for every atoms A and B. This condition is satisfied by any atom ordering compatible with a lexicographic, recursive, or multiset path ordering on terms. Our saturation procedure is based on a priori ordered resolution and its main novelty is the on-the-fly construction of a finite complexity atom ordering. In contrast with the usual redundancy, we give a new redundancy notion and we prove that during the saturation a non-redundant inference by a priori ordered resolution is also an inference by a posteriori ordered resolution. We also prove that if a set S of clauses is saturated with respect to an atom ordering as described above then the problem of whether a clause C is entailed from S is decidable.

Affiliated with

Also associated with

No associations

Rating

Automated Synthesis of a Finite Complexity Ordering for Saturation 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 Automated Synthesis of a Finite Complexity Ordering for Saturation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automated Synthesis of a Finite Complexity Ordering for Saturation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14738