• Title/Summary/Keyword: SAT 문제

Search Result 35, Processing Time 0.034 seconds

A Development of Cj -SAT Model For Evaluation on Technoloy Concept Alternatives (기술컨셉대체안의 평가를 위한 "컨조인트 SAT" 모형의 개발)

  • Choe, Su-Min;Gwon, Cheol-Sin
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.117-122
    • /
    • 2005
  • 신기술을 개발하기 위해서는 다수의 단말기술들이 요구된다. 이 단말기술들은 ${\ulcorner}$SAT${\lrcorner}$ 구조에 의해 구성되는 것이 효율적이며, 이를 통해 다수의 기술컨셉대체안이 도출된다. 그러나, 평가의 투표양식 ( Ballot Form ) 과 ${\ulcorner}$SPN ( System Priority Number )${\lrcorner}$ 를 활용하는 ${\ulcorner}$SAT${\lrcorner}$ 평가방식으로는 평가자의 단편적인 선호도만이 분석가능하며, 투표과정이 번거롭다는 단점이 있다. 이러한 문제 해결을 위해 본 연구에서는 기술컨셉대체안이 요구기능과 실현수단의 순환계층구조로 표현되는 ${\ulcorner}$SAT${\lrcorner}$ 에, 전문기술집단의 선호구조를 정밀히 분석하기 위해 단말기술의 속성변수와 속성수준화를 규정하여 평가하도록 하는 ${\ulcorner}$컨조인트 분석${\lrcorner}$ 을 결합한 ${\ulcorner}$컨조인트 SAT모형 (CJ-SAT Model)${\lrcorner}$ 을 개발하였다.

  • PDF

Extracting Structural Information from CNF (회로에서 생성된 CNF에서 회로 정보 추출)

  • Nam, Myoung-Jin;Sung, Chang-Hun;Choi, Jin-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.997-1000
    • /
    • 2004
  • Boolean Satisfiability (SAT)는 전산학의 중요한 문제로서 SAT problem을 풀기 위한 많은 알고리즘과 도구들이 제안되어 왔다. 특히, 지난 몇 년 간 많은 발전을 이루어왔고, 하드웨어 검증과 모델 체킹 등의 분야에서 많이 적용되어 왔다. 여러 문제들을 Conjunctive Normal Form (CNF)로 표현하여 CNF의 특성을 이용하여 SAT 알고리즘이 발전되어 왔다. 그런데, 회로를 CNF로 표현할 때 몇 가지 문제점이 발생하는데 특히 CNF는 회로의 structural information 을 잃어버린다는 것이 큰 문제점이다. 이를 보완하기 위하여 회로의 structural information을 이용하기 위한 많은 연구가 진행되어 왔다. 이러한 대부분의 연구는 회로의 정보를 가지고 있다는 경우에 한정된다. 그러나, 하드웨어 검증에서 회로의 정보 없이 검증해야 하는 경우들도 발생한다. 이 논문은 회로의 정보를 가지고 있지 않을 때 CNF 만으로 회로의 structural information을 추론하는 방법을 제시한다.

  • PDF

Equivalence Checking Finite State Machines with SAT-Procedure (SAT 프로시져를 이용한 유한 상태 기계의 동치 검사)

  • 엄태호;권기현;김태훈
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.37-39
    • /
    • 2003
  • 본 연구에서는 만족성 검사기를 이용하여 두 유한 상태 기계의 행위가 동치인지를 검사한다. 기존의 동치 검사는 대부분 BDD를 기반으로 했었기 때문에 변수 순서 배열 및 내부 BDD노드 폭발 문제에 시달렸었다. 하지만 여기서는 BDD대신 명제 논리를 이용하기 때문에 위와 같은 문제점을 피할 수 있다. 하지만 논리식을 만족성 검사기의 입력 형태인 논리곱 정규형으로 변환하는 과정에서 절의 3기는 식의 크기에 지수적으로 증가하였다.

  • PDF

Extracting Subsequence of Boolean Variables using SAT-solver (만족가능성 처리기를 이용한 이진 변수 서브시퀀스 추출)

  • Park, Sa-Choun;Kwon, Gi-Hwon
    • The KIPS Transactions:PartD
    • /
    • v.15D no.6
    • /
    • pp.777-784
    • /
    • 2008
  • Recently in the field of model checking, to overcome the state explosion problem, the method of using a SAT-solver is mainly researched. To use a SAT-solver, the system to be verified is translated into CNF and the Boolean cardinality constraint is widely used in translating the system into CNF. In BCC it is dealt with set of boolean variables, but there is no translating method of the sequence among Boolean variables. In this paper, we propose methods for translating the problem, which is extracting a subsequence with length k from a sequence of Boolean variables, into CNF formulas. Through experimental results, we show that our method is more efficient than using only BCC.

A New SAT Encoding for Solving Sudoku (수도쿠 풀이를 위한 새로운 SAT 인코딩)

  • Park, Jun-Kil;Choi, Jin-Young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06b
    • /
    • pp.487-492
    • /
    • 2007
  • 수도쿠를 푸는 것은 오락으로서 뿐 아니라 컴퓨터 계산 문제로서도 흥미롭다. 수도쿠는 minimal과 extended 인코딩을 통해 SAT로 변환되고, 탐색이 아닌 추론기술의 반복 적용을 통해 다항시간에 해를 찾을 수 있다. minimal과 extended 인코딩은 직관적이지만 고차 수도쿠($16\times16$ 이상)를 풀기에 충분하지 못하다. 이 논문에서는 extended 인코딩을 개선한 블록 인코딩을 제안한다. 블록 인코딩을 $16\times16$$25\times25$ 퍼즐 집합에 적용 했을 때 extended 인코딩에 비해 추론기술에 따라 1%에서 12% 더 많은 수의 퍼즐을 푸는 것을 실험을 통하여 보인다.

  • PDF

