The concept of learning: Once more with (logical) expression

Synthese ◽  
1982 ◽  
Vol 51 (1) ◽  
pp. 87-116 ◽  
Author(s):  
James E. McClellan
Keyword(s):  

2019 ◽  
pp. 40-47
Author(s):  
E. A. Mironchik

The article discusses the method of solving the task 18 on the Unified State Examination in Informatics (Russian EGE). The main idea of the method is to write the conditions of the problem utilizing the language of formal logic, using elementary predicates. According to the laws of logic the resulting complex logical expression would be transformed into an expression, according to which a geometric model is supposed to be constructed which allows to obtain an answer. The described algorithm does allow high complexity problem to be converted into a simple one.



Author(s):  
Martin H. Weik
Keyword(s):  


2020 ◽  
Vol 65 (1) ◽  
pp. 397-403 ◽  
Author(s):  
Jiliang Luo ◽  
Weimin Wu ◽  
Mengchu Zhou ◽  
Hui Shao ◽  
Kenzo Nonami ◽  
...  


2020 ◽  
Vol 29 (03n04) ◽  
pp. 2060003
Author(s):  
Claudette Cayrol ◽  
Marie-Christine Lagasquie-Schiex

We propose a logical encoding of argumentation frameworks with higher-order interactions (i.e. attacks/supports whose targets are arguments or other attacks/supports) with an evidential meaning for supports. Our purpose is to separate the logical expression of the meaning of an attack or an evidential support (simple or higher-order) from the logical expression of acceptability semantics. We consider semantics which specify the conditions under which the arguments (resp. the attacks/supports) are considered as accepted, directly on the extended framework, without translating the original framework into a Dung’s argumentation framework. We characterize the output of a given framework in logical terms (namely as particular models of a logical theory). Our proposal applies to the particular case of Dung’s frameworks, enabling to recover standard extensions.



1927 ◽  
Vol 33 (3) ◽  
pp. 309-312 ◽  
Author(s):  
B. A. Bernstein
Keyword(s):  


2003 ◽  
Vol 68 (574) ◽  
pp. 55-60 ◽  
Author(s):  
Haruyuki FUJII ◽  
Yoshitsugu AOKI




2012 ◽  
Vol 557-559 ◽  
pp. 2011-2014
Author(s):  
Wei Liu ◽  
Yu Yue Du ◽  
Liang Qi ◽  
Chun Yan

A logical net element model is defined according to logical Petri net in this paper.On the basis of logical expression reasoning, the compositional operations and matching patterns of LNEs are presented. Some sufficient conditions to judge the matching pattern of two composite LNEs are obtained by theorems.



Sign in / Sign up

Export Citation Format

Share Document