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

Theory and Practice of Logic Programming最新文献

筛选
英文 中文
Transformation-Enabled Precondition Inference 支持转换的前提条件推理
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-08-06 DOI: 10.1017/S1471068421000272
Bishoksan Kafle, G. Gange, Peter James Stuckey, P. Schachte, H. Søndergaard
{"title":"Transformation-Enabled Precondition Inference","authors":"Bishoksan Kafle, G. Gange, Peter James Stuckey, P. Schachte, H. Søndergaard","doi":"10.1017/S1471068421000272","DOIUrl":"https://doi.org/10.1017/S1471068421000272","url":null,"abstract":"\u0000 Precondition inference is a non-trivial problem with important applications in program analysis and verification. We present a novel iterative method for automatically deriving preconditions for the safety and unsafety of programs. Each iteration maintains over-approximations of the set of safe and unsafe initial states, which are used to partition the program’s initial states into those known to be safe, known to be unsafe and unknown. We then construct revised programs with those unknown initial states and iterate the procedure until the approximations are disjoint or some termination criteria are met. An experimental evaluation of the method on a set of software verification benchmarks shows that it can infer precise preconditions (sometimes optimal) that are not possible using previous methods.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"69 1","pages":"700-716"},"PeriodicalIF":1.4,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79464963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures 基于代数测度的回答集规划的多关系上下文层次推理
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-08-06 DOI: 10.1017/S1471068421000284
Loris Bozzato, Thomas Eiter, Rafael Kiesel
{"title":"Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures","authors":"Loris Bozzato, Thomas Eiter, Rafael Kiesel","doi":"10.1017/S1471068421000284","DOIUrl":"https://doi.org/10.1017/S1471068421000284","url":null,"abstract":"Abstract Dealing with context-dependent knowledge has led to different formalizations of the notion of context. Among them is the Contextualized Knowledge Repository (CKR) framework, which is rooted in description logics but links on the reasoning side strongly to logic programs and Answer Set Programming (ASP) in particular. The CKR framework caters for reasoning with defeasible axioms and exceptions in contexts, which was extended to knowledge inheritance across contexts in a coverage (specificity) hierarchy. However, the approach supports only this single type of contextual relation and the reasoning procedures work only for restricted hierarchies, due to nontrivial issues with model preference under exceptions. In this paper, we overcome these limitations and present a generalization of CKR hierarchies to multiple contextual relations, along with their interpretation of defeasible axioms and preference. To support reasoning, we use ASP with algebraic measures, which is a recent extension of ASP with weighted formulas over semirings that allows one to associate quantities with interpretations depending on the truth values of propositional atoms. Notably, we show that for a relevant fragment of CKR hierarchies with multiple contextual relations, query answering can be realized with the popular asprin framework. The algebraic measures approach is more powerful and enables, for example, reasoning with epistemic queries over CKRs, which opens interesting perspectives for the use of quantitative ASP extensions in other applications.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"21 1","pages":"593 - 609"},"PeriodicalIF":1.4,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44286029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Optimizing Probabilities in Probabilistic Logic Programs 概率逻辑程序中的概率优化
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-08-06 DOI: 10.1017/S1471068421000260
Damiano Azzolini, Fabrizio Riguzzi
{"title":"Optimizing Probabilities in Probabilistic Logic Programs","authors":"Damiano Azzolini, Fabrizio Riguzzi","doi":"10.1017/S1471068421000260","DOIUrl":"https://doi.org/10.1017/S1471068421000260","url":null,"abstract":"Abstract Probabilistic logic programming is an effective formalism for encoding problems characterized by uncertainty. Some of these problems may require the optimization of probability values subject to constraints among probability distributions of random variables. Here, we introduce a new class of probabilistic logic programs, namely probabilistic optimizable logic programs, and we provide an effective algorithm to find the best assignment to probabilities of random variables, such that a set of constraints is satisfied and an objective function is optimized.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"21 1","pages":"543 - 556"},"PeriodicalIF":1.4,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45883536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
I-DLV-sr: A Stream Reasoning System based on I-DLV I-DLV-sr:一个基于I-DLV的流推理系统
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-08-05 DOI: 10.1017/S147106842100034X
Francesco Calimeri, M. Manna, Elena Mastria, Maria Concetta Morelli, S. Perri, J. Zangari
{"title":"I-DLV-sr: A Stream Reasoning System based on I-DLV","authors":"Francesco Calimeri, M. Manna, Elena Mastria, Maria Concetta Morelli, S. Perri, J. Zangari","doi":"10.1017/S147106842100034X","DOIUrl":"https://doi.org/10.1017/S147106842100034X","url":null,"abstract":"Abstract We introduce a novel logic-based system for reasoning over data streams, which relies on a framework enabling a tight, fine-tuned interaction between Apache Flink and the $${{mathcal I}^2}$$ -DLV system. The architecture allows to take advantage from both the powerful distributed stream processing capabilities of Flink and the incremental reasoning capabilities of $${{mathcal I}^2}$$ -DLV, based on overgrounding techniques. Besides the system architecture, we illustrate the supported input language and its modeling capabilities, and discuss the results of an experimental activity aimed at assessing the viability of the approach.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"21 1","pages":"610 - 628"},"PeriodicalIF":1.4,"publicationDate":"2021-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47173660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Analysis and Transformation of Constrained Horn Clauses for Program Verification 约束角子句在程序验证中的分析与转换
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-08-02 DOI: 10.1017/s1471068421000211
E. D. Angelis, F. Fioravanti, J. Gallagher, M. Hermenegildo, A. Pettorossi, M. Proietti
{"title":"Analysis and Transformation of Constrained Horn Clauses for Program Verification","authors":"E. D. Angelis, F. Fioravanti, J. Gallagher, M. Hermenegildo, A. Pettorossi, M. Proietti","doi":"10.1017/s1471068421000211","DOIUrl":"https://doi.org/10.1017/s1471068421000211","url":null,"abstract":"\u0000 This paper surveys recent work on applying analysis and transformation techniques that originate in the field of constraint logic programming (CLP) to the problem of verifying software systems. We present specialization-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs. Then, we describe static analysis techniques for CHCs that may be used for inferring relevant program properties, such as loop invariants. We also give an overview of some transformation techniques based on specialization and fold/unfold rules, which are useful for improving the effectiveness of CHC satisfiability tools. Finally, we discuss future developments in applying these techniques.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"4 1","pages":"974-1042"},"PeriodicalIF":1.4,"publicationDate":"2021-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76351517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Efficient TBox Reasoning with Value Restrictions using the ℱℒ0wer reasoner 利用_ (_)_ (_)wer推理器进行具有值限制的高效TBox推理
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-07-27 DOI: 10.1017/s1471068421000466
F. Baader, P. Koopmann, Friedrich Michel, Anni-Yasmin Turhan, Benjamin Zarrieß
{"title":"Efficient TBox Reasoning with Value Restrictions using the ℱℒ0wer reasoner","authors":"F. Baader, P. Koopmann, Friedrich Michel, Anni-Yasmin Turhan, Benjamin Zarrieß","doi":"10.1017/s1471068421000466","DOIUrl":"https://doi.org/10.1017/s1471068421000466","url":null,"abstract":"\u0000 The inexpressive Description Logic (DL) \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_0}$\u0000\u0000 \u0000 , which has conjunction and value restriction as its only concept constructors, had fallen into disrepute when it turned out that reasoning in \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_0}$\u0000\u0000 \u0000 w.r.t. general TBoxes is ExpTime-complete, that is, as hard as in the considerably more expressive logic \u0000 \u0000 \u0000 \u0000${cal A}{cal L}{cal C}$\u0000\u0000 \u0000 . In this paper, we rehabilitate \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_0}$\u0000\u0000 \u0000 by presenting a dedicated subsumption algorithm for \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_0}$\u0000\u0000 \u0000 , which is much simpler than the tableau-based algorithms employed by highly optimized DL reasoners. Our experiments show that the performance of our novel algorithm, as prototypically implemented in our \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_0}$\u0000\u0000 \u0000 wer reasoner, compares very well with that of the highly optimized reasoners. \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_0}$\u0000\u0000 \u0000 wer can also deal with ontologies written in the extension \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_ bot }$\u0000\u0000 \u0000 of \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_0}$\u0000\u0000 \u0000 with the top and the bottom concept by employing a polynomial-time reduction, shown in this paper, which eliminates top and bottom. We also investigate the complexity of reasoning in DLs related to the Horn-fragments of \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_0}$\u0000\u0000 \u0000 and \u0000 \u0000 \u0000 \u0000${cal F}{{cal L}_ bot }$\u0000\u0000 \u0000 .","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"15 1","pages":"162-192"},"PeriodicalIF":1.4,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86796754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory 用近似不动点理论分析聚合答案集规划的语义
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-04-30 DOI: 10.1017/S1471068422000126
Linde Vanbesien, M. Bruynooghe, M. Denecker
{"title":"Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory","authors":"Linde Vanbesien, M. Bruynooghe, M. Denecker","doi":"10.1017/S1471068422000126","DOIUrl":"https://doi.org/10.1017/S1471068422000126","url":null,"abstract":"Abstract Aggregates provide a concise way to express complex knowledge. The problem of selecting an appropriate formalization of aggregates for answer set programming (ASP) remains unsettled. This paper revisits it from the viewpoint of Approximation Fixpoint Theory (AFT). We introduce an AFT formalization equivalent with the Gelfond–Lifschitz reduct for basic ASP programs and we extend it to handle aggregates. We analyze how existing approaches relate to our framework. We hope this work sheds some new light on the issue of a proper formalization of aggregates.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"22 1","pages":"523 - 537"},"PeriodicalIF":1.4,"publicationDate":"2021-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45033991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Online Learning Probabilistic Event Calculus Theories in Answer Set Programming 在线学习概率事件演算理论在答案集规划
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-03-31 DOI: 10.1017/s1471068421000107
Nikos Katzouris, A. Artikis, G. Paliouras
{"title":"Online Learning Probabilistic Event Calculus Theories in Answer Set Programming","authors":"Nikos Katzouris, A. Artikis, G. Paliouras","doi":"10.1017/s1471068421000107","DOIUrl":"https://doi.org/10.1017/s1471068421000107","url":null,"abstract":"\u0000 Complex Event Recognition (CER) systems detect event occurrences in streaming time-stamped input using predefined event patterns. Logic-based approaches are of special interest in CER, since, via Statistical Relational AI, they combine uncertainty-resilient reasoning with time and change, with machine learning, thus alleviating the cost of manual event pattern authoring. We present a system based on Answer Set Programming (ASP), capable of probabilistic reasoning with complex event patterns in the form of weighted rules in the Event Calculus, whose structure and weights are learnt online. We compare our ASP-based implementation with a Markov Logic-based one and with a number of state-of-the-art batch learning algorithms on CER data sets for activity recognition, maritime surveillance and fleet management. Our results demonstrate the superiority of our novel approach, both in terms of efficiency and predictive performance. This paper is under consideration for publication in Theory and Practice of Logic Programming (TPLP).","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"2 2","pages":"362-386"},"PeriodicalIF":1.4,"publicationDate":"2021-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72447478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Probabilistic Semantic Web Reasoning and Learning, by Zese Riccardo 概率语义Web推理和学习，作者:Zese Riccardo
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-03-10 DOI: 10.1017/S1471068421000041
G. Pozzato
{"title":"Probabilistic Semantic Web Reasoning and Learning, by Zese Riccardo","authors":"G. Pozzato","doi":"10.1017/S1471068421000041","DOIUrl":"https://doi.org/10.1017/S1471068421000041","url":null,"abstract":"","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"3 1","pages":"496-498"},"PeriodicalIF":1.4,"publicationDate":"2021-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79519326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Signings and the Well-Founded Semantics 论签约和有根据的语义
IF 1.4 2区 数学
Theory and Practice of Logic Programming Pub Date : 2021-02-12 DOI: 10.1017/S1471068421000077
Michael J. Maher
{"title":"On Signings and the Well-Founded Semantics","authors":"Michael J. Maher","doi":"10.1017/S1471068421000077","DOIUrl":"https://doi.org/10.1017/S1471068421000077","url":null,"abstract":"\u0000 In this note, we use Kunen’s notion of a signing to establish two theorems about the well-founded semantics of logic programs, in the case where we are interested in only (say) the positive literals of a predicate p that are consequences of the program. The first theorem identifies a class of programs for which the well-founded and Fitting semantics coincide for the positive part of p. The second theorem shows that if a program has a signing, then computing the positive part of p under the well-founded semantics requires the computation of only one part of each predicate. This theorem suggests an analysis for query answering under the well-founded semantics. In the process of proving these results, we use an alternative formulation of the well-founded semantics of logic programs, which might be of independent interest.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"1 1","pages":"115-127"},"PeriodicalIF":1.4,"publicationDate":"2021-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88590697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信