检索结果-内蒙古大学图书馆

Provenance Guided Rollback Suggestions

THEORY AND PRACTICE OF logic programming 2025年

作者： Zhao, David Subotic, Pavle Raghothaman, Mukund Scholz, Bernhard Univ Sydney Glebe NSW Australia Microsoft Redmond WA USA Univ Southern Calif Los Angeles CA USA

Advances in incremental Datalog evaluation strategies have made Datalog popular among use cases with constantly evolving inputs such as static analysis in continuous integration and deployment pipelines. As a result, new logic programming debugging techniques are needed to support these emerging use *** paper introduces an incremental debugging technique for Datalog, which determines the failing changes for a rollback in an incremental setup. Our debugging technique leverages a novel incremental provenance method. We have implemented our technique using an incremental version of the Souffl & eacute;Datalog engine and evaluated its effectiveness on the DaCapo Java program benchmarks analyzed by the Doop static analysis library. Compared to state-of-the-art techniques, we can localize faults and suggest rollbacks with an overall speedup of over 26.9 $\times$ while providing higher quality results.

关键词： logic programming methodology and applications

来源：评论

学校读者我要写书评

暂无评论

Locally Tight Programs

引用

THEORY AND PRACTICE OF logic programming 2024年第5期24卷 942-972页

作者： Fandinno, Jorge Lifschitz, Vladimir Temple, Nathan Univ Nebraska Omaha NE 68182 USA Univ Texas Austin Austin TX 78712 USA

Program completion is a translation from the language of logic programs into the language of first-order theories. Its original definition has been extended to programs that include integer arithmetic, accept input, and distinguish between output predicates and auxiliary predicates. For tight programs, that generalization of completion is known to match the stable model semantics, which is the basis of answer set programming. We show that the tightness condition in this theorem can be replaced by a less restrictive "local tightness" requirement. From this fact we conclude that the proof assistant anthem-p2p can be used to verify equivalence between locally tight programs.

关键词： theory specification analysis and verification of systems security logic programming methodology and applications

来源：评论

学校读者我要写书评

暂无评论

CON-FOLD Explainable Machine Learning with Confidence

引用

THEORY AND PRACTICE OF logic programming 2024年第4期24卷 663-681页

作者： Mcginness, Lachlan Baumgartner, Peter Australian Natl Univ Sch Comp Sci Canberra Australia CSIRO Data61 Canberra Australia

FOLD-RM is an explainable machine learning classification algorithm that uses training data to create a set of classification rules. In this paper, we introduce CON-FOLD which extends FOLD-RM in several ways. CON-FOLD assigns probability-based confidence scores to rules learned for a classification task. This allows users to know how confident they should be in a prediction made by the model. We present a confidence-based pruning algorithm that uses the unique structure of FOLD-RM rules to efficiently prune rules and prevent overfitting. Furthermore, CON-FOLD enables the user to provide preexisting knowledge in the form of logic program rules that are either (fixed) background knowledge or (modifiable) initial rule candidates. The paper describes our method in detail and reports on practical experiments. We demonstrate the performance of the algorithm on benchmark datasets from the UCI Machine Learning Repository. For that, we introduce a new metric, Inverse Brier Score, to evaluate the accuracy of the produced confidence scores. Finally, we apply this extension to a real-world example that requires explainability: marking of student responses to a short answer question from the Australian Physics Olympiad.

关键词： logic programming methodology and applications inductive logic programming and multi-relational data mining

来源：评论

学校读者我要写书评

暂无评论

Clingraph: A System for ASP-based Visualization

引用

THEORY AND PRACTICE OF logic programming 2024年第3期24卷 533-559页

作者： Hahn, Susana Sabuncu, Orkunt Schaub, Torsten Stolzmann, Tobias Univ Potsdam Potsdam Germany Germany Potassco Solut Potsdam Germany TED Univ Ankara Turkiye Turkey Potassco Solut Potsdam Germany

