Theory and Practice of Logic Programming最新文献_第10页

Solution Enumeration by Optimality in Answer Set Programming 答案集规划中的最优解枚举

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-08-07 DOI: 10.1017/S1471068421000375

J. Pajunen, T. Janhunen

{"title":"Solution Enumeration by Optimality in Answer Set Programming","authors":"J. Pajunen, T. Janhunen","doi":"10.1017/S1471068421000375","DOIUrl":"https://doi.org/10.1017/S1471068421000375","url":null,"abstract":"\u0000 Given a combinatorial search problem, it may be highly useful to enumerate its (all) solutions besides just finding one solution, or showing that none exists. The same can be stated about optimal solutions if an objective function is provided. This work goes beyond the bare enumeration of optimal solutions and addresses the computational task of solution enumeration by optimality (SEO). This task is studied in the context of answer set programming (ASP) where (optimal) solutions of a problem are captured with the answer sets of a logic program encoding the problem. Existing answer set solvers already support the enumeration of all (optimal) answer sets. However, in this work, we generalize the enumeration of optimal answer sets beyond strictly optimal ones, giving rise to the idea of answer set enumeration in the order of optimality (ASEO). This approach is applicable up to the best k answer sets or in an unlimited setting, which amounts to a process of sorting answer sets based on the objective function. As the main contribution of this work, we present the first general algorithms for the aforementioned tasks of answer set enumeration. Moreover, we illustrate the potential use cases of ASEO. First, we study how efficiently access to the next-best solutions can be achieved in a number of optimization problems that have been formalized and solved in ASP. Second, we show that ASEO provides us with an effective sampling technique for Bayesian networks.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"2 1","pages":"750-767"},"PeriodicalIF":1.4,"publicationDate":"2021-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76302885","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}

引用次数: 2

Nonground Abductive Logic Programming with Probabilistic Integrity Constraints 具有概率完整性约束的非圆展开逻辑规划

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-08-06 DOI: 10.1017/S1471068421000417

Elena Bellodi, M. Gavanelli, Riccardo Zese, E. Lamma, Fabrizio Riguzzi

引用次数: 1

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs 利用树宽度对认识逻辑程序进行定量推理

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-08-06 DOI: 10.1017/S1471068421000399

Viktor Besin, Markus Hecher, S. Woltran

{"title":"Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs","authors":"Viktor Besin, Markus Hecher, S. Woltran","doi":"10.1017/S1471068421000399","DOIUrl":"https://doi.org/10.1017/S1471068421000399","url":null,"abstract":"Abstract Extending the popular answer set programming paradigm by introspective reasoning capacities has received increasing interest within the last years. Particular attention is given to the formalism of epistemic logic programs (ELPs) where standard rules are equipped with modal operators which allow to express conditions on literals for being known or possible, that is, contained in all or some answer sets, respectively. ELPs thus deliver multiple collections of answer sets, known as world views. Employing ELPs for reasoning problems so far has mainly been restricted to standard decision problems (complexity analysis) and enumeration (development of systems) of world views. In this paper, we take a next step and contribute to epistemic logic programming in two ways: First, we establish quantitative reasoning for ELPs, where the acceptance of a certain set of literals depends on the number (proportion) of world views that are compatible with the set. Second, we present a novel system that is capable of efficiently solving the underlying counting problems required to answer such quantitative reasoning problems. Our system exploits the graph-based measure treewidth and works by iteratively finding and refining (graph) abstractions of an ELP program. On top of these abstractions, we apply dynamic programming that is combined with utilizing existing search-based solvers like (e)clingo for hard combinatorial subproblems that appear during solving. It turns out that our approach is competitive with existing systems that were introduced recently.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"21 1","pages":"575 - 592"},"PeriodicalIF":1.4,"publicationDate":"2021-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49615796","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}

引用次数: 4

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

引用次数: 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

引用次数: 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

引用次数: 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

引用次数: 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

Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches 约束答案集规划:集成和转换(或基于smt的)方法

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-07-17 DOI: 10.1017/s1471068421000478

Y. Lierler

{"title":"Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches","authors":"Y. Lierler","doi":"10.1017/s1471068421000478","DOIUrl":"https://doi.org/10.1017/s1471068421000478","url":null,"abstract":"\u0000 Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing, and satisfiability modulo theories. CASP demonstrates promising results, including the development of a multitude of solvers: acsolver, clingcon, ezcsp, idp, inca, dingo, mingo, aspmt2smt, clingo[l,dl], and ezsmt. It opens new horizons for declarative programming applications such as solving complex train scheduling problems. Systems designed to find solutions to constraint answer set programs can be grouped according to their construction into, what we call, integrational or translational approaches. The focus of this paper is an overview of the key ingredients of the design of constraint answer set solvers drawing distinctions and parallels between integrational and translational approaches. The paper also provides a glimpse at the kind of programs its users develop by utilizing a CASP encoding of Traveling Salesman problem for illustration. In addition, we place the CASP technology on the map among its automated reasoning peers as well as discuss future possibilities for the development of CASP.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"26 1","pages":"195-225"},"PeriodicalIF":1.4,"publicationDate":"2021-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81611771","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}

引用次数: 4