Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Completing symbolic rule bases using betweenness and analogical proportion

Schockaert, Steven and Prade, Henri 2014. Completing symbolic rule bases using betweenness and analogical proportion. Studies in Computational Intelligence 548 , pp. 195-215. 10.1007/978-3-642-54516-0_8

Full text not available from this repository.

Abstract

Classical deduction is limited as a tool for reasoning about logical domain theories, in its ability to make sense of situations that are not explicitly covered. Humans on the other hand are remarkably adept at speculation about new situations, by drawing analogies or by relying on knowledge of similar situations. In this chapter, we are interested in formalising this process to develop a form of commonsense reasoning about incomplete rule bases. More precisely, we discuss two methods which can be used to derive plausible rules from a given set of propositional rules and a set of analogical proportions. The first method is based on the view that whenever the antecedents of four rules are in an analogical proportion, their consequences are likely to be in an analogical proportion as well. It often produces useful results, although it may be too adventurous for some applications. The second method is more cautious and makes explicit the assumptions under which it produces sound conclusions. Finally, we show how the second method may be further refined, in such a way that we recover the first method as a special case.

Item Type: Article
Date Type: Published Online
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: Springer Verlag
ISSN: 1860949X
Last Modified: 25 Feb 2019 11:29
URI: http://orca.cf.ac.uk/id/eprint/86524

Citation Data

Cited 4 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item