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

The Journal of Logic Programming最新文献

筛选
英文 中文
Demand Transformation Analysis for Concurrent Constraint Programs 并行约束程序的需求转换分析
The Journal of Logic Programming Pub Date : 2000-03-01 DOI: 10.1016/S0743-1066(99)00004-7
M. Falaschi, Patrick Hicks, W. Winsborough
{"title":"Demand Transformation Analysis for Concurrent Constraint Programs","authors":"M. Falaschi, Patrick Hicks, W. Winsborough","doi":"10.1016/S0743-1066(99)00004-7","DOIUrl":"https://doi.org/10.1016/S0743-1066(99)00004-7","url":null,"abstract":"","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"50 1","pages":"333-347"},"PeriodicalIF":0.0,"publicationDate":"2000-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86516883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Index 指数
The Journal of Logic Programming Pub Date : 2000-03-01 Epub Date: 2000-01-12 DOI: 10.1016/S0743-1066(99)00068-0
{"title":"Index","authors":"","doi":"10.1016/S0743-1066(99)00068-0","DOIUrl":"https://doi.org/10.1016/S0743-1066(99)00068-0","url":null,"abstract":"","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"42 3","pages":"Page 257"},"PeriodicalIF":0.0,"publicationDate":"2000-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00068-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91726614","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-03-01 Epub Date: 2000-01-12 DOI: 10.1016/S0743-1066(99)00069-2
{"title":"Index","authors":"","doi":"10.1016/S0743-1066(99)00069-2","DOIUrl":"https://doi.org/10.1016/S0743-1066(99)00069-2","url":null,"abstract":"","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"42 3","pages":"Page 259"},"PeriodicalIF":0.0,"publicationDate":"2000-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00069-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91726613","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
An algebraic approach to sharing analysis of logic programs 逻辑程序共享分析的代数方法
The Journal of Logic Programming Pub Date : 2000-02-01 Epub Date: 2000-06-01 DOI: 10.1016/S0743-1066(99)00007-2
Michael Codish , Vitaly Lagoon , Francisco Bueno
{"title":"An algebraic approach to sharing analysis of logic programs","authors":"Michael Codish ,&nbsp;Vitaly Lagoon ,&nbsp;Francisco Bueno","doi":"10.1016/S0743-1066(99)00007-2","DOIUrl":"https://doi.org/10.1016/S0743-1066(99)00007-2","url":null,"abstract":"<div><p>This paper describes an algebraic approach to the sharing analysis of logic programs based on an abstract domain of <em>set logic programs</em>. Set logic programs are logic programs in which the terms are sets of variables and unification is based on an associative, commutative, and idempotent equality theory. All of the basic operations required for sharing analyses, as well as their formal justification, are based on simple algebraic properties of set substitutions and set-based atoms. An ordering on set-based syntactic objects, similar to “less general” on concrete syntactic objects, is shown to reflect the notion of “less sharing” information. The (abstract) unification of a pair of set-based terms corresponds to finding their most general ACI1 unifier with respect to this ordering. The unification of a set of equations between set-based terms is defined exactly as in the concrete case, by solving the equations one by one and repeatedly applying their solutions to the remaining equations. We demonstrate that all of the operations in a sharing analysis have natural definitions which are both correct and optimal.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"42 2","pages":"Pages 111-149"},"PeriodicalIF":0.0,"publicationDate":"2000-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00007-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137164016","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
Subset-logic programs and their implementation 子集逻辑程序及其实现
The Journal of Logic Programming Pub Date : 2000-02-01 Epub Date: 2000-06-01 DOI: 10.1016/S0743-1066(99)00005-9
Bharat Jayaraman, Kyonghee Moon
{"title":"Subset-logic programs and their implementation","authors":"Bharat Jayaraman,&nbsp;Kyonghee Moon","doi":"10.1016/S0743-1066(99)00005-9","DOIUrl":"10.1016/S0743-1066(99)00005-9","url":null,"abstract":"<div><p>This paper discusses the design and implementation of a set-oriented logic programming paradigm, called subset-logic programming. Subset-logic programs are built up of three kinds of program clauses: subset, equational and relational clauses. Using these clauses, we can program solutions to a broad range of problems of interest in logic programming and deductive databases. In previous research, we developed the implementation of subset and equational program clauses. This paper substantially extends that work, and focuses on the more expressive paradigm of subset and relational clauses. This paradigm supports <em>setof</em> operations, transitive closures, monotonic aggregation as well as incremental and lazy enumeration of sets. Although the subset-logic paradigm differs substantially from that of Prolog, we show that few additional changes are needed to the Warren Abstract Machine (WAM) to implement the paradigm and that these changes blend well with the overall machinery of the WAM. A central feature in the implementation of subset-logic programs is that of a <em>monotonic memotable</em>, i.e., a memo-table whose entries can monotonically grow or shrink in an appropriate partial order. We present in stages the paradigm of subset-logic progams, showing the effect of each feature on the implementation. The implementation has been completed, and we present performance figures to show the efficiency and costs of memoization. Our conclusion is that the monotonic memo-tables are a practical tool for implementing a set-oriented logic programming language. We also compare this system with other closely related systems, especially XSB and CORAL.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"42 2","pages":"Pages 71-110"},"PeriodicalIF":0.0,"publicationDate":"2000-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00005-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133662700","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}
引用次数: 13
Ultrametric spaces and logic programming 超尺度空间与逻辑规划
The Journal of Logic Programming Pub Date : 2000-02-01 Epub Date: 2000-06-01 DOI: 10.1016/S0743-1066(99)00002-3
Sibylla Priess-Crampe , Paulo Ribenboim
{"title":"Ultrametric spaces and logic programming","authors":"Sibylla Priess-Crampe ,&nbsp;Paulo Ribenboim","doi":"10.1016/S0743-1066(99)00002-3","DOIUrl":"10.1016/S0743-1066(99)00002-3","url":null,"abstract":"<div><p>In this paper we prove a very general multivalued fixed point theorem for ultrametric spaces which at the same time is a generalization of the multivalued fixed point theorem of Khamsi et al. for generalized metric spaces and our (singlevalued) fixed point theorem for ultrametric spaces. We use this latter fixed point theorem to obtain a criterion for the existence of a Herbrand model for a program.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"42 2","pages":"Pages 59-70"},"PeriodicalIF":0.0,"publicationDate":"2000-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00002-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123669437","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}
引用次数: 58
Operational and goal-independent denotational semantics for Prolog with cut 带有cut的Prolog的操作和目标无关的指称语义
The Journal of Logic Programming Pub Date : 2000-01-01 Epub Date: 2000-01-17 DOI: 10.1016/S0743-1066(99)00012-6
Fausto Spoto
{"title":"Operational and goal-independent denotational semantics for Prolog with cut","authors":"Fausto Spoto","doi":"10.1016/S0743-1066(99)00012-6","DOIUrl":"10.1016/S0743-1066(99)00012-6","url":null,"abstract":"<div><p>In this paper we propose an operational and a denotational semantics for Prolog. We deal with the control rules of Prolog and the cut operator. Our denotational semantics provides a goal-independent semantics. This means that the behaviour of a goal in a program is defined as the evaluation of the goal in the denotation (semantics) of the program. We show how our denotational semantics can be specialised into a computed answer semantics and into a call pattern semantics. Our work provides a basis for a precise abstract interpretation of Prolog programs.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"42 1","pages":"Pages 1-46"},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00012-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128058725","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}
引用次数: 18
Defeasible logic versus Logic Programming without Negation as Failure 可否定逻辑与不以否定为失败的逻辑编程
The Journal of Logic Programming Pub Date : 2000-01-01 Epub Date: 2000-01-17 DOI: 10.1016/S0743-1066(99)00060-6
G. Antoniou, M.J. Maher, D. Billington
{"title":"Defeasible logic versus Logic Programming without Negation as Failure","authors":"G. Antoniou,&nbsp;M.J. Maher,&nbsp;D. Billington","doi":"10.1016/S0743-1066(99)00060-6","DOIUrl":"10.1016/S0743-1066(99)00060-6","url":null,"abstract":"<div><p>Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. In this paper we compare the expressive power of two approaches in this family of logics: Defeasible Logic, and sceptical Logic Programming without Negation as Failure (LPwNF). Our results show that the former has a strictly stronger expressive power. The difference is caused by the latter logic's failure to capture the idea of teams of rules supporting a specific conclusion.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"42 1","pages":"Pages 47-57"},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00060-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133181552","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}
引用次数: 102
Index 指数
The Journal of Logic Programming Pub Date : 1999-11-01 Epub Date: 1999-11-15 DOI: 10.1016/S0743-1066(99)00056-4
{"title":"Index","authors":"","doi":"10.1016/S0743-1066(99)00056-4","DOIUrl":"https://doi.org/10.1016/S0743-1066(99)00056-4","url":null,"abstract":"","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"41 2","pages":"Pages 317-318"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00056-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91651281","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
Inductive synthesis of recursive logic programs: achievements and prospects 递归逻辑程序的归纳综合:成就与展望
The Journal of Logic Programming Pub Date : 1999-11-01 Epub Date: 1999-11-15 DOI: 10.1016/S0743-1066(99)00028-X
Pierre Flener , Serap Yıilmaz
{"title":"Inductive synthesis of recursive logic programs: achievements and prospects","authors":"Pierre Flener ,&nbsp;Serap Yıilmaz","doi":"10.1016/S0743-1066(99)00028-X","DOIUrl":"10.1016/S0743-1066(99)00028-X","url":null,"abstract":"<div><p>The inductive synthesis of recursive logic programs from incomplete information, such as input/output examples, is a challenging subfield both of Inductive Logic Programming (ILP) and of the synthesis (in general) of logic programs, from formal specifications. We first overview past and present achievements, focusing on the techniques that were designed specifically for the inductive synthesis of recursive logic programs but also discussing a few general ILP techniques that can also induce non-recursive hypotheses. Then we analyse the prospects of these techniques in this task, investigating their applicability to software engineering as well as to knowledge acquisition and discovery.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"41 2","pages":"Pages 141-195"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(99)00028-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116631979","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}
引用次数: 67
首页 上一页 下一页 尾页
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学术官方微信
小红书