Product Logic, Gödel Logic (and Boolean Logic)

1998 ◽  
pp. 89-107
Author(s):  
Petr Hájek
Keyword(s):  
Boolean Logic ◽  
Gödel Logic ◽  
Product Logic

The logical style painting classifier based on Horn clauses and explanations (ℓ-SHE)

2019 ◽  
Author(s):  
Vicent Costa ◽  
Pilar Dellunde ◽  
Zoe Falomir
Keyword(s):  
Gödel Logic ◽  
Horn Clauses ◽  
Product Logic ◽  
Fuzzy Representation ◽  
Art Style

Abstract This paper presents a logical Style painting classifier based on evaluated Horn clauses, qualitative colour descriptors and Explanations ($\ell $-SHE). Three versions of $\ell $-SHE are defined, using rational Pavelka logic (RPL), and expansions of Gödel logic and product logic with rational constants: RPL, $G(\mathbb{Q})$ and $\sqcap (\mathbb{Q})$, respectively. We introduce a fuzzy representation of the more representative colour traits for the Baroque, the Impressionism and the Post-Impressionism art styles. The $\ell $-SHE algorithm has been implemented in Swi-Prolog and tested on 90 paintings of the QArt-Dataset and on 247 paintings of the Paintings-91-PIB dataset. The percentages of accuracy obtained in the QArt-Dataset for each $\ell $-SHE version are 73.3% (RPL), 65.6% ($G(\mathbb{Q})$) and 68.9% ($\sqcap (\mathbb{Q})$). Regarding the Paintings-91-PIB dataset, the percentages of accuracy obtained for each $\ell $-SHE version are 60.2% (RPL), 48.2% ($G(\mathbb{Q})$) and 57.0% ( $\sqcap (\mathbb{Q})$). Our logic definition for the Baroque style has obtained the highest accuracy in both datasets, for all the $\ell $-SHE versions (the lowest Baroque case gets 85.6$\%$ of accuracy). An important feature of the classifier is that it provides reasons regarding why a painting belongs to a certain style. The classifier also provides reasons about why outliers of one art style may belong to another art style, giving a second classification option depending on its membership degrees to these styles.

scholarly journals Pediatric Residents and Interns in an Italian Hospital Perform Improved Bibliographic Searches when Assisted by a Biomedical Librarian

2013 ◽  
Vol 8 (1) ◽  
pp. 76
Author(s):  
Mathew Stone
Keyword(s):  
Teaching Hospital ◽  
Assessment Tool ◽  
Controlled Trial ◽  
Intervention Group ◽  
Real Life ◽  
Boolean Logic ◽  
Bibliographic Databases ◽  
Control Group ◽  
Pediatric Residents ◽  
Clinical Scenarios

A Review of: Gardois, P., Calabrese, R., Colombi, N., Lingua, C., Longo, F., Villanacci, M., Miniero, R., & Piga, A. (2011). Effectiveness of bibliographic searches performed by paediatric residents and interns assisted by librarian. A randomised controlled trial. Health Information and Libraries Journal, 28(4), 273-284. doi: 10.1111/j.1471-1842.2011.00957.x Objective – To establish whether the assistance of an experienced biomedical librarian delivers an improvement in the searching of bibliographic databases as performed by medical residents and interns. Design – Randomized controlled trial. Setting – The pediatrics department of a large Italian teaching hospital. Subjects – 18 pediatric residents and interns. Methods – 23 residents and interns from the pediatrics department of a large Italian teaching hospital were invited to participate in this study, of which 18 agreed. Subjects were then randomized into two groups and asked to spend between 30 and 90 minutes searching bibliographic databases for evidence to answer a real-life clinical question which was randomly allocated to them. Each member of the intervention group was provided with an experienced biomedical librarian to provide assistance throughout the search session. The control group received no assistance. The outcome of the search was then measured using an assessment tool adapted for the purpose of this study from the Fresno test of competence in evidence based medicine. This adapted assessment tool rated the “global success” of the search and included criteria such as appropriate question formulation, number of PICO terms translated into search terms, use of Boolean logic, use of subject headings, use of filters, use of limits, and the percentage of citations retrieved that matched a gold standard set of citations found in a prior search by two librarians (who were not involved in assisting the subjects) together with an expert clinician. Main Results – The intervention group scored a median average of 73.6 points out of a possible 100, compared with the control group which scored 50.4. The difference of 23.2 points in favour of the librarian assisted group was a statistically significant result (p value = 0.013) with a 95% confidence interval of between 4.8 and 33.2. Conclusion – This study presents credible evidence that assistance provided by an experienced biomedical librarian improves the quality of the bibliographic database searches performed by residents and interns using real-life clinical scenarios.

