Steps towards a first-order logic of explicit and implicit belief
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Relative knowledge in a distributed database
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Constraint-Based Approach to the Description of Competence
EKAW '99 Proceedings of the 11th European Workshop on Knowledge Acquisition, Modeling and Management
Abstraction and Phase Transitions in Relational Learning
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Perception-Based Granularity Levels in Concept Representation
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Abstraction and complexity measures
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
An Extended Relational Algebra on Abstract Objects for Summarizing Answers to Queries
Fundamenta Informaticae
| Hi-index | 0.00 |
We are investigating the possibility of constructing meaningful and computationally efficient approximate reasoning methods for the first order logic. In particular, we study a situation when only certain aspects of the domain are of interest to the user. This is reflected by an equivalence relation defined on the domain of the knowledge base. The whole mechanism is called domain abstraction and is demonstrated to lead to significant computational advantages. The domain abstraction discussed in the paper is only a very special case of the more general notion of abstraction which is discussed shortly here and is a subject of the currently ongoing research.