发布求助
文献互助 智能选刊 最新文献

The Journal of Logic Programming最新文献

筛选
英文 中文
Abducing through negation as failure: stable models within the independent choice logic 以否定为失败的诱拐:独立选择逻辑中的稳定模型
The Journal of Logic Programming Pub Date : 2000-07-01 DOI: 10.1016/S0743-1066(99)00071-0
David Poole
{"title":"Abducing through negation as failure: stable models within the independent choice logic","authors":"David Poole","doi":"10.1016/S0743-1066(99)00071-0","DOIUrl":"https://doi.org/10.1016/S0743-1066(99)00071-0","url":null,"abstract":"<div><p>The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics characterised by independent choices and an acyclic logic program that specifies the consequences of these choices. This paper gives an abductive characterization of the ICL. The ICL is defined model-theoretically, but we show that it is naturally abductive: the set of explanations of a proposition <em>g</em> is a concise description of the worlds in which <em>g</em> is true. We give an algorithm for computing explanations and show it is sound and complete with respect to the possible-worlds semantics. What is unique about this approach is that the explanations of the negation of <em>g</em> can be derived from the explanations of <em>g</em>. The use of probabilities over choices in this framework and going beyond acyclic logic programs are also discussed.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"44 1","pages":"Pages 5-35"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00071-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91981433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 118
Conditional reasoning in logic programming 逻辑程序设计中的条件推理
The Journal of Logic Programming Pub Date : 2000-07-01 DOI: 10.1016/S0743-1066(99)00072-2
D. Gabbay , L. Giordano , A. Martelli , N. Olivetti , M.L. Sapino
{"title":"Conditional reasoning in logic programming","authors":"D. Gabbay ,&nbsp;L. Giordano ,&nbsp;A. Martelli ,&nbsp;N. Olivetti ,&nbsp;M.L. Sapino","doi":"10.1016/S0743-1066(99)00072-2","DOIUrl":"https://doi.org/10.1016/S0743-1066(99)00072-2","url":null,"abstract":"<div><p>We introduce a logic programming language which supports hypothetical and counterfactual reasoning. The language is based on a conditional logic which enables to formalize conditional updates of the knowledge base. Due to the presence of integrity constraints, alternative revisions of the knowledge base may result from an update. We develop an abductive semantics which captures different evolutions of the knowledge base. Furthermore, we provide a goal-directed abductive proof procedure to compute the alternative solutions for a goal. We finally analyze our conditional programming language in the context of belief revision theory, and we establish a connection with Nebel's prioritized base revision.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"44 1","pages":"Pages 37-74"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00072-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91981429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
An abductive approach to disjunctive logic programming 析取逻辑规划的溯因方法
The Journal of Logic Programming Pub Date : 2000-07-01 DOI: 10.1016/S0743-1066(99)00074-6
Jia-Huai You, Li Yan Yuan, Randy Goebel
{"title":"An abductive approach to disjunctive logic programming","authors":"Jia-Huai You,&nbsp;Li Yan Yuan,&nbsp;Randy Goebel","doi":"10.1016/S0743-1066(99)00074-6","DOIUrl":"https://doi.org/10.1016/S0743-1066(99)00074-6","url":null,"abstract":"<div><p>Nonmonotonic reasoning has been explored as a form of abductive reasoning where default assumptions are treated as abductive hypotheses. While the semantics and proof theories under this approach have been studied extensively, the question of how disjunctive programs may be used to reason abductively has rarely been investigated. At the center of the question is how to embed disjunctive reasoning into that of negation-as-failure. A more concrete question is about whether the elegant abductive proof procedure by Eshghi and Kowalski can be extended to answer queries for disjunctive programs, and if yes, what is the semantics that such an extended procedure computes. In this paper we answer these questions by formulating a semantics, the <em>regular extension semantics</em>, for disjunctive programs, and by presenting a sound and complete extension of the Eshghi–Kowalski procedure, called <em>disjunctive EK procedure</em>, for query answering with respect to ground disjunctive programs under this semantics.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"44 1","pages":"Pages 101-127"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00074-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91981430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Index 指数
The Journal of Logic Programming Pub Date : 2000-07-01 DOI: 10.1016/S0743-1066(00)00007-8
{"title":"Index","authors":"","doi":"10.1016/S0743-1066(00)00007-8","DOIUrl":"https://doi.org/10.1016/S0743-1066(00)00007-8","url":null,"abstract":"","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"44 1","pages":"Page 241"},"PeriodicalIF":0.0,"publicationDate":"2000-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(00)00007-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91981434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Index 指数
The Journal of Logic Programming Pub Date : 2000-06-01 DOI: 10.1016/S0743-1066(00)00002-9
{"title":"Index","authors":"","doi":"10.1016/S0743-1066(00)00002-9","DOIUrl":"https://doi.org/10.1016/S0743-1066(00)00002-9","url":null,"abstract":"","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"43 3","pages":"Pages 267-268"},"PeriodicalIF":0.0,"publicationDate":"2000-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(00)00002-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137351350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Index 指数
The Journal of Logic Programming Pub Date : 2000-06-01 DOI: 10.1016/S0743-1066(00)00003-0
{"title":"Index","authors":"","doi":"10.1016/S0743-1066(00)00003-0","DOIUrl":"https://doi.org/10.1016/S0743-1066(00)00003-0","url":null,"abstract":"","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"43 3","pages":"Page 269"},"PeriodicalIF":0.0,"publicationDate":"2000-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(00)00003-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137351349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Erratum to: “Conjunctive partial deduction: foundations, control, algorithms and experiments” [The Journal of Logic Programming 41 (1999) 231] “合取部分演绎:基础、控制、算法和实验”的勘误[The Journal of Logic Programming 41 (1999) 231]
The Journal of Logic Programming Pub Date : 2000-06-01 DOI: 10.1016/S0743-1066(99)00070-9
D. De Schreye, R. Glück, J. Jørgensen, M. Leuschel, B. Martens, M.H. Sørensen
{"title":"Erratum to: “Conjunctive partial deduction: foundations, control, algorithms and experiments” [The Journal of Logic Programming 41 (1999) 231]","authors":"D. De Schreye,&nbsp;R. Glück,&nbsp;J. Jørgensen,&nbsp;M. Leuschel,&nbsp;B. Martens,&nbsp;M.H. Sørensen","doi":"10.1016/S0743-1066(99)00070-9","DOIUrl":"10.1016/S0743-1066(99)00070-9","url":null,"abstract":"","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"43 3","pages":"Page 265"},"PeriodicalIF":0.0,"publicationDate":"2000-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00070-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134352405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Hybrid probabilistic programs 混合概率程序
The Journal of Logic Programming Pub Date : 2000-06-01 DOI: 10.1016/S0743-1066(99)00059-X
Alex Dekhtyar, V.S. Subrahmanian
{"title":"Hybrid probabilistic programs","authors":"Alex Dekhtyar,&nbsp;V.S. Subrahmanian","doi":"10.1016/S0743-1066(99)00059-X","DOIUrl":"10.1016/S0743-1066(99)00059-X","url":null,"abstract":"<div><p>The precise probability of a compound event (e.g. <span><math><mtext>e</mtext><msub><mi></mi><mn>1</mn></msub><mspace></mspace><mtext>∨</mtext><mspace></mspace><mtext>e</mtext><msub><mi></mi><mn>2</mn></msub><mtext>,e</mtext><msub><mi></mi><mn>1</mn></msub><mspace></mspace><mtext>∧</mtext><mspace></mspace><mtext>e</mtext><msub><mi></mi><mn>2</mn></msub></math></span>) depends upon the known relationships (e.g. independence, mutual exclusion, ignorance of any relationship, etc.) between the primitive events that constitute the compound event. To date, most research on probabilistic logic programming has assumed that we are ignorant of the relationship between primitive events. Likewise, most research in AI (e.g. Bayesian approaches) has assumed that primitive events are independent. In this paper, we propose a <em>hybrid</em> probabilistic logic programming language in which the user can explicitly associate, with any given probabilistic strategy, a conjunction and disjunction operator, and then write programs using these operators. We describe the syntax of hybrid probabilistic programs, and develop a model theory and fixpoint theory for such programs. Last, but not least, we develop three alternative procedures to answer queries, each of which is guaranteed to be sound and complete.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"43 3","pages":"Pages 187-250"},"PeriodicalIF":0.0,"publicationDate":"2000-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00059-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124325095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 140
Improving program analyses, by structure untupling 通过结构解耦改进程序分析
The Journal of Logic Programming Pub Date : 2000-06-01 DOI: 10.1016/S0743-1066(99)00079-5
Michael Codish , Kim Marriott , Cohavit Taboch
{"title":"Improving program analyses, by structure untupling","authors":"Michael Codish ,&nbsp;Kim Marriott ,&nbsp;Cohavit Taboch","doi":"10.1016/S0743-1066(99)00079-5","DOIUrl":"10.1016/S0743-1066(99)00079-5","url":null,"abstract":"<div><p>It is well-known that adding structural information to an analysis domain can increase the precision of the analysis with respect to the original domain. This paper presents a program transformation based on untupling and specialisation which can be applied to upgrade (logic) program analysis by providing additional structural information. It can be applied to (almost) any type of analysis and in conjunction with (almost) any analysis framework for logic programs. The approach is an attractive alternative to the more complex <span>Pat</span><span><math><mtext>(</mtext><mtext>R</mtext><mtext>)</mtext></math></span> construction which automatically enhances an abstract domain <span><math><mtext>R</mtext></math></span> (in the context of abstract interpretation) with structural information.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"43 3","pages":"Pages 251-263"},"PeriodicalIF":0.0,"publicationDate":"2000-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00079-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132220199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Tracing Prolog programs by source instrumentation is efficient enough 通过源检测跟踪Prolog程序是足够有效的
The Journal of Logic Programming Pub Date : 2000-05-01 DOI: 10.1016/S0743-1066(99)00061-8
Mireille Ducassé , Jacques Noyé
{"title":"Tracing Prolog programs by source instrumentation is efficient enough","authors":"Mireille Ducassé ,&nbsp;Jacques Noyé","doi":"10.1016/S0743-1066(99)00061-8","DOIUrl":"10.1016/S0743-1066(99)00061-8","url":null,"abstract":"<div><p>Tracing by automatic program source instrumentation has major advantages over compiled code instrumentation: it is more portable from one Prolog system to another, it produces traces in terms of the original program, and it can be tailored to specific debugging needs. The main argument usually put forward in favor of compiled code instrumentation is its supposed efficiency. We have compared the performances of two operational low-level Prolog tracers with source instrumentation. We have executed classical Prolog benchmark programs, collecting trace information without displaying it. On average, collecting trace information by program instrumentation is about as fast as using a low-level tracer in one case, and only twice slower in the other. This is a minor penalty to pay, compared to the advantages of the approach. To our knowledge, this is the first time that a quantitative comparison of both approaches is made for any programming language.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"43 2","pages":"Pages 157-172"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00061-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124174691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信