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

sm ProbLog: Stable Model Semantics in ProbLog for Probabilistic Argumentation sm ProbLog: ProbLog中用于概率论证的稳定模型语义

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-05-25 DOI: 10.1017/s147106842300008x

PIETRO TOTIS, LUC DE RAEDT, ANGELIKA KIMMIG

{"title":"<scp>sm</scp> ProbLog: Stable Model Semantics in ProbLog for Probabilistic Argumentation","authors":"PIETRO TOTIS, LUC DE RAEDT, ANGELIKA KIMMIG","doi":"10.1017/s147106842300008x","DOIUrl":"https://doi.org/10.1017/s147106842300008x","url":null,"abstract":"Abstract Argumentation problems are concerned with determining the acceptability of a set of arguments from their relational structure. When the available information is uncertain, probabilistic argumentation frameworks provide modeling tools to account for it. The first contribution of this paper is a novel interpretation of probabilistic argumentation frameworks as probabilistic logic programs. Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. We show that the programs representing probabilistic argumentation frameworks do not satisfy a common assumption in probabilistic logic programming (PLP) semantics, which is, that probabilistic facts fully capture the uncertainty in the domain under investigation. The second contribution of this paper is then a novel PLP semantics for programs where a choice of probabilistic facts does not uniquely determine the truth assignment of the logical atoms. The third contribution of this paper is the implementation of a PLP system supporting this semantics: sm ProbLog. sm ProbLog is a novel PLP framework based on the PLP language ProbLog. sm ProbLog supports many inference and learning tasks typical of PLP, which, together with our first contribution, provide novel reasoning tools for probabilistic argumentation. We evaluate our approach with experiments analyzing the computational cost of the proposed algorithms and their application to a dataset of argumentation problems.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134974643","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

Distributed Subweb Specifications for Traversing the Web 用于遍历Web的分布式子Web规范

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-04-25 DOI: 10.1017/s1471068423000054

BART BOGAERTS, BAS KETSMAN, YOUNES ZEBOUDJ, HEBA AAMER, RUBEN TAELMAN, RUBEN VERBORGH

{"title":"Distributed Subweb Specifications for Traversing the Web","authors":"BART BOGAERTS, BAS KETSMAN, YOUNES ZEBOUDJ, HEBA AAMER, RUBEN TAELMAN, RUBEN VERBORGH","doi":"10.1017/s1471068423000054","DOIUrl":"https://doi.org/10.1017/s1471068423000054","url":null,"abstract":"Abstract Link traversal–based query processing ( ltqp ), in which a sparql query is evaluated over a web of documents rather than a single dataset, is often seen as a theoretically interesting yet impractical technique. However, in a time where the hypercentralization of data has increasingly come under scrutiny, a decentralized Web of Data with a simple document-based interface is appealing, as it enables data publishers to control their data and access rights. While ( ltqp allows evaluating complex queries over such webs, it suffers from performance issues (due to the high number of documents containing data) as well as information quality concerns (due to the many sources providing such documents). In existing ltqp approaches, the burden of finding sources to query is entirely in the hands of the data consumer . In this paper, we argue that to solve these issues, data publishers should also be able to suggest sources of interest and guide the data consumer toward relevant and trustworthy data. We introduce a theoretical framework that enables such guided link traversal and study its properties. We illustrate with a theoretic example that this can improve query results and reduce the number of network requests. We evaluate our proposal experimentally on a virtual linked web with specifications and indeed observe that not just the data quality but also the efficiency of querying improves.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135114929","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

Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers from the 4th International Joint Conference on Rules and Reasoning (RuleML+RR 2020) 逻辑规则与推理特刊简介：第四届规则与推理国际联席会议论文选集（RuleML+RR2020）

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2023-04-24 DOI: 10.1017/s1471068423000042

Tomáš Kliegr, Víctor Gutiérrez-Basulto, A. Soylu

引用次数: 0

Extended High-Utility Pattern Mining: An Answer Set Programming-Based Framework and Applications 扩展的高效用模式挖掘:基于答案集编程的框架与应用

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-04-19 DOI: 10.1017/s1471068423000066

FRANCESCO CAUTERUCCIO, GIORGIO TERRACINA

{"title":"Extended High-Utility Pattern Mining: An Answer Set Programming-Based Framework and Applications","authors":"FRANCESCO CAUTERUCCIO, GIORGIO TERRACINA","doi":"10.1017/s1471068423000066","DOIUrl":"https://doi.org/10.1017/s1471068423000066","url":null,"abstract":"Abstract Detecting sets of relevant patterns from a given dataset is an important challenge in data mining. The relevance of a pattern, also called utility in the literature, is a subjective measure and can be actually assessed from very different points of view. Rule-based languages like Answer Set Programming (ASP) seem well suited for specifying user-provided criteria to assess pattern utility in a form of constraints; moreover, declarativity of ASP allows for a very easy switch between several criteria in order to analyze the dataset from different points of view. In this paper, we make steps toward extending the notion of High-Utility Pattern Mining; in particular, we introduce a new framework that allows for new classes of utility criteria not considered in the previous literature. We also show how recent extensions of ASP with external functions can support a fast and effective encoding and testing of the new framework. To demonstrate the potential of the proposed framework, we exploit it as a building block for the definition of an innovative method for predicting ICU admission for COVID-19 patients. Finally, an extensive experimental activity demonstrates both from a quantitative and a qualitative point of view the effectiveness of the proposed approach.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135708536","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

Solving Rehabilitation Scheduling Problems via a Two-Phase ASP Approach 用两阶段ASP方法解决康复计划问题

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-04-17 DOI: 10.1017/s1471068423000030

MATTEO CARDELLINI, PAOLO DE NARDI, CARMINE DODARO, GIUSEPPE GALATÀ, ANNA GIARDINI, MARCO MARATEA, IVAN PORRO

引用次数: 0

Disjunctive Delimited Control 析取分隔控制

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-04-11 DOI: 10.1017/s1471068423000029

ALEXANDER VANDENBROUCKE, TOM SCHRIJVERS

引用次数: 0

Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling 并行机器调度中词典最大完工时间优化的答案集规划

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-01-26 DOI: 10.1017/s1471068423000017

THOMAS EITER, TOBIAS GEIBINGER, NYSRET MUSLIU, JOHANNES OETSCH, PETER SKOČOVSKÝ, DARIA STEPANOVA

{"title":"Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling","authors":"THOMAS EITER, TOBIAS GEIBINGER, NYSRET MUSLIU, JOHANNES OETSCH, PETER SKOČOVSKÝ, DARIA STEPANOVA","doi":"10.1017/s1471068423000017","DOIUrl":"https://doi.org/10.1017/s1471068423000017","url":null,"abstract":"Abstract We deal with a challenging scheduling problem on parallel machines with sequence-dependent setup times and release dates from a real-world application of semiconductor work-shop production. There, jobs can only be processed by dedicated machines, thus few machines can determine the makespan almost regardless of how jobs are scheduled on the remaining ones. This causes problems when machines fail and jobs need to be rescheduled. Instead of optimising only the makespan, we put the individual machine spans in non-ascending order and lexicographically minimise the resulting tuples. This achieves that all machines complete as early as possible and increases the robustness of the schedule. We study the application of answer-set programming (ASP) to solve this problem. While ASP eases modelling, the combination of timing constraints and the considered objective function challenges current solving technology. The former issue is addressed by using an extension of ASP by difference logic. For the latter, we devise different algorithms that use multi-shot solving. To tackle industrial-sized instances, we study different approximations and heuristics. Our experimental results show that ASP is indeed a promising knowledge representation and reasoning (KRR) paradigm for this problem and is competitive with state-of-the-art constraint programming (CP) and Mixed-Integer Programming (MIP) solvers.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135907844","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

Unifying Framework for Optimizations in Non-Boolean Formalisms 非布尔形式优化的统一框架

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2022-11-15 DOI: 10.1017/s1471068422000400

YULIYA LIERLER

{"title":"Unifying Framework for Optimizations in Non-Boolean Formalisms","authors":"YULIYA LIERLER","doi":"10.1017/s1471068422000400","DOIUrl":"https://doi.org/10.1017/s1471068422000400","url":null,"abstract":"Search-optimization problems are plentiful in scientific and engineering domains. Artificial intelligence (AI) has long contributed to the development of search algorithms and declarative programming languages geared toward solving and modeling search-optimization problems. Automated reasoning and knowledge representation are the subfields of AI that are particularly vested in these developments. Many popular automated reasoning paradigms provide users with languages supporting optimization statements. Recall integer linear programming, MaxSAT, optimization satisfiability modulo theory, (constraint) answer set programming. These paradigms vary significantly in their languages in ways they express quality conditions on computed solutions. Here we propose a unifying framework of so-called extended weight systems that eliminates syntactic distinctions between paradigms. They allow us to see essential similarities and differences between optimization statements provided by distinct automated reasoning languages. We also study formal properties of the proposed systems that immediately translate into formal properties of paradigms that can be captured within our framework.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"1 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2022-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540406","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

Swift Markov Logic for Probabilistic Reasoning on Knowledge Graphs 知识图概率推理的快速马尔可夫逻辑

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2022-11-09 DOI: 10.1017/s1471068422000412

LUIGI BELLOMARINI, ELEONORA LAURENZA, EMANUEL SALLINGER, EVGENY SHERKHONOV

{"title":"Swift Markov Logic for Probabilistic Reasoning on Knowledge Graphs","authors":"LUIGI BELLOMARINI, ELEONORA LAURENZA, EMANUEL SALLINGER, EVGENY SHERKHONOV","doi":"10.1017/s1471068422000412","DOIUrl":"https://doi.org/10.1017/s1471068422000412","url":null,"abstract":"We provide a framework for probabilistic reasoning in Vadalog-based Knowledge Graphs (KGs), satisfying the requirements of ontological reasoning: full recursion, powerful existential quantification, expression of inductive definitions. Vadalog is a Knowledge Representation and Reasoning (KRR) language based on Warded Datalog+/–, a logical core language of existential rules, with a good balance between computational complexity and expressive power. Handling uncertainty is essential for reasoning with KGs. Yet Vadalog and Warded Datalog+/– are not covered by the existing probabilistic logic programming and statistical relational learning approaches for several reasons, including insufficient support for recursion with existential quantification and the impossibility to express inductive definitions. In this work, we introduce Soft Vadalog, a probabilistic extension to Vadalog, satisfying these desiderata. A Soft Vadalog program induces what we call a Probabilistic Knowledge Graph (PKG), which consists of a probability distribution on a network of chase instances, structures obtained by grounding the rules over a database using the chase procedure. We exploit PKGs for probabilistic marginal inference. We discuss the theory and present MCMC-chase, a Monte Carlo method to use Soft Vadalog in practice. We apply our framework to solve data management and industrial problems and experimentally evaluate it in the Vadalog system.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"128 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2022-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540404","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

An Application of a Runtime Epistemic Probabilistic Event Calculus to Decision-making in e-Health Systems 运行时认知概率事件演算在电子医疗系统决策中的应用

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2022-10-20 DOI: 10.1017/s1471068422000382

FABIO AURELIO D’ASARO, LUCA RAGGIOLI, SALIM MALEK, MARCO GRAZIOSO, SILVIA ROSSI

{"title":"An Application of a Runtime Epistemic Probabilistic Event Calculus to Decision-making in e-Health Systems","authors":"FABIO AURELIO D’ASARO, LUCA RAGGIOLI, SALIM MALEK, MARCO GRAZIOSO, SILVIA ROSSI","doi":"10.1017/s1471068422000382","DOIUrl":"https://doi.org/10.1017/s1471068422000382","url":null,"abstract":"We present and discuss a runtime architecture that integrates sensorial data and classifiers with a logic-based decision-making system in the context of an e-Health system for the rehabilitation of children with neuromotor disorders. In this application, children perform a rehabilitation task in the form of games. The main aim of the system is to derive a set of parameters the child’s current level of cognitive and behavioral performance (e.g., engagement, attention, task accuracy) from the available sensors and classifiers (e.g., eye trackers, motion sensors, emotion recognition techniques) and take decisions accordingly. These decisions are typically aimed at improving the child’s performance by triggering appropriate re-engagement stimuli when their attention is low, by changing the game or making it more difficult when the child is losing interest in the task as it is too easy. Alongside state-of-the-art techniques for emotion recognition and head pose estimation, we use a runtime variant of a probabilistic and epistemic logic programming dialect of the Event Calculus, known as the Epistemic Probabilistic Event Calculus. In particular, the probabilistic component of this symbolic framework allows for a natural interface with the machine learning techniques. We overview the architecture and its components, and show some of its characteristics through a discussion of a running example and experiments.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"27 1","pages":""},"PeriodicalIF":1.4,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540405","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