按年被提到
20092021 · 4 次2026
数学、逻辑与理论›AI 数学与定理证明·arXiv:0904.3036 · cs.LO

Inconsistency Robustness in Logic Programs

Carl Hewitt · 2009
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 4 人首次 2021-02-23 · 最近 2025-01-04
4不同的人
2活跃月份
2讨论串
0被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Inconsistency robustness is "information system performance in the face of continually pervasive inconsistencies." A fundamental principle of Inconsistency Robustness is to make contradictions explicit so that arguments for and against propositions can be formalized. This paper explores the role of Inconsistency Robustness in the history and theory of Logic Programs. Robert Kowalski put forward a bold thesis: "Looking back on our early discoveries, I value most the discovery that computation could be subsumed by deduction." However, mathematical logic cannot always infer computational steps because computational systems make use of arbitration for determining which message is processed next by a recipient that is sent multiple messages concurrently. Since reception orders are in general indeterminate, they cannot be inferred from prior information by mathematical logic alone. Therefore mathematical logic cannot in general implement computation. Over the course of history, the term "Functional Program" has grown more precise and technical as the field has matured. "Logic Program" should be on a similar trajectory. Accordingly, "Logic Program" should have a general precise characterization. In the fall of 1972, different characterizations of Logic Programs that have continued to this day: * A Logic Program uses Horn-Clause syntax for forward and backward chaining * Each computational step (according to Actor Model) of a Logic Program is deductively inferred (e.g. in Direct Logic). The above examples are illustrative of how issues of inconsistency robustness have repeatedly arisen in Logic Programs.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论ProfHewitt · 2021-02

“As Kowalski has acknowledged and reported by others, Prolog was invented as a subset of Planner that only implemented backward chaining. See the following for further information: "Middle History of Logic Programming: Resolution, Planner, Prolog and the Japanese Fifth Generation Project" ArXiv 2009. https://dev.arxiv.org/abs/0904.3036”

The birth of Prolog (1992) [pdf]原评论 ↗
评论inetsee · 2021-02

“Thank you very much for helping me find this paper, but I am still somewhat confused. When I couldn't find the paper in arxiv, it didn't occur me at first to go back to the beginning and use a general search engine. When I did plug the title into DDG it took me to arxiv, which had the expected abstract and a working link to the pdf. But doing another sea…”

The birth of Prolog (1992) [pdf]原评论 ↗
评论andrekandre · 2021-02

“thats interesting, one slightly different link i found was https://arxiv.org/pdf/0904.3036.pdf seems like your link is versioned (v22) and the one i found was unversioned... i wonder which one is the latest...?”

The birth of Prolog (1992) [pdf]原评论 ↗
评论ProfHewitt · 2021-02

“Thanks Tom! Being a linguist of note, Colmerauer evidently didn't know (or didn't want to admit) that Kowalski had been carefully studying Planner and Shrdlu (Winograd's Phd thesis based on Planner) for quite a while in Edinburgh, where he felt quite in the minority defending pure mathematical logic against the onslaught of Popler (Pop2 Planner), et…”

The birth of Prolog (1992) [pdf]原评论 ↗
评论kragen · 2025-01

“It mentions the names of message-passing and the well-known actors model, but the ideas it engages with are the ideas of io_uring, which is a system for asynchronous I/O using a message queue. The two designs are not unrelated, and you could write an interesting post exploring the relationships between them, but unfortunately the author did not do that, b…”

Do Files want to be Actors?原评论 ↗