Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/2522
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kumova, Bora İsmail | - |
dc.contributor.author | Çakır, Hüseyin | - |
dc.date.accessioned | 2016-11-25T09:53:21Z | - |
dc.date.available | 2016-11-25T09:53:21Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Kumova, B. İ., and Çakır, H. (2010). Lecture Notes in Computer Science, 6097 LNAI (PART 2), 28-38. doi:10.1007/978-3-642-13025-0_4 | en_US |
dc.identifier.isbn | 9783642130243 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://doi.org/10.1007/978-3-642-13025-0_4 | - |
dc.identifier.uri | http://hdl.handle.net/11147/2522 | - |
dc.description | 23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligence Systems, IEA/AIE 2010; Cordoba; Spain; 1 June 2010 through 4 June 2010 | en_US |
dc.description.abstract | A syllogism, also known as a rule of inference, is a formal logical scheme used to draw a conclusion from a set of premises. In a categorical syllogisms, every premise and conclusion is given in form a of quantified relationship between two objects. The syllogistic system consists of systematically combined premises and conclusions to so called figures and moods. The syllogistic system is a theory for reasoning, developed by Aristotle, who is known as one of the most important contributors of the western thought and logic. Since Aristotle, philosophers and sociologists have successfully modelled human thought and reasoning with syllogistic structures. However, a major lack was that the mathematical properties of the whole syllogistic system could not be fully revealed by now. To be able to calculate any syllogistic property exactly, by using a single algorithm, could indeed facilitate modelling possibly any sort of consistent, inconsistent or approximate human reasoning. In this paper we present such an algorithm. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer Verlag | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Automata theory | en_US |
dc.subject | Approximate reasoning | en_US |
dc.subject | Syllogistic reasoning | en_US |
dc.subject | Human-machine interaction | en_US |
dc.subject | Man machine systems | en_US |
dc.title | Algorithmic decision of syllogisms | en_US |
dc.type | Conference Object | en_US |
dc.institutionauthor | Kumova, Bora İsmail | - |
dc.department | İzmir Institute of Technology. Computer Engineering | en_US |
dc.identifier.volume | 6097 LNAI | en_US |
dc.identifier.issue | PART 2 | en_US |
dc.identifier.startpage | 28 | en_US |
dc.identifier.endpage | 38 | en_US |
dc.identifier.wos | WOS:000281604400004 | en_US |
dc.identifier.scopus | 2-s2.0-78650006558 | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.doi | 10.1007/978-3-642-13025-0_4 | - |
dc.relation.doi | 10.1007/978-3-642-13025-0_4 | en_US |
dc.coverage.doi | 10.1007/978-3-642-13025-0_4 | en_US |
dc.identifier.wosquality | N/A | - |
dc.identifier.scopusquality | Q3 | - |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.openairetype | Conference Object | - |
crisitem.author.dept | 03.04. Department of Computer Engineering | - |
Appears in Collections: | Computer Engineering / Bilgisayar Mühendisliği Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
SCOPUSTM
Citations
10
checked on Nov 15, 2024
WEB OF SCIENCETM
Citations
5
checked on Oct 5, 2024
Page view(s)
354
checked on Nov 18, 2024
Download(s)
630
checked on Nov 18, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.