Approximate reasoning based on similarity

Biacino, L; Gerla, G; Ying, M

Approximate reasoning based on similarity

Biacino, L Gerla, G Ying, M

Permalink

Publication Type:: Journal Article
Citation:: Mathematical Logic Quarterly, 2000, 46 (1), pp. 77 - 86
Issue Date:: 2000-01-01

Closed Access

	Filename	Description	Size
	2008004757OK.pdf		241.58 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Biacino, L	en_US
dc.contributor.author	Gerla, G	en_US
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X	en_US
dc.date.issued	2000-01-01	en_US
dc.identifier.citation	Mathematical Logic Quarterly, 2000, 46 (1), pp. 77 - 86	en_US
dc.identifier.issn	0942-5616	en_US
dc.identifier.uri	http://hdl.handle.net/10453/8930
dc.description.abstract	The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composing two closure operators and that the resulting operator is still a closure operator. Also, we extend any similarity into a similarity which is compatible with the logical equivalence, and we prove that this gives the same consequence relation.	en_US
dc.relation.ispartof	Mathematical Logic Quarterly	en_US
dc.relation.isbasedon	10.1002/(SICI)1521-3870(200001)46:1<77::AID-MALQ77>3.0.CO;2-X	en_US
dc.subject.classification	General Mathematics	en_US
dc.title	Approximate reasoning based on similarity	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	46	en_US
utslib.for	080199 Artificial Intelligence and Image Processing not elsewhere classified	en_US
utslib.for	080203 Computational Logic and Formal Languages	en_US
utslib.for	020603 Quantum Information, Computation and Communication	en_US
utslib.for	0101 Pure Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	46	en_US

Abstract:

The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composing two closure operators and that the resulting operator is still a closure operator. Also, we extend any similarity into a similarity which is compatible with the logical equivalence, and we prove that this gives the same consequence relation.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/8930