• The KIPS Transactions:PartD
• /
• v.10D no.5
• /
• pp.813-820
• /
• 2003

This paper solves Push-Push game with the model checker NuSMY which exhaustively explores all search space to determine whether a model satisfies a property. In case a model doesn't satisfy properties to be checked, NuSMV generates a counterexample which tells where this unsatisfaction occurs. However, the algorithm for generating counterexample in NuSMV traverses a search space twice so that it is inefficient for solving the game we consider here. To save the time to be required to complete the game, we revise the part of counterexample generation so that it traverses a search space once. As a result, we obtain 62% time improvement and 11% space improvement in solving the game with modified NuSMV.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.81-90
• /
• 2005

Given a model and a property, model checking determines whether the model satisfies the property. In case the model does not satisfy the property model checking gives a counterexample which explains where the violation occurs. Since counterexamples are useful for model debugging as well as model understanding, counterexample generation is one of the indispensable components in the model checking tool. This paper presents efficient counterexample generation techniques when a safety property is falsified. These techniques are used to solve Push Push games which consist of 50 games. As a result, all the games are solved with the proposed techniques. However, with the original NuSMV, 42 games are solved but 8 failed. In addition, we obtain $86{\%}$ time improvement and $62{\%}$ space improvement compared to the original NuSMV in solving the game.

• Journal of Integrative Natural Science
• /
• v.10 no.4
• /
• pp.240-244
• /
• 2017

We study the behavior of some invariants under completion. We also give a counterexample, which is the same as a counterexample to Ding's Conjecture, to Koh-Lee's Conjecture.

• Korean Journal of Logic
• /
• v.18 no.3
• /
• pp.337-358
• /
• 2015

Vann Mcgee produced "counterexamples" to Modus Ponens in "A Counterexample to Modus Ponens". Discussions about the examples tended to focus on a probabilistic reading of conditional statements. This article attempts to establish both (1) Modus Ponens is a deductively valid rule of inference, and (2) the counterexample-like appearance of Mcgee's example can be (and should be) explained without making a reference to the notion of conditional probability. The reason why his examples seem to counter Modus Ponens is found rather within the ambiguity a conditional statement exhibits. That is, Mcgee's examples are cases of equivocation on the conditional statements involved.

• Communications of Mathematical Education
• /
• v.30 no.3
• /
• pp.393-418
• /
• 2016

Theory and fundamentals of mathematics consist mostly of proposition form. Activities by research of the proposition which leads to determine the true or false, justify the true propositions and refute with counterexample improve logical reasoning skills of students in emphases on mathematics education. Also, utilizing of counterexamples in school mathematics combines mathematical knowledge through the process of finding a counterexample, help the concept study and increase the critical thinking. These effects have been found through previous research. But many studies say that the learners have difficulty in generating counterexamples for false propositions and materials have not been developed a lot for the counterexample utilizing that can be applied in schools. So, this study analyzed the current textbook and examined the use of counterexamples and developed educational materials for counterexamples that can be applied at schools. That materials consisted of making true & false propositions and students was divided into three groups of academic achievement level. And then this study looked at the change of the students' thinking after counterexample classes. As a study result, in all three groups was showed a positive change in the cognitive domain and affective domain. Especially, in top-level group was mainly showed a positive change in the cognitive domain, in upper-middle group was mainly showed in the cognitive and the affective domain, in the sub-group was mainly found a positive change in the affective domain. Also in this study shows that the class that makes true or false propositions in education of utilizing counterexample, made students understand a given proposition, pay attention to easily overlooked condition, carefully observe symbol sign and change thinking of cognitive domain helping concept learning regardless of academic achievement levels of learners. Also, that class gave positive affect to affective domain that increase interest in the proposition and gain confidence about proposition.

• Communications of the Korean Mathematical Society
• /
• v.25 no.3
• /
• pp.491-495
• /
• 2010

In a paper by Hou Jicheng, On some KKM type theorems, Advaces in Mathematics 36 (2007), no. 1, 86-88, the author claimed that some previous KKM type theorems are false by giving a counterexample. In the present paper, we show that the counterexample does not work and, consequently, the results are correct. Moreover, we claim that the artificial concept like transfer compactly closed-valued maps can be destroyed. Finally, we introduce a theorem generalizing the main target of Hou.

• Communications of the Korean Mathematical Society
• /
• v.28 no.2
• /
• pp.231-241
• /
• 2013

On the framework of the 2-adic group $\mathcal{Z}_2$, we study a Sobolev-like inequality where we estimate the $L^2$ norm by a geometric mean of the BV norm and the $\dot{B}_{\infty}^{-1,{\infty}}$ norm. We first show, using the special topological properties of the $p$-adic groups, that the set of functions of bounded variations BV can be identified to the Besov space ˙$\dot{B}_1^{1,{\infty}}$. This identification lead us to the construction of a counterexample to the improved Sobolev inequality.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.142-144
• /
• 2006

모델 체킹(model checking)은 자동으로 소프트웨어의 속성을 검증하는 기법으로 그 필요성이 꾸준히 증가하고 있다. 시스템이 특정 속성(property)을 만족하지 않는 경우 모델 체커는 반례(Counterexample)를 생성하게 된다. 반례는 오류가 발생한 원인을 담고 있는 정보로서 오류를 이해하고 수정하는 작업에 많은 도움을 준다. 하지만 반례가 너무 길거나 이해하기 어려운 경우에는 분석에 많은 시간과 자원이 소요되기도 한다. 따라서 자동적으로 반례 안의 오류를 찾아내고 설명을 제공하는 기법의 필요성이 대두되고 있다. 본 논문에서는 추상모델(abstract model)에서 생성된 반례의 오류의 원인을 밝히는 자동화 기법을 제시한다.

• Korean Journal of Logic
• /
• v.19 no.2
• /
• pp.233-251
• /
• 2016

In their recent paper published in this journal Shin Kim and Jinyong Lee have attacked some previous studies on the counterexample to modus ponens. Among their arguments I would like to discuss the following two; first, those attempts to explain van McGee's example by reference to conditional probability do not accord with van McGee's position, second, van McGee'e example is to be best seen as an argument containing the fallacy of equivocation. I show that the first argument is not correct, the second one is not so persuasive as it seemed first.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.885-898
• /
• 2019

This paper gives a counterexample to show that the first order commutator $C_2$ is not bounded from $H^1({\mathbb{R}}){\times}H^1({\mathbb{R}})$ into $L^{1/2}({\mathbb{R}})$. Then we introduce the atomic definition of abstract weighted Hardy spaces $H^1_{ato,{\omega}}$$({\mathbb{R}})$ and study its properties. At last, we prove that $C_2$ maps $H^1_{ato,{\omega}}$$({\mathbb{R}}){\times}H^1_{ato,{\omega}}$$({\mathbb{R}})$ into $L^{1/2}_{\omega}$$({\mathbb{R}})$.