Time-of-check to time-of-use - Wikipedia
In software development, time-of-check to time-of-use (TOCTOU, TOCTTOU or TOC/TOU) is a class of software bugs caused by a race condition involving the checking of the state of a part of a system (such as a security credential) and the use of the results of that check. TOCTOU race conditions are common in Unix between operations on the file system,[1] but can occur in other contexts, including loc
Lamport timestamp - Wikipedia
The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different nodes or processes will typically not be perfectly synchronized, this algorithm is used to provide a partial ordering of events with minimal overhead, and conceptually provide a starting point for the more advanced vector clock method. The algorit
巡回冗長検査 - Wikipedia
巡回冗長検査（ã˜ã‚…ã‚“ã‹ã„ã˜ã‚‡ã†ã¡ã‚‡ã†ã‘ã‚“ã•ã€è‹±: Cyclic Redundancy Check, CRC）ã¯ã€èª¤ã‚Šæ¤œå‡ºç¬¦å·ã®ä¸€ç¨®ã§ã€ä¸»ã«ãƒ‡ãƒ¼ã‚¿è»¢é€ãªã©ã«ä¼´ã†å¶ç™ºçš„ãªèª¤ã‚Šã®æ¤œå‡ºã«ã‚ˆã使ã‚ã‚Œã¦ã„る。é€ä¿¡å´ã¯å®šã‚られãŸç”Ÿæˆå¤šé …å¼ã§é™¤ç®—ã—ãŸä½™ã‚Šã‚’検査データã¨ã—ã¦ä»˜åŠ ã—ã¦é€ä¿¡ã—ã€å—ä¿¡å´ã§åŒã˜ç”Ÿæˆå¤šé …å¼ã‚’使用ã—ã¦ãƒ‡ãƒ¼ã‚¿ã‚’除算ã—ã€ãã®ä½™ã‚Šã‚’比較照åˆã™ã‚‹ã“ã¨ã«ã‚ˆã£ã¦å—信データã®èª¤ã‚Šãƒ»ç ´æを検出ã™ã‚‹ã€‚ デジタル回路ã§ç°¡å˜ã«å®Ÿè£…ã§ãã€æ•°å¦çš„ã«ã‚‚分æžãŒå®¹æ˜“ã§ã‚ã‚Šã€ã¾ãŸã€ãƒ“ットã®ãƒ©ãƒ³ãƒ€ãƒ 誤りやãƒãƒ¼ã‚¹ãƒˆèª¤ã‚Šã‚’検出ã§ãã‚‹ã®ã§ã€HDLCæ‰‹é †ã‚„CSMA/CDæ–¹å¼ãªã©ã«ãŠã„ã¦èª¤ã‚Šãƒã‚§ãƒƒã‚¯ãƒ»ä¼é€è·¯ãƒŽã‚¤ã‚ºãƒã‚§ãƒƒã‚¯ã«ã‚ˆã使ã‚ã‚Œã¦ã„る。パリティやå˜ç´”ãªåŠ ç®—ã«ã‚ˆã‚‹ãƒã‚§ãƒƒã‚¯ã‚µãƒ ã«æ¯”ã¹æ¤œå‡ºç²¾åº¦ãŒé«˜ãã€ãã®ç‚¹ã§ã¯é«˜ç´šãªãƒã‚§ãƒƒã‚¯ã‚µãƒ ã¨è¨€ãˆã‚‹ã€‚å˜ç´”ãªãƒã‚§ãƒƒã‚¯ã‚µãƒ ã¨åŒã˜ãã€ãƒ‡ãƒ¼ã‚¿ã®æ”¹ç«„ã«å¯¾ã™ã‚‹è€æ€§ã¯ãªã„。 W・ウェスレイ・ピーターソンãŒç™ºæ˜Žã—
シークエント計算 - Wikipedia
シークエント計算（シークエントã‘ã„ã•ã‚“ã€è‹±: Sequent calculus）ã¯ã€ä¸€éšŽè¿°èªžè«–ç†ã‚„特殊ãªå‘½é¡Œè«–ç†ã§åºƒã用ã„られる演繹手法ã§ã‚る。類似ã®æ‰‹æ³•ã‚‚シークエント計算ã¨å‘¼ã¶ã“ã¨ãŒã‚ã‚‹ã®ã§ã€LK ã¨å‘¼ã‚“ã§åŒºåˆ¥ã™ã‚‹ã“ã¨ãŒã‚る。ã¾ãŸé¡žä¼¼ã®æ‰‹æ³•ã‚‚å«ã‚ã€ç·ç§°ã—ã¦ã‚²ãƒ³ãƒ„ェン・システムã¨ã‚‚呼ã°ã‚Œã‚‹ã€‚ シークエント計算ã¨ãã®æ¦‚念全般ã¯è¨¼æ˜Žè«–ã‚„æ•°ç†è«–ç†å¦ã«ãŠã„ã¦é‡è¦ãªæ„味をæŒã¤ã€‚以下ã§ã¯ LK ã«ã¤ã„ã¦è§£èª¬ã™ã‚‹ã€‚
Partially ordered set - Wikipedia
indicates that the column's property is always true for the row's term (at the very left), while ✗ indicates that the property is not guaranteed in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric, is indicated by in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively. All definitions tacitly r
è¦å¯ŸåºåºƒåŸŸé‡è¦æŒ‡å®šäº‹ä»¶ - Wikipedia
ã“ã®è¨˜äº‹ã¯æ¤œè¨¼å¯èƒ½ãªå‚考文献や出典ãŒå…¨ã示ã•ã‚Œã¦ã„ãªã„ã‹ã€ä¸å分ã§ã™ã€‚ å‡ºå…¸ã‚’è¿½åŠ ã—ã¦è¨˜äº‹ã®ä¿¡é ¼æ€§å‘上ã«ã”å”力ãã ã•ã„。（ã“ã®ãƒ†ãƒ³ãƒ—レートã®ä½¿ã„方） 出典検索?: "è¦å¯ŸåºåºƒåŸŸé‡è¦æŒ‡å®šäº‹ä»¶" – ニュース · 書ç±Â · スカラー · CiNii · J-STAGE · NDL · dlib.jp · ジャパンサーãƒÂ · TWL (2023å¹´3月) åŒä¸€çŠ¯ã«ã‚ˆã‚‹çŠ¯è¡Œã¨æŽ¨å®šã•ã‚Œã‚‹ã‹ã€ã‚ã‚‹ã„ã¯ãã®å®¹ç–‘ã®ã‚る事件ãŒã€è¤‡æ•°ã®éƒ½é“府県ã§èµ·ããŸå ´åˆã€ã‚ã‚‹ã„ã¯çŠ¯è¡Œä»¶æ•°ãŒ1件ã§ã‚‚ã€æœæŸ»ã®éŽç¨‹ã§ä»–ã®éƒ½é“府県è¦å¯Ÿã«å”力をè¦è«‹ã—ãŸå ´åˆãŒæŒ‡å®šã®å¯¾è±¡ã¨ãªã‚Šã€è¦å¯ŸåºãŒæ±ºå®šã‚’ã™ã‚‹ã€‚ãã®ãŸã‚ã€è¤‡æ•°ã®éƒ½é“府県ã§äº‹ä»¶ãŒç™ºç”Ÿã—ã¦ã„ãªãã¦ã‚‚指定ã•ã‚Œã‚‹äº‹ä»¶ã‚‚稀ã«å˜åœ¨ã™ã‚‹ãŒã€åŸºæœ¬çš„ã«ã€çŠ¯è¡Œä»¶æ•°ãŒè¤‡æ•°ã§ã‚‚一ã¤ã®éƒ½é“府県内ã«ç•™ã¾ã‚‹ã¨è¦‹è¾¼ã¾ã‚Œã‚‹äº‹ä»¶ã§ã‚ã‚Œã°ã€æŒ‡å®šã®å¯¾è±¡ã¨ã¯ãªã‚‰ãªã„。 æ¨ªé ˆè³€ç·šé›»è»Šçˆ†ç ´äº‹ä»¶ã¯ä¸€ã¤ã®éƒ½é“府県ã§ç™ºç”Ÿã—ãŸäº‹ä»¶ã§ã‚ã‚‹ã‚‚
第五世代コンピュータ - Wikipedia
ã“ã®è¨˜äº‹ã«ã¯å‚考文献や外部リンクã®ä¸€è¦§ãŒå«ã¾ã‚Œã¦ã„ã¾ã™ãŒã€è„šæ³¨ã«ã‚ˆã£ã¦å‚ç…§ã•ã‚Œã¦ãŠã‚‰ãšã€æƒ…å ±æºãŒä¸æ˜Žçžã§ã™ã€‚ 脚注を導入ã—ã¦ã€è¨˜äº‹ã®ä¿¡é ¼æ€§å‘上ã«ã”å”力ãã ã•ã„。（2023å¹´9月） 第五世代コンピュータ（ã ã„ã”ã›ã ã„コンピュータ）計画ã¨ã¯ã€1982å¹´ã‹ã‚‰1992å¹´ã«ã‹ã‘ã¦æ—¥æœ¬ã®é€šå•†ç”£æ¥çœï¼ˆç¾çµŒæ¸ˆç”£æ¥çœï¼‰æ‰€ç®¡ã®æ–°ä¸–代コンピュータ技術開発機構（ICOT）ãŒé€²ã‚ãŸå›½å®¶ãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆã§ã€ã„ã‚ゆる人工知能コンピュータã®é–‹ç™ºã‚’目的ã«ç·é¡540億円ã®å›½å®¶äºˆç®—ãŒæŠ•å…¥ã•ã‚ŒãŸã€‚ 第五世代ã¨ã¯ã€ã—ã°ã—ã°è¦‹ã‚‰ã‚Œã‚‹é›»å計算機ã®ä¸–代分ã‘ã€ã™ãªã‚ã¡ã€ç¬¬ä¸€ä¸–代（真空管）ã€ç¬¬äºŒä¸–代（トランジスタ）ã€ç¬¬ä¸‰ä¸–代（集ç©å›žè·¯ï¼‰ã€ç¬¬å››ä¸–代（大è¦æ¨¡é›†ç©å›žè·¯ï¼‰ã¨ã„ã†æµã‚Œã®æ¬¡ã®ä¸–代ã¨ã„ã†ã‚ã‘ã ãŒã€ã“ã®å¾“æ¥ã®ä¸–代分ã‘ã¯ã“ã“ã§ã‚«ãƒƒã‚³æ›¸ãã—ãŸã‚ˆã†ãªç´ åã®ç™ºå±•ã«åŸºã¥ãã‚‚ã®ã§ã‚ã‚Š[1]本プãƒã‚¸ã‚§ã‚¯ãƒˆãŒç›®æŒ‡ã™æ‰€ã‚’ã“ã‚Œã«ç¶šã第五世代ã¨ã™ã¹ã連続性ã¯ç„¡ã„。
)
Gödel (programming language) - Wikipedia
Gödel is a declarative, general-purpose programming language that adheres to the logic programming paradigm. It is a strongly typed language, the type system being based on many-sorted logic with parametric polymorphism. It is named after logician Kurt Gödel. Gödel has a module system, and it supports arbitrary precision integers, arbitrary precision rationals, and also floating-point numbers. It
Transmission Control Protocol - Wikipedia
In May 1974, Vint Cerf and Bob Kahn described an internetworking protocol for sharing resources using packet switching among network nodes.[2] The authors had been working with Gérard Le Lann to incorporate concepts from the French CYCLADES project into the new network.[3] The specification of the resulting protocol, RFC 675 (Specification of Internet Transmission Control Program), was written by
)
Heuristic (computer science) - Wikipedia
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Heuristic" computer science – news · newspapers · books · scholar · JSTOR (November 2025) (Learn how and when to remove this message) In mathematical optimization and computer science, heuristic (from Gr
超越数 - Wikipedia
円周率 Ï€ ã¯è¶…越数ã§ã‚ã‚‹ãŸã‚ã€ã‚³ãƒ³ãƒ‘スã¨å®šè¦ã‚’有é™å›žç”¨ã„ã¦å††ã¨ç‰é¢ç©ã®æ£æ–¹å½¢ã‚’作図ã™ã‚‹ã“ã¨ã¯ä¸å¯èƒ½ã§ã‚る。 超越数（ã¡ã‚‡ã†ãˆã¤ã™ã†ã€è‹±: transcendental number）ã¨ã¯ã€ä»£æ•°çš„æ•°ã§ãªã„è¤‡ç´ æ•°ã€ã™ãªã‚ã¡ã©ã®æœ‰ç†ä¿‚æ•°ã®ä»£æ•°æ–¹ç¨‹å¼ （n ã¯æ£ã®æ•´æ•°ã€å„ ai ã¯æœ‰ç†æ•°ï¼‰ ã®è§£ï¼ˆè‹±èªžç‰ˆï¼‰ã«ã‚‚ãªã‚‰ãªã„è¤‡ç´ æ•°ã®ã“ã¨ã§ã‚る。有ç†æ•°ã¯ä¸€æ¬¡æ–¹ç¨‹å¼ã®è§£ã§ã‚ã‚‹ã‹ã‚‰ã€è¶…越的ãªå®Ÿæ•°ã¯ã™ã¹ã¦ç„¡ç†æ•°ã§ã‚ã‚‹ãŒã€ä¾‹ãˆã°ç„¡ç†æ•° √2 ã¯äºŒæ¬¡æ–¹ç¨‹å¼ x2 − 2 = 0 ã®è§£ã§ã‚ã‚‹ã‹ã‚‰ã€ãã®é€†ã¯æˆã‚Šç«‹ãŸãªã„。超越数論ã¯ã€è¶…越数ã«ã¤ã„ã¦ç ”究ã™ã‚‹æ•°å¦ã®åˆ†é‡Žã§ã€ä¸Žãˆã‚‰ã‚ŒãŸæ•°ã®è¶…越性ã®åˆ¤å®šãªã©ãŒä¸»ãªå•é¡Œã§ã‚る。 よã知られãŸè¶…越数ã«ãƒã‚¤ãƒ”ア数 e（自然対数ã®åº•ï¼‰ã‚„円周率 Ï€ãŒã‚ã‚Šã€ã¾ãŸã»ã¨ã‚“ã©å…¨ã¦ã®è¤‡ç´ æ•°ãŒè¶…越数ã§ã‚ã‚‹ã“ã¨ãŒåˆ†ã‹ã£ã¦ã„る。ãŸã ã—超越性ãŒç¤ºã•ã‚Œã¦ã„ã‚‹è¤‡ç´ æ•°ã®ã‚¯ãƒ©ã‚¹ã¯ã»ã‚“ã®åƒ…ã‹ã§ã‚ã‚Šã€ä¸Žãˆã‚‰ã‚ŒãŸæ•°ãŒè¶…越
Big O notation - Wikipedia
Big O notation is a mathematical notation that describes the approximate size of a function on a domain. Big O is a member of a family of notations invented by German mathematicians Paul Bachmann and [1] Edmund Landau [2] and expanded by others, collectively called Bachmann–Landau notation. The letter O was chosen by Bachmann to stand for Ordnung, meaning the order of approximation. In computer sc
Longest common subsequence - Wikipedia
Comparison of two revisions of an example file, based on their longest common subsequence (black) A longest common subsequence (LCS) is the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from the longest common substring: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The prob
Dynamic linker - Wikipedia
Dynamic-link library, or DLL, is Microsoft's implementation of the shared library concept in the Microsoft Windows and OS/2 operating systems. These libraries usually have the file extension DLL, OCX (for libraries containing ActiveX controls), or DRV (for legacy system drivers). The file formats for DLLs are the same as for Windows EXE files – that is, Portable Executable (PE) for 32-bit and 64-b
リーマン予想 - Wikipedia
リーマンã¯ç´ æ•°ã®åˆ†å¸ƒã«é–¢ã™ã‚‹ç ”究を行ã£ã¦ã„ã‚‹éš›ã«ã‚ªã‚¤ãƒ©ãƒ¼ãŒç ”究ã—ã¦ã„ãŸä»¥ä¸‹ã®ç´šæ•°ã‚’ゼータ関数ã¨åã¥ã‘ã€è§£æžæŽ¥ç¶šã‚’用ã„ã¦è¤‡ç´ 数全体ã¸ã®æ‹¡å¼µã‚’è¡Œã£ãŸã€‚ ゼータ関数を次ã®ã‚ˆã†ã«å®šç¾©ã™ã‚‹ï¼ˆè¤‡ç´ æ•° s ã®å®Ÿéƒ¨ãŒ 1 より大ãã„ã¨ãã€ã“ã®ç´šæ•°ã¯çµ¶å¯¾åŽæŸã™ã‚‹ï¼‰ã€‚ 1859å¹´ã«ãƒªãƒ¼ãƒžãƒ³ã¯è‡ªèº«ã®è«–æ–‡ã®ä¸ã§ã€è¤‡ç´ 数全体 (s ≠1) ã¸ã‚¼ãƒ¼ã‚¿é–¢æ•°ã‚’æ‹¡å¼µã—ãŸå ´åˆã€ ã¨äºˆæƒ³ã—ãŸã€‚ã“ã“ã«ã€è‡ªæ˜Žãªé›¶ç‚¹ã¨ã¯è² ã®å¶æ•° (−2, −4, −6, …) ã®ã“ã¨ã§ã‚る。自明ã§ãªã„零点㯠0 < Re s < 1[注 2] ã®ç¯„囲ã«ã—ã‹å˜åœ¨ã—ãªã„ã“ã¨ãŒçŸ¥ã‚‰ã‚Œã¦ãŠã‚Šï¼ˆä¸‹è¨˜ã®æ´å²ã‚’å‚照）ã€ã“ã®ç¯„囲を臨界帯ã¨ã„ã†ã€‚ ãªãŠç´ 数定ç†ã¯ãƒªãƒ¼ãƒžãƒ³äºˆæƒ³ã¨åŒå€¤ãªè¿‘似公å¼[注 3]ã‹ã‚‰ã®å¸°çµã§ã‚ã‚‹ãŒã€ç´ 数定ç†è‡ªä½“ã¯ãƒªãƒ¼ãƒžãƒ³äºˆæƒ³ãŒçœŸã§ã‚ã‚‹ã¨ã„ã†ä»®å®šãŒãªãã¨ã‚‚証明ã§ãる。ã“ã®æ³¨æ„ã¯æ´å²çš„ã«ã¯é‡è¦ãªã“ã¨ã§ã€å®Ÿéš›ãƒªãƒ¼ãƒžãƒ³ãŒã¯ã£ãã‚Šã¨ã¯ç´ 数定ç†ã‚’証明ã§ããª
Shortest common supersequence - Wikipedia
In computer science, the shortest common supersequence of two sequences X and Y is the shortest sequence which has X and Y as subsequences. This is a problem closely related to the longest common subsequence problem. Given two sequences X = < x1,...,xm > and Y = < y1,...,yn >, a sequence U = < u1,...,uk > is a common supersequence of X and Y if items can be removed from U to produce X and Y. A sho
Spanning tree - Wikipedia
For the network protocol, see Spanning Tree Protocol. For other uses, see Spanning tree (disambiguation). A spanning tree (blue heavy edges) of a grid graph In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G.[1] In general, a graph may have several spanning trees, but a graph that is not connect
Rolling release - Wikipedia
Rolling release, also known as rolling update or continuous delivery, is a concept in software development of frequently delivering updates to applications.[1][2][3] This is in contrast to a standard or point release development model which uses software versions which replace the previous version. A rolling release model is different from a staged or "staggered" rollout, in which an update is gra
ãƒãƒ¼ãƒªãƒ³ã‚°ãƒªãƒªãƒ¼ã‚¹ - Wikipedia
ãƒãƒ¼ãƒªãƒ³ã‚°ãƒªãƒªãƒ¼ã‚¹ (英: rolling release, rolling update)ã¨ã¯ã€ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢é–‹ç™ºã«ãŠã„ã¦ã€ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚·ã‚¹ãƒ†ãƒ ã‚’æ–ç¶šçš„ï¼ˆé »ç¹ã«ï¼‰ã«æ›´æ–°ã—ã¦ã„ãリリースモデルを指ã™[1][2][3]。ã“ã®ç”¨èªžã¯ã€ã„ã‚ゆる「ãƒãƒ¼ã‚¸ãƒ§ãƒ³ç•ªå·ã€ã‚’用ã„ã¦æ–°ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã§å†ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ«ã‚’è¦æ±‚ã™ã‚‹ã‚ˆã†ãªä¸€èˆ¬çš„ãªãƒªãƒªãƒ¼ã‚¹ãƒ¢ãƒ‡ãƒ«ã¸ã®å¯¾æ¯”ã¨ã—ã¦ç”¨ã„られる。一般的ãªãƒªãƒªãƒ¼ã‚¹ãƒ¢ãƒ‡ãƒ«ã§ã¯é›¢æ•£çš„ãªãƒãƒ¼ã‚¸ãƒ§ãƒ³ã”ã¨ã«æ›´æ–°ãŒè¦æ±‚ã•ã‚Œã‚‹ãŒã€ãƒãƒ¼ãƒªãƒ³ã‚°ãƒªãƒªãƒ¼ã‚¹ã§ã¯ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã¯é »ç¹ã«æ›´æ–°ã•ã‚Œã‚‹ã€‚ ãƒãƒ¼ãƒªãƒ³ã‚°ãƒªãƒªãƒ¼ã‚¹ã¨ã„ã†ç”¨èªžã¯ã€ã©ã®ã‚ˆã†ãªã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚·ã‚¹ãƒ†ãƒ ã§ã‚‚用ã„られã†ã‚‹ãŒã€ã“ã®èªžã®å…¸åž‹çš„ãªä½¿ç”¨ä¾‹ã¯ã€ã„ãã¤ã‹ã®Linuxディストリビューションã®ãƒªãƒªãƒ¼ã‚¹ãƒ¢ãƒ‡ãƒ«ã¨ã—ã¦è¦‹ã‹ã‘られる。 一般ã«ãƒãƒ¼ãƒªãƒ³ã‚°ãƒªãƒªãƒ¼ã‚¹ã¯å°ã•ãé »ç¹ãªæ›´æ–°ã¨ã—ã¦å®Ÿç¾ã•ã‚Œã¦ã„る。ã—ã‹ã—ã€å˜ã«æ›´æ–°ã‚’ã™ã‚‹ã“ã¨ã ã‘ã§ã¯ãƒãƒ¼ãƒªãƒ³ã‚°ãƒªãƒªãƒ¼ã‚¹ã‚’採用ã—ã¦ã„ã‚‹ã¨
Prolog - Wikipedia
Prolog（プãƒãƒã‚°ï¼‰ã¯è«–ç†ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®ä¸€ã¤ã§ã‚ã‚Šã€è©²å½“分野ã§æœ€ã‚‚よã知られã¦ã„ã‚‹è«–ç†åž‹è¨€èªžã®ä»£è¡¨æ ¼ã§ã‚る。主ã«äººå·¥çŸ¥èƒ½ç ”究や計算言語å¦ã¨ã®é–¢é€£æ€§ã‚’æŒã¤ã€‚定ç†è¨¼æ˜Žã€ã‚¨ã‚スパートシステムã€è‡ªå‹•è¨ˆç”»ã€è‡ªç„¶è¨€èªžå‡¦ç†ã¨ã‚‚繋ãŒã‚ŠãŒæ·±ã„。形å¼è«–ç†ã§ã‚る一階述語論ç†ã‚’基礎ã«ã—ã¦ã€äº‹å®Ÿç¾¤ã¨è¦å‰‡ç¾¤ã®è¡¨ç¾ãŠã‚ˆã³é–¢ä¿‚ã®è¦³ç‚¹ã«ç«‹ã£ãŸå®£è¨€åž‹ãƒ‘ラダイムã«æº–æ‹ ã—ã¦ãŠã‚Šã€ãã®é–¢ä¿‚ã«å‰‡ã£ãŸè³ªå•ã«ã‚ˆã£ã¦è¨ˆç®—ãŒé–‹å§‹ã•ã‚Œã‚‹ã¨ã„ã†æ€§è³ªã‚’æŒã¤ã€‚ Prologã¯ã€1972å¹´ã«ãƒžãƒ«ã‚»ã‚¤ãƒ¦å¤§å¦ã®ã‚¢ãƒ©ãƒ³ãƒ»ã‚«ãƒ«ãƒ¡ãƒ©ã‚¦ã‚¢ãƒ¼ã¨ãƒ•ã‚£ãƒªãƒƒãƒ—・ラッセルã«ã‚ˆã£ã¦é–‹ç™ºã•ã‚ŒãŸã€‚フランス語ã®ã€Œprogrammation en logiqueã€ãŒãã®åã®ç”±æ¥ã§ã‚ã‚‹[1]。Prologã®èª•ç”Ÿã«ã¯ã‚¨ãƒ‡ã‚£ãƒ³ãƒãƒ©å¤§å¦ã®ãƒãƒãƒ¼ãƒˆãƒ»ã‚³ãƒ¯ãƒ«ã‚¹ã‚ãŒè€ƒæ¡ˆã—ãŸãƒ›ãƒ¼ãƒ³ç¯€ãŒå¤§ãã寄与ã—ã¦ã„る。カルメラウアーã«ã‚ˆã‚‹å…ƒç¥–版ã¯ãƒžãƒ«ã‚»ã‚¤ãƒ¦Prologã¨å‘¼ã°ã‚Œã¦ã„る。ãã®å¾Œã€ã‚³ãƒ¯ãƒ«ã‚¹ã‚
ランã‚ング
ランã‚ング
メンテナンス
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}