Linear Regression-Based Precision Enhancement of Summed Area Table (선형 회귀분석 기반 합산영역테이블 정밀도 향상 기법)

  • Jeong, Juhyeon;Lee, Sungkil
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.11
    • /
    • pp.809-814
    • /
    • 2013
  • Summed area table (SAT) is a data structure in which the sum of pixel values in an arbitrary rectangular area can be represented by the linear combination of four pixel values. Since SAT serially accumulates the pixel values from an image corner to the other corner, a high-resolution image can yield overflow in a floating-point representation. In this paper, we present a new SAT construction technique, which accumulates only the residuals from the linearly-regressed representation of an image and thereby significantly reduces the accumulation errors. Also, we propose a method to find the integral of the linear regression in constant time using double integral. We performed experiments on the image reconstruction, and the results showed that our approach more reduces the accumulation errors than the conventional fixed-offset SAT.

Detection Probability Evaluation of LEO Satellites based Automatic Identification System for a Maritime-Terrestrial Integrated Network (해상육상통합환경에서 저궤도 위성기반 AIS 시스템의 검출확률 성능평가)

  • Lee, Woo-Young;Choi, Jo-Chun;Lee, Jin-Seok;Lee, Seong-Ro;Lee, Yeon-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.5B
    • /
    • pp.530-538
    • /
    • 2011
  • In this paper, the feasibility of LEO(low earth orbit) satellite-based automatic identification system (SAT-AIS) for the coastal area of the South Korea is evaluated in the context of ship AIS transmission detection probability. We evaluate and compare AIS signal detection probability of ORBCOMM satellites and LEO-one satellites considering link budget, SOTDMA protocol and satellite's swath width. The simulation determines the total number of vessels served by those satellites according to satellite's swath width and thus, By simulation results, the ORBCOMM SAT-AIS system outperforms LEO-one SAT-AIS system. The suggested ORBCOMM based SAT-AIS system can be a solution to resolve the existing limited transmission distance problem of the conventional ship-to-shore AIS system.

Optimal CNF Encoding for Representing Adjacency in Boolean Cardinality Constraints (이진 기수 조건에서 인접성 표현을 위한 최적화된 CNF 변환)

  • Park, Sa-Choun;Kwon, Gi-Hwon
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.11
    • /
    • pp.661-670
    • /
    • 2008
  • In some applications of software engineering such as the verification of software model or embedded program, SAT solver is used. To practical use a SAT solver, a problem is encoded to a CNF formula, but because the formula has lower expressiveness than software models or source codes, optimal CNF encoding is required. In this paper, we propose optimal encoding techniques for the problem of "Selecting adjacent $k{\leq}n$ among n objects," Through experimental results we show the proposed constraint is efficient and correct to solve Japanese puzzle. As we know, this paper is the first study about CNF encoding for adjacency in BCC.

An Experimental Study on Rapid Repairing Mortar for Road with Steel Slag (철강 슬래그를 사용한 도로용 긴급보수 모르타르에 관한 실험적 연구)

  • Jung, Ui-In;Kim, Bong-Joo;im, Jin-Man;Kwak, Eun-Gu
    • Journal of the Korea Institute of Building Construction
    • /
    • v.18 no.5
    • /
    • pp.419-427
    • /
    • 2018
  • The purpose of this study is to recycle steel slag generated from the iron producing process and to use steel slag as a construction material which is currently landfilled Steel slag is subjected to aging treatment due to the problem of expansion and collapse when it reacts with water. The Slag Atomizing Technology (SAT) method developed to solve these problems of expanding collapse of steel slag. In this study, experimental study on the emergency repair mortar using the reducing slag, electric arc furnace slag and silicon manganese slag manufactured by the SAT method is Reduced slag was shown an accelerated hydration when it was replaced with rapidly-setting cement, and the rate of substitution was equivalent to 15%. It is shown that the electric furnace oxide slag is equivalent to 100% of the natural aggregate, and it can be replaced by 15-30% when the silicon manganic slag is substituted for the electric furnace oxide slag. With the above formulation, it was possible to design the rapidly repair mortar for road use. These recycling slags can contribute on achieving sustainability of construction industry by reducing the use of cement and natural aggregates and by reducing the generation of carbon dioxide and recycling waste slag.

The Analysis of the Relationship between the Elementary Students' Specialty-Aptitude and Programming Ability - a Case of LOGO Language Use (초등학생의 프로그래밍 능력과 특기적성간의 관계 분석 - 로고 언어 활용 사례)

  • Lee, HyeonSuk;Lee, SooJung
    • The Journal of Korean Association of Computer Education
    • /
    • v.12 no.3
    • /
    • pp.23-30
    • /
    • 2009
  • Most previous studies on programming learning effect is limited to measuring the enhancement degree of creativity and problem solving ability. This study is to find out indexes related to programming ability, other than creativity and problem solving ability by the specialty-aptitude test(SAT) in the elementary school. For this, 4th grade elementary students took LOGO programming class and the achievement test. As a result, among 4 regions of SAT, all five indexes of intellectual ability is highly related to programming ability, indicating that students with high intelligence rather than creativity have higher programming ability and that for our experiment settings the reverse of the previous result stating that programming education positively affects the development of problem solving ability and creativity does not hold.

  • PDF