| Creator |
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Publication Type |
|
| Access Rights |
|
| Related DOI |
|
|
|
| Related URI |
|
|
|
| Relation |
|
|
|
| Abstract |
In first order predicate logic, it is undecidable whether a formula is deducible from a set of axioms. In order to realize a practical knowledge base system in the framework of the first order logic, ...we must overcome this problem. In this paper, we propose a time-bounded reasoning and investigate the properties of the knowledge base management system based on our time-bounded reasoning. We also show that the time-bounded reasoning is sound and valid. Furthermore, we discuss the selection of time functions and give three parameters of time functions. We also outline a prototype system we have realized in K-prolog on a Sun-3show more
|
Export Mendeley
rifis-tr-19