人工智能--子句消解实验

// ClausesResolution.cpp : 定义控制台应用程序的入口点。
//A Implemention Of Simple Clauses Resolution
//Author: Wang Yun , ANHUI UNIVERSITY
#include "stdafx.h"
#include<iostream>
#include<cstring>
//#include<string>
#include<ctime>
using namespace std;

const short CLAUSE_LENGTH=60;
const short CLAUSES_MAX_NUM=5;
const short PARA_MAX_NUM=7;
const short PARA_LENGTH=15;
const short WORD_MAX_NUM=8; //the maximal number of words per clause
const short STACK_LENGTH=PARA_MAX_NUM*PARA_LENGTH;
static int clauses_sum=0;
const char SEPARATOR='|';
struct wordage
{
 char negate;
 char predicate;
 short parameters_sum;
 char parameters[PARA_MAX_NUM][PARA_LENGTH];
};
struct can_be_resolved
{
 char pred;
 int clause_index[2];
 int wordage_index[2];
};
struct _sigma
{
 char res_char;
 char instead_char[PARA_LENGTH];
};
wordage* disassembled_clauses[CLAUSES_MAX_NUM][WORD_MAX_NUM];
char** get_clause();
short* disassemble_clause(char** clauses);
can_be_resolved* get_resolved_predicates(short* words_sum,int *resolved_wd_sum);
_sigma* get_sigma_set(can_be_resolved* reslvd_preds,int *reslvd_prds_sum,int *sigma_s);
char* get_resolution_result(_sigma* sigma,int sigma_sm,char** p_clauses,
       can_be_resolved* reslvd_preds,int reslvd_prds_sum);

char** get_clause()
{
 static char* p_clauses[CLAUSES_MAX_NUM];
 int i;
 cout<<"Enter the amount of clauses you will input:";
 cin>>clauses_sum;
 if(clauses_sum>CLAUSES_MAX_NUM)
  cout<<"The number you entered is overflow!\n";
 for (i=0;i<clauses_sum;i++)
 {
  cout<<"Please enter clause "<<i+1<<":\n\t";
  p_clauses[i]=new char[CLAUSE_LENGTH];
  cin>>p_clauses[i];
 }
 if(i==clauses_sum)
  cout<<"Finished Entering!\n";
 return p_clauses;
}

short* disassemble_clause(char** clauses)
{
 int i,j,k;
 int bracket_stack[STACK_LENGTH];
 int stack_top=-1;
 bool is_nor=false,is_predicate,is_new_word;
 static short* word_sum=new short[clauses_sum];
 for (i=0;i<clauses_sum;i++)
 {
  k=-1;
  j=0;//reference to the  charactor in every clause
  is_new_word=true;
  while (is_new_word)
  {
   is_new_word=false;
   is_predicate=true;
   ++k;
   word_sum[i]=k+1;//store the sum of wordages in 'i' clause
   disassemb
  • 3
    点赞
  • 24
    收藏
    觉得还不错? 一键收藏
  • 3
    评论
评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值