ubc.cs.JLog.Builtins.Goals.jSubtractArrayGoal Maven / Gradle / Ivy

Go to download
/*
    This file is part of JLog.

    Created by Glendon Holst for Alan Mackworth and the 
    "Computational Intelligence: A Logical Approach" text.
    
    Copyright 1998, 2000, 2002 by University of British Columbia and 
    Alan Mackworth.
    
    This notice must remain in all files which belong to, or are derived 
    from JLog.
    
    Check  or 
     for further information
    about JLog, or to contact the authors.
     
    JLog is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    JLog is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with JLog; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
    URLs:  or 
*/
//#########################################################################
//	SubtractArrayGoal
//#########################################################################
 
package ubc.cs.JLog.Builtins.Goals;

import java.lang.*;
import java.util.*;
import ubc.cs.JLog.Terms.*;
import ubc.cs.JLog.Foundation.*;
import ubc.cs.JLog.Builtins.*;

/**
 * Goal for subtracting terms from array of terms.
 *
 * @author       Glendon Holst
 * @version      %I%, %G%
 */
public class jSubtractArrayGoal extends jGoal
{
 protected jSubtractArray 		subtract;
 
 // for use by subtract
 public jTerm 				term1,term2,term3;
 
 public 	jSubtractArrayGoal(jSubtractArray sa,jTerm t1,jTerm t2,jTerm t3)
 {
  subtract = sa;
  term1 = t1;
  term2 = t2;
  term3 = t3;
 };
 
 public boolean 	prove(iGoalStack goals,iGoalStack proved)
 {
  if (subtract.prove(this))
  {
   proved.push(this);
   return true;
  }
  else
  {
   goals.push(this); // a retry that follows may need a node to remove or retry
   return false;
  }
 };

 public boolean 	retry(iGoalStack goals,iGoalStack proved)
 {
  goals.push(this); // a retry that follows may need a node to remove or retry
  return false;
 }; 

 public String 		getName() 
 {
  return subtract.getName();
 };
 
 public int 		getArity() 
 {
  return subtract.getArity();
 };
 
 public String 		toString()
 {StringBuffer 	sb = new StringBuffer();
   
  sb.append(getName()+"/"+String.valueOf(getArity())+" goal: ");
  sb.append(getName()+"("+term1.toString()+","+term2.toString()+","+term3.toString()+")");
  
  return sb.toString();
 };
};