Approximate reasoning with credible subsets
Abstract . The complexity of logical inference in knowledge systems grows with the system size, determined, in particular, by the number of its clauses. This growth is so rapid, that reasoning in sizeable systems becomes intractable.However, given a system S and a query Q , should we be able to detect a subset of S informative enough to provide a correct answer to Q , and small enough to fit into the range of tractable computation,the answer to Q could be produced efficiently. This paper presents a way of implementing this idea.
Keywords: AUTOMATED REASONING; EVIDENCE; LOGICAL APPROXIMATION
Document Type: Research Article
Publication date: 01 October 1997
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content