scholarly journals Digital logic gates in soft, conductive mechanical metamaterials

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Charles El Helou ◽  
Philip R. Buskohl ◽  
Christopher E. Tabor ◽  
Ryan L. Harne
Keyword(s):  
Integrated Circuits ◽  
Electronic Materials ◽  
Polymer Networks ◽  
Conductive Polymer ◽  
Network Connectivity ◽  
Logic Gates ◽  
Boolean Logic ◽  
Digital Logic ◽  
Mechanical Metamaterials ◽  
Logic Operations

AbstractIntegrated circuits utilize networked logic gates to compute Boolean logic operations that are the foundation of modern computation and electronics. With the emergence of flexible electronic materials and devices, an opportunity exists to formulate digital logic from compliant, conductive materials. Here, we introduce a general method of leveraging cellular, mechanical metamaterials composed of conductive polymers to realize all digital logic gates and gate assemblies. We establish a method for applying conductive polymer networks to metamaterial constituents and correlate mechanical buckling modes with network connectivity. With this foundation, each of the conventional logic gates is realized in an equivalent mechanical metamaterial, leading to soft, conductive matter that thinks about applied mechanical stress. These findings may advance the growing fields of soft robotics and smart mechanical matter, and may be leveraged across length scales and physics.

scholarly journals An Algebraic Study of S5-Modal Gödel Logic

Studia Logica ◽  
2021 ◽  
Author(s):  
Diego Castaño ◽  
Cecilia Cimadamore ◽  
José Patricio Díaz Varela ◽  
Laura Rueda
Keyword(s):  
Gödel Logic

scholarly journals Polymorphic circuit generation using random boolean logic expansion

2020 ◽  
Author(s):  
Jeffrey T. McDonald ◽  
Trinity L. Stroud ◽  
Todd R. Andel
Keyword(s):  
Boolean Logic

scholarly journals INFINITARY PROPOSITIONAL RELEVANT LANGUAGES WITH ABSURDITY

2017 ◽  
Vol 10 (4) ◽  
pp. 663-681
Author(s):  
GUILLERMO BADIA
Keyword(s):  
Expressive Power ◽  
Interpolation Theorem ◽  
Boolean Logic ◽  
Isomorphism Theorem ◽  
Strong Completeness ◽  
Lack Of Compactness ◽  
Relevant Logics ◽  
Beth Definability ◽  
Beth Definability Property

AbstractAnalogues of Scott’s isomorphism theorem, Karp’s theorem as well as results on lack of compactness and strong completeness are established for infinitary propositional relevant logics. An “interpolation theorem” (of a particular sort introduced by Barwise and van Benthem) for the infinitary quantificational boolean logic L∞ω holds. This yields a preservation result characterizing the expressive power of infinitary relevant languages with absurdity using the model-theoretic relation of relevant directed bisimulation as well as a Beth definability property.

Search Engine Update

2001 ◽  
Vol 1 (3) ◽  
pp. 28-31 ◽  
Author(s):  
Valerie Stevenson
Keyword(s):  
Search Engine ◽  
Search Engines ◽  
Search Strategy ◽  
Search Strategies ◽  
Boolean Logic ◽  
Web Searches ◽  
Search Techniques ◽  
Looking Back ◽  
The Web

Looking back to 1999, there were a number of search engines which performed equally well. I recommended defining the search strategy very carefully, using Boolean logic and field search techniques, and always running the search in more than one search engine. Numerous articles and Web columns comparing the performance of different search engines came to different conclusions on the ‘best’ search engines. Over the last year, however, all the speakers at conferences and seminars I have attended have recommended Google as their preferred tool for locating all kinds of information on the Web. I confess that I have now abandoned most of my carefully worked out search strategies and comparison tests, and use Google for most of my own Web searches.

Programming Cell Adhesion for On-Chip Sequential Boolean Logic Functions

2017 ◽  
Vol 139 (30) ◽  
pp. 10176-10179 ◽  
Author(s):  
Xiangmeng Qu ◽  
Shaopeng Wang ◽  
Zhilei Ge ◽  
Jianbang Wang ◽  
Guangbao Yao ◽  
...  
Keyword(s):  
Cell Adhesion ◽  
Boolean Logic ◽  
On Chip ◽  
Logic Functions

Automated Deduction in Gödel Logic

2018 ◽  
Vol 19 (3) ◽  
pp. 1-28
Author(s):  
Dušan Guller
Keyword(s):  
Automated Deduction ◽  
Gödel Logic
Sign in / Sign up

Export Citation Format

Share Document