KR101432328B1 - 제약조건 솔버 처리를 용이하게 해주는 컴퓨터 구현 시스템, 컴퓨터 구현 제약조건 솔버 처리 방법, 및 컴퓨터 구현 솔버 시스템 - Google Patents

제약조건 솔버 처리를 용이하게 해주는 컴퓨터 구현 시스템, 컴퓨터 구현 제약조건 솔버 처리 방법, 및 컴퓨터 구현 솔버 시스템 Download PDF

Info

Publication number
KR101432328B1
KR101432328B1 KR1020097007032A KR20097007032A KR101432328B1 KR 101432328 B1 KR101432328 B1 KR 101432328B1 KR 1020097007032 A KR1020097007032 A KR 1020097007032A KR 20097007032 A KR20097007032 A KR 20097007032A KR 101432328 B1 KR101432328 B1 KR 101432328B1
Authority
KR
South Korea
Prior art keywords
solver
graph
constraint
parallel
processing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
KR1020097007032A
Other languages
English (en)
Korean (ko)
Other versions
KR20090085028A (ko
Inventor
알렌 엘. 브라운 주니어
Original Assignee
마이크로소프트 코포레이션
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 마이크로소프트 코포레이션 filed Critical 마이크로소프트 코포레이션
Publication of KR20090085028A publication Critical patent/KR20090085028A/ko
Application granted granted Critical
Publication of KR101432328B1 publication Critical patent/KR101432328B1/ko
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/30—Creation or generation of source code
    • G06F8/31—Programming languages or programming paradigms
    • G06F8/314—Parallel programming languages
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/30—Creation or generation of source code
    • G06F8/31—Programming languages or programming paradigms
    • G06F8/313—Logic programming, e.g. PROLOG programming language
    • G06F8/3135—Unification or backtracking
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/01—Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N20/00—Machine learning
    • G06N20/10—Machine learning using kernel methods, e.g. support vector machines [SVM]
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/08—Learning methods
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computing arrangements using knowledge-based models
    • G06N5/04—Inference or reasoning models
    • G06N5/048—Fuzzy inferencing
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computing arrangements based on specific mathematical models
    • G06N7/01—Probabilistic graphical models, e.g. probabilistic networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • Mathematical Physics (AREA)
  • Computational Linguistics (AREA)
  • Artificial Intelligence (AREA)
  • Computer Hardware Design (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
KR1020097007032A 2006-11-20 2007-11-19 제약조건 솔버 처리를 용이하게 해주는 컴퓨터 구현 시스템, 컴퓨터 구현 제약조건 솔버 처리 방법, 및 컴퓨터 구현 솔버 시스템 Expired - Fee Related KR101432328B1 (ko)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US11/602,092 US7543266B2 (en) 2006-11-20 2006-11-20 Lock-free state merging in parallelized constraint satisfaction problem solvers
US11/602,092 2006-11-20
PCT/US2007/085149 WO2008064185A1 (en) 2006-11-20 2007-11-19 Lock-free state merging in parallelized constraint satisfaction problem solvers

Publications (2)

Publication Number Publication Date
KR20090085028A KR20090085028A (ko) 2009-08-06
KR101432328B1 true KR101432328B1 (ko) 2014-08-20

Family

ID=39418265

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020097007032A Expired - Fee Related KR101432328B1 (ko) 2006-11-20 2007-11-19 제약조건 솔버 처리를 용이하게 해주는 컴퓨터 구현 시스템, 컴퓨터 구현 제약조건 솔버 처리 방법, 및 컴퓨터 구현 솔버 시스템

Country Status (8)

Country Link
US (1) US7543266B2 (enExample)
EP (1) EP2084615B1 (enExample)
JP (1) JP4707760B2 (enExample)
KR (1) KR101432328B1 (enExample)
CN (1) CN101542460B (enExample)
CA (1) CA2668121C (enExample)
IL (1) IL197775A (enExample)
WO (1) WO2008064185A1 (enExample)

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7987352B2 (en) * 2007-11-30 2011-07-26 Intel Corporation Booting with sub socket partitioning
US20100057647A1 (en) * 2008-09-04 2010-03-04 Microsoft Corporation Accommodating learned clauses in reconfigurable hardware accelerator for boolean satisfiability solver
CN101685408B (zh) * 2008-09-24 2013-10-09 国际商业机器公司 多个线程并行访问共享数据结构的方法及装置
US20100169618A1 (en) * 2008-12-30 2010-07-01 Microsoft Corporation Identifying concurrency control from a sequential proof
US8346704B2 (en) * 2009-05-13 2013-01-01 Microsoft Corporation Controlled constraint sharing in parallel problem solvers
US9031890B2 (en) * 2010-08-04 2015-05-12 Sherwin Han Inverse function method of boolean satisfiability (SAT)
CN102467583B (zh) * 2010-10-29 2014-07-23 国际商业机器公司 追踪不确定信号的方法和装置
US8589327B2 (en) 2011-04-22 2013-11-19 International Business Machines Corporation Efficiently determining boolean satisfiability with lazy constraints
US8413091B2 (en) 2011-04-22 2013-04-02 International Business Machines Corporation Enhancing redundancy removal with early merging
US8874498B2 (en) 2011-09-16 2014-10-28 International Business Machines Corporation Unsupervised, supervised, and reinforced learning via spiking computation
US8738554B2 (en) 2011-09-16 2014-05-27 International Business Machines Corporation Event-driven universal neural network circuit
US8799199B2 (en) 2011-12-14 2014-08-05 International Business Machines Corporation Universal, online learning in multi-modal perception-action semilattices
US8626684B2 (en) 2011-12-14 2014-01-07 International Business Machines Corporation Multi-modal neural network for universal, online learning
US8676866B2 (en) * 2012-03-19 2014-03-18 Sap Ag Computing canonical hierarchical schemas
CN104395900B (zh) 2013-03-15 2017-08-25 北京未名博思生物智能科技开发有限公司 序列比对的空间计数运算方法
CN105190632B (zh) 2013-04-04 2018-06-05 韩小文 构造非确定性(np)图灵机的多项式方法
US9311429B2 (en) 2013-07-23 2016-04-12 Sap Se Canonical data model for iterative effort reduction in business-to-business schema integration
FI20135946A7 (fi) * 2013-09-23 2015-03-24 Procomp Solutions Oy Rinnakkainen ratkaisun muodostaminen
US11481468B2 (en) * 2014-06-03 2022-10-25 Qualcomm Technologies, Inc. Systems and methods for solving unrestricted incremental constraint problems
US9418137B2 (en) 2014-08-29 2016-08-16 Sherwin Han Database without structured query language
US9424103B2 (en) * 2014-09-30 2016-08-23 Hong Kong Applied Science and Technology Research Institute Company Limited Adaptive lock for a computing system having multiple runtime environments and multiple processing units
US10540477B2 (en) * 2016-05-02 2020-01-21 Siemens Industry Software Nv Space modeling language for the generation of engineering designs
CN106201988A (zh) * 2016-08-03 2016-12-07 桂林电子科技大学 一种重构高性能目标阵列的方法
KR102820745B1 (ko) 2018-12-31 2025-06-13 삼성전자주식회사 폴링 시간을 예측하는 뉴럴 네트워크 시스템 및 이를 이용한 뉴럴 네트워크 모델 처리 방법

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5469367A (en) * 1994-06-06 1995-11-21 University Technologies International Inc. Methodology and apparatus for modular partitioning for the machine design of asynchronous circuits

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4918621A (en) 1986-08-13 1990-04-17 Intellicorp, Inc. Method for representing a directed acyclic graph of worlds using an assumption-based truth maintenance system
JPH0789220B2 (ja) * 1987-05-28 1995-09-27 富士写真フイルム株式会社 版材焼付装置
US5276775A (en) 1990-12-07 1994-01-04 Texas Instruments Inc. System and method for building knowledge-based applications
JPH0785748B2 (ja) * 1991-08-06 1995-09-20 三郎 狩野 ゴルフ場のピンに付設する標示体
JPH10275084A (ja) * 1997-03-31 1998-10-13 Toshiba Corp 制約充足問題の解決装置及び解決方法、システム構築装置及び構築方法
US6038392A (en) * 1998-05-27 2000-03-14 Nec Usa, Inc. Implementation of boolean satisfiability with non-chronological backtracking in reconfigurable hardware
US6684359B2 (en) * 2000-11-03 2004-01-27 Verisity Ltd. System and method for test generation with dynamic constraints using static analysis
US7085748B2 (en) * 2001-02-16 2006-08-01 International Business Machines Corporation Hyper-arc consistency in a contraint satisfaction network
US7418369B2 (en) 2001-09-07 2008-08-26 The Trustees Of Princeton University Method and system for efficient implementation of boolean satisfiability
WO2006020729A2 (en) 2004-08-12 2006-02-23 Sandbridge Technologies, Inc. Recognition of acyclic instruction patterns
US7203917B2 (en) * 2003-04-07 2007-04-10 Nec Laboratories America, Inc. Efficient distributed SAT and SAT-based distributed bounded model checking
US7089220B2 (en) * 2003-06-24 2006-08-08 Palo Alto Research Center Incorporated Complexity-directed cooperative problem solving
US7171393B2 (en) 2003-07-22 2007-01-30 International Business Machines Corporation Solving constraint satisfaction problems using variable-range hopping
US7194710B2 (en) 2004-03-23 2007-03-20 Fujitsu Limited Scheduling events in a boolean satisfiability (SAT) solver
GB0407260D0 (en) 2004-03-31 2004-05-05 Ibm Accelerated solution of constraint satisfaction problems by partioning of the variable space
US7370296B2 (en) 2004-05-25 2008-05-06 International Business Machines Corporation Modeling language and method for address translation design mechanisms in test generation

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5469367A (en) * 1994-06-06 1995-11-21 University Technologies International Inc. Methodology and apparatus for modular partitioning for the machine design of asynchronous circuits

Also Published As

Publication number Publication date
EP2084615A4 (en) 2012-08-01
CN101542460B (zh) 2012-03-21
CA2668121A1 (en) 2008-05-29
IL197775A0 (en) 2009-12-24
WO2008064185A1 (en) 2008-05-29
JP4707760B2 (ja) 2011-06-22
CA2668121C (en) 2015-04-21
KR20090085028A (ko) 2009-08-06
IL197775A (en) 2013-07-31
US7543266B2 (en) 2009-06-02
US20080120490A1 (en) 2008-05-22
CN101542460A (zh) 2009-09-23
JP2010510591A (ja) 2010-04-02
EP2084615A1 (en) 2009-08-05
EP2084615B1 (en) 2017-10-25

Similar Documents

Publication Publication Date Title
KR101432328B1 (ko) 제약조건 솔버 처리를 용이하게 해주는 컴퓨터 구현 시스템, 컴퓨터 구현 제약조건 솔버 처리 방법, 및 컴퓨터 구현 솔버 시스템
Pellet et al. Using markov blankets for causal structure learning.
US8660905B2 (en) Method and system for validating process models
Korovin Inst-Gen–a modular approach to instantiation-based automated reasoning
Bromberg et al. Efficient Markov network structure discovery using independence tests
US8005770B2 (en) Parallel generation of a bayesian network
Hassan et al. Incremental, inductive CTL model checking
Zheng et al. PACE: learning effective task decomposition for human-in-the-loop healthcare delivery
Sun et al. Edge generation scheduling for DAG tasks using deep reinforcement learning
Seifan et al. Uniform interpolation in coalgebraic modal logic
Wu et al. On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Job Scheduling
Song et al. Improved reachability analysis in DTMC via divide and conquer
WO2020044414A1 (ja) 仮説推論装置、仮説推論方法、及びコンピュータ読み取り可能な記録媒体
Klinkhamer et al. Shadow/puppet synthesis: A stepwise method for the design of self-stabilization
Brand et al. A decision diagram operation for reachability
Hansen et al. Partial order reduction for model checking Markov decision processes under unconditional fairness
Fan et al. Parallel reasoning of graph functional dependencies
Flocchini et al. Gathering and election by mobile robots in a continuous cycle
Jezequel et al. Factored planning: From automata to Petri nets
Attiya et al. Separating lock-freedom from wait-freedom
Huang et al. An Efficient Procedure for Computing Bayesian Network Structure Learning
Hunter et al. Reactive synthesis without regret
Huang et al. Partitioned hybrid learning of Bayesian network structures
Riffi On improving complexity of linearizable and wait-free implementations of concurrent objects by relaxing their specifications.
Merz Model checking techniqes for the analysis of reactive systems

Legal Events

Date Code Title Description
PA0105 International application

St.27 status event code: A-0-1-A10-A15-nap-PA0105

PG1501 Laying open of application

St.27 status event code: A-1-1-Q10-Q12-nap-PG1501

R17-X000 Change to representative recorded

St.27 status event code: A-3-3-R10-R17-oth-X000

A201 Request for examination
E13-X000 Pre-grant limitation requested

St.27 status event code: A-2-3-E10-E13-lim-X000

P11-X000 Amendment of application requested

St.27 status event code: A-2-2-P10-P11-nap-X000

P13-X000 Application amended

St.27 status event code: A-2-2-P10-P13-nap-X000

PA0201 Request for examination

St.27 status event code: A-1-2-D10-D11-exm-PA0201

E902 Notification of reason for refusal
PE0902 Notice of grounds for rejection

St.27 status event code: A-1-2-D10-D21-exm-PE0902

PN2301 Change of applicant

St.27 status event code: A-3-3-R10-R13-asn-PN2301

St.27 status event code: A-3-3-R10-R11-asn-PN2301

P11-X000 Amendment of application requested

St.27 status event code: A-2-2-P10-P11-nap-X000

P13-X000 Application amended

St.27 status event code: A-2-2-P10-P13-nap-X000

E701 Decision to grant or registration of patent right
PE0701 Decision of registration

St.27 status event code: A-1-2-D10-D22-exm-PE0701

GRNT Written decision to grant
PR0701 Registration of establishment

St.27 status event code: A-2-4-F10-F11-exm-PR0701

PR1002 Payment of registration fee

St.27 status event code: A-2-2-U10-U12-oth-PR1002

Fee payment year number: 1

PG1601 Publication of registration

St.27 status event code: A-4-4-Q10-Q13-nap-PG1601

PN2301 Change of applicant

St.27 status event code: A-5-5-R10-R11-asn-PN2301

PN2301 Change of applicant

St.27 status event code: A-5-5-R10-R14-asn-PN2301

FPAY Annual fee payment

Payment date: 20170719

Year of fee payment: 4

PR1001 Payment of annual fee

St.27 status event code: A-4-4-U10-U11-oth-PR1001

Fee payment year number: 4

R18-X000 Changes to party contact information recorded

St.27 status event code: A-5-5-R10-R18-oth-X000

FPAY Annual fee payment

Payment date: 20180718

Year of fee payment: 5

PR1001 Payment of annual fee

St.27 status event code: A-4-4-U10-U11-oth-PR1001

Fee payment year number: 5

R17-X000 Change to representative recorded

St.27 status event code: A-5-5-R10-R17-oth-X000

FPAY Annual fee payment

Payment date: 20190718

Year of fee payment: 6

PR1001 Payment of annual fee

St.27 status event code: A-4-4-U10-U11-oth-PR1001

Fee payment year number: 6

PR1001 Payment of annual fee

St.27 status event code: A-4-4-U10-U11-oth-PR1001

Fee payment year number: 7

PR1001 Payment of annual fee

St.27 status event code: A-4-4-U10-U11-oth-PR1001

Fee payment year number: 8

PR1001 Payment of annual fee

St.27 status event code: A-4-4-U10-U11-oth-PR1001

Fee payment year number: 9

PR1001 Payment of annual fee

St.27 status event code: A-4-4-U10-U11-oth-PR1001

Fee payment year number: 10

PC1903 Unpaid annual fee

St.27 status event code: A-4-4-U10-U13-oth-PC1903

Not in force date: 20240814

Payment event data comment text: Termination Category : DEFAULT_OF_REGISTRATION_FEE

PC1903 Unpaid annual fee

St.27 status event code: N-4-6-H10-H13-oth-PC1903

Ip right cessation event data comment text: Termination Category : DEFAULT_OF_REGISTRATION_FEE

Not in force date: 20240814