We present the Answer Set programming (ASP)-based visualization tool clingraph, which aims at visualizing various concepts of ASP by means of ASP itself. This idea traces back to the aspviz tool and clingraph redevelops and extends it in the context of modern ASP systems. More precisely, clingraph takes graph specifications in terms of ASP facts and hands them over to the graph visualization system graphviz. The use of ASP provides a great interface between logic programs and/or answer sets and their visualization. Also, clingraph offers a Python application programming interface (API) that extends this ease of interfacing to clingo's API and in turn to connect and monitor various aspects of the solving process.

关键词： logic programming methodology and applications knowledge representation and nonmonotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Preface to the Special Issue on the 2022 Conference on logic programming and Nonmonotonic Reasoning

引用

THEORY AND PRACTICE OF logic programming 2024年第3期24卷 422-424页

作者： Gottlob, Georg Inclezan, Daniela Maratea, Marco Univ Calabria Arcavacata Di Rende Italy Univ Miami Oxford OH USA

来源：评论

学校读者我要写书评

暂无评论

Quantifying over Optimum Answer Sets

引用

THEORY AND PRACTICE OF logic programming 2024年第4期24卷 716-736页

作者： Mazzotta, Giuseppe Ricca, Francesco Truszczynski, Mirek Univ Calabria Arcavacata De Rende Italy Univ Kentucky Lexington KY USA

Answer Set programming with Quantifiers (ASP(Q)) has been introduced to provide a natural extension of ASP modeling to problems in the polynomial hierarchy (PH). However, ASP(Q) lacks a method for encoding in an elegant and compact way problems requiring a polynomial number of calls to an oracle in $\Sigma _n<^>p$ (that is, problems in $\Delta _{n+1}<^>p$). Such problems include, in particular, optimization problems. In this paper, we propose an extension of ASP(Q), in which component programs may contain weak constraints. Weak constraints can be used both for expressing local optimization within quantified component programs and for modeling global optimization criteria. We showcase the modeling capabilities of the new formalism through various application scenarios. Further, we study its computational properties obtaining complexity results and unveiling non-obvious characteristics of ASP(Q) programs with weak constraints.

关键词： design analysis and implementation of languages knowledge representation and nonmonotonic reasoning logic programming methodology and applications

来源：评论

学校读者我要写书评

暂无评论

Abstract Environment Trimming

引用

THEORY AND PRACTICE OF logic programming 2024年第4期24卷 863-884页

作者： Jurjo-rivas, Daniel Morales, Jose F. Lopez-garcia, Pedro Hermenegildo, Manuel, V Univ Politecn Madrid UPM IMDEA Software Inst Madrid Spain IMDEA Software Inst Spanish Council Sci Res Madrid Spain

Variable sharing is a fundamental property in the static analysis of logic programs, since it is instrumental for ensuring correctness and increasing precision while inferring many useful program properties. Such properties include modes, determinacy, non-failure, cost, etc. This has motivated significant work on developing abstract domains to improve the precision and performance of sharing analyses. Much of this work has centered around the family of set-sharing domains, because of the high precision they offer. However, this comes at a price: their scalability to a wide set of realistic programs remains challenging and this hinders their wider adoption. In this work, rather than defining new sharing abstract domains, we focus instead on developing techniques which can be incorporated in the analyzers to address aspects that are known to affect the efficiency of these domains, such as the number of variables, without affecting precision. These techniques are inspired in others used in the context of compiler optimizations, such as expression reassociation and variable trimming. We present several such techniques and provide an extensive experimental evaluation of over 1100 program modules taken from both production code and classical benchmarks. This includes the Spectector cache analyzer, the s(CASP) system, the libraries of the Ciao system, the LPdoc documenter, the PLAI analyzer itself, etc. The experimental results are quite encouraging: we have obtained significant speedups, and, more importantly, the number of modules that require a timeout was cut in half. As a result, many more programs can be analyzed precisely in reasonable times.

关键词： logic programming methodology and applications specification analysis and verification of systems security

来源：评论

学校读者我要写书评

暂无评论

Operating Room (Re)Scheduling with Bed Management via ASP

引用

THEORY AND PRACTICE OF logic programming 2022年第2期22卷 229-253页

作者： Dodaro, Carmine Galata, Giuseppe Khan, Muhammad Kamran Maratea, Marco Porro, Ivan Univ Calabria Genoa Italy SurgiQ Srl Genoa Italy Univ Genoa Genoa Italy

