Abstract | ||
---|---|---|
We show that by incorporating availability checking into model generation approach for first-order theorem proving, we can construct more relevant models, thereby further restricting forward chaining. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1007/BFb0027811 | ASIAN |
Keywords | Field | DocType |
relevant models,first order,theorem proving | Forward chaining,Automated theorem proving,Algorithm,Theoretical computer science,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-62031-1 | 0 | 0.34 |
References | Authors | |
4 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lifeng He | 1 | 441 | 40.97 |
Yuyan Chao | 2 | 315 | 24.07 |
Yuka Simajiri | 3 | 0 | 0.34 |
Hirohisa Seki | 4 | 276 | 52.30 |
Hidenori Itoh | 5 | 368 | 252.31 |