DDS推理机实验报告.docxVIP

DDS推理机实验报告学号:姓名:专业:指导:赵峰时间:2013-12-30正向推理机原理:创建2个二维数组,R 与have 对应一个为规则R[][]一个为判断规则中是否有事实have[][]若存在则将have数组中相对应的弄成true,表示存在包含3个类,函数类Function.java,规则类Rule.java,演示类TestDemo.java Rule类package tuli;public class Rule {String[][] r={{通过哺乳养育后代,r,哺乳动物},{有毛发,r,哺乳动物},{有羽毛,r,鸟},{会飞且生蛋,r,鸟},{哺乳动物,有爪,有犬齿,目盯前方,r,食肉动物},{哺乳动物,吃肉,r,食肉动物},{哺乳动物,有蹄,r,有蹄动物},{有蹄动物 ,反刍食物,r,偶蹄动物},////////////////////////////////////////////////////{食肉动物,黄褐色,有黑色条纹,f,老虎},{食肉动物,黄褐色, 有黑色斑点,f,金钱豹},{有蹄动物,长腿 ,长脖子,黄褐色,有暗斑点,f,长颈鹿}, {有蹄动物, 白色 ,有黑色条纹,f,斑马},{鸟,不会飞,长腿,长脖子,黑白色,f,驼鸟},{鸟,不会飞,会游泳,黑白色,f,企鹅},{鸟,善飞,不怕风浪,f,海燕},};}Function类package tuli;import java.util.Arrays;public class Function {public static void isHave(String[][] rule, String[] fact, boolean[][] have){for(int i = 0; i rule.length; i++){for(int j = 0; j rule[i].length-2; j++){for(int k = 0; k fact.length; k++){if(rule[i][j].equals(fact[k])){have[i][j] = true;}}}}}public static void print(boolean[][] have,String[][] rule, String[] fact){for(int i = 0; i have.length; i++){for(int j = 0; j have[i].length have[i][j]; j++){if(j == have[i].length - 1 rule[i][rule[i].length - 2].equals(f)){System.out.println(该动物是:+rule[i][rule[i].length - 1]);}}}}public static String[] expend(boolean[][] have, String[][] rule, String[] fact){int flag = 0;for(int i = 0; i have.length; i++){for(int j = 0; j have[i].length have[i][j]; j++){if(j == have[i].length-1){for(int k = 0; k fact.length; k++){if(!fact[k].equals(rule[i][rule[i].length-1])){flag++;}if(flag == fact.length-1){fact = Arrays.copyOf(fact, fact.length+1);fact[fact.length-1] = rule[i][rule[i].length-1];}}}}}return fact;}public static int check(boolean[][] have, String[][] rule){int flag = 0;for(int i = 0; i have.length; i++){for(int j = 0; j have[i].length have[i][j]; j++){if(rule[i][rule[i].length - 2].equals(f)){flag = 1;}else if(rule[i][rule[i].length - 2].equals(r)){flag = -1;}}}return flag;}}TestDemo类package tuli;public class TestDemo {public static void main(String[] args) {Rule rule = new Rule();