The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms (ORs), taking into account different specialties, lengths, and priority scores of each planned surgery, OR session durations, and the availability of beds for the entire length of stay (LOS) both in the Intensive Care Unit (ICU) and in the wards. A proper solution to the ORS problem is of primary importance for the healthcare service quality and the satisfaction of patients in hospital environments. In this paper we first present a solution to the problem based on Answer Set programming (ASP). The solution is tested on benchmarks with realistic sizes and parameters, on three scenarios for the target length on 5-day scheduling, common in small-medium-sized hospitals, and results show that ASP is a suitable solving methodology for the ORS problem in such setting. Then, we also performed a scalability analysis on the schedule length up to 15 days, which still shows the suitability of our solution also on longer plan horizons. Moreover, we also present an ASP solution for the rescheduling problem, that is, when the offline schedule cannot be completed for some reason. Finally, we introduce a web framework for managing ORS problems via ASP that allows a user to insert the main parameters of the problem, solve a specific instance, and show results graphically in real time.

关键词： logic programming methodology and applications knowledge representation and nonmonotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Efficient Knowledge Compilation Beyond Weighted Model Counting

引用

THEORY AND PRACTICE OF logic programming 2022年第4期22卷 505-522页

作者： KIESEL, R. A. F. A. E. L. TOTIS, P. I. E. T. R. O. KIMMIG, A. N. G. E. L. I. K. A. TU Wien Vienna Austria Katholieke Univ Leuven Leuven Belgium

Quantitative extensions of logic programming often require the solution of so called second level inference tasks, that is, problems that involve a third operation, such as maximization or normalization, on top of addition and multiplication, and thus go beyond the well-known weighted or algebraic model counting setting of probabilistic logic programming under the distribution semantics. We introduce Second Level Algebraic Model Counting (2AMC) as a generic framework for these kinds of problems. As 2AMC is to (algebraic) model counting what forall-exists-SAT is to propositional satisfiability, it is notoriously hard to solve. First level techniques based on Knowledge Compilation (KC) have been adapted for specific 2AMC instances by imposing variable order constraints on the resulting circuit. However, those constraints can severely increase the circuit size and thus decrease the efficiency of such approaches. We show that we can exploit the logical structure of a 2AMC problem to omit parts of these constraints, thus limiting the negative effect. Furthermore, we introduce and implement a strategy to generate a sufficient set of constraints statically, with a priori guarantees for the performance of KC. Our empirical evaluation on several benchmarks and tasks confirms that our theoretical results can translate into more efficient solving in practice.

关键词： design analysis and implementation of languages logic programming methodology and applications

来源：评论

学校读者我要写书评

暂无评论

Characterizing Boundedness in Chase Variants

引用

THEORY AND PRACTICE OF logic programming 2021年第1期21卷 51-79页

作者： Delivorias, Stathis Leclere, Michel Mugnier, Marie-Laure Ulliana, Federico Univ Montpellier LIRMM CNRS INRIA Montpellier France

Existential rules are a positive fragment of first-order logic that generalizes function-free Horn rules by allowing existentially quantified variables in rule heads. This family of languages has recently attracted significant interest in the context of ontology-mediated query answering. Forward chaining, also known as the chase, is a fundamental tool for computing universal models of knowledge bases, which consist of existential rules and facts. Several chase variants have been defined, which differ on the way they handle redundancies. A set of existential rules is bounded if it ensures the existence of a bound on the depth of the chase, independently from any set of facts. Deciding if a set of rules is bounded is an undecidable problem for all chase variants. Nevertheless, when computing universal models, knowing that a set of rules is bounded for some chase variant does not help much in practice if the bound remains unknown or even very large. Hence, we investigate the decidability of the k-boundedness problem, which asks whether the depth of the chase for a given set of rules is bounded by an integer k. We identify a general property which, when satisfied by a chase variant, leads to the decidability of k-boundedness. We then show that the main chase variants satisfy this property, namely the oblivious, semi-oblivious (aka Skolem), and restricted chase, as well as their breadth-first versions.

关键词： knowledge representation and nonmonotonic reasoning logic programming methodology and applications databases and semantic web reasoning theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：