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

Integrating Logic Rules with Everything Else, Seamlessly 将逻辑规则与其他一切无缝集成

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000108

YANHONG A. LIU, SCOTT D. STOLLER, YI TONG, BO LIN

引用次数: 1

Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling 慢性病门诊就诊调度答案集规划中基于逻辑的弯曲分解

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s147106842300025x

PAOLA CAPPANERA, MARCO GAVANELLI, MADDALENA NONATO, MARCO ROMA

{"title":"Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling","authors":"PAOLA CAPPANERA, MARCO GAVANELLI, MADDALENA NONATO, MARCO ROMA","doi":"10.1017/s147106842300025x","DOIUrl":"https://doi.org/10.1017/s147106842300025x","url":null,"abstract":"Abstract In answer set programming (ASP), the user can define declaratively a problem and solve it with efficient solvers; practical applications of ASP are countless and several constraint problems have been successfully solved with ASP. On the other hand, solution time usually grows in a superlinear way (often, exponential) with respect to the size of the instance, which is impractical for large instances. A widely used approach is to split the optimization problem into subproblems (SPs) that are solved in sequence, some committing to the values assigned by others, and reconstructing a valid assignment for the whole problem by juxtaposing the solutions of the single SPs. On the one hand, this approach is much faster due to the superlinear behavior; on the other hand, it does not provide any guarantee of optimality: committing to the assignment of one SP can rule out the optimal solution from the search space. In other research areas, logic-Based Benders decomposition (LBBD) proved effective; in LBBD, the problem is decomposed into a master problem (MP) and one or several SPs. The solution of the MP is passed to the SPs that can possibly fail. In case of failure, a no-good is returned to the MP that is solved again with the addition of the new constraint. The solution process is iterated until a valid solution is obtained for all the SPs or the MP is proven infeasible. The obtained solution is provably optimal under very mild conditions. In this paper, we apply for the first time LBBD to ASP, exploiting an application in health care as case study. Experimental results show the effectiveness of the approach. We believe that the availability of LBBD can further increase the practical applicability of ASP technologies.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135569082","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

Embracing Background Knowledge in the Analysis of Actual Causality: An Answer Set Programming Approach 在实际因果关系分析中包含背景知识:一种答案集规划方法

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000248

MICHAEL GELFOND, JORGE FANDINNO, EVGENII BALAI

引用次数: 0

Non-deterministic Approximation Operators: Ultimate Operators, Semi-equilibrium Semantics, and Aggregates 非确定性近似算子:极限算子、半平衡语义和聚合

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000236

JESSE HEYNINCK, BART BOGAERTS

引用次数: 0

Interactive Model Expansion in an Observable Environment 可观察环境中的交互模型扩展

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000261

PIERRE CARBONNELLE, JOOST VENNEKENS, MARC DENECKER, BART BOGAERTS

{"title":"Interactive Model Expansion in an Observable Environment","authors":"PIERRE CARBONNELLE, JOOST VENNEKENS, MARC DENECKER, BART BOGAERTS","doi":"10.1017/s1471068423000261","DOIUrl":"https://doi.org/10.1017/s1471068423000261","url":null,"abstract":"Abstract Many practical problems can be understood as the search for a state of affairs that extends a fixed partial state of affairs, the environment , while satisfying certain conditions that are formally specified. Such problems are found in, for example, engineering, law or economics. We study this class of problems in a context where some of the relevant information about the environment is not known by the user at the start of the search. During the search, the user may consider tentative solutions that make implicit hypotheses about these unknowns. To ensure that the solution is appropriate, these hypotheses must be verified by observing the environment. Furthermore, we assume that, in addition to knowledge of what constitutes a solution, knowledge of general laws of the environment is also present. We formally define partial solutions with enough verified facts to guarantee the existence of complete and appropriate solutions. Additionally, we propose an interactive system to assist the user in their search by determining (1) which hypotheses implicit in a tentative solution must be verified in the environment, and (2) which observations can bring useful information for the search. We present an efficient method to over-approximate the set of relevant information, and evaluate our implementation.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135711669","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

Learnability with PAC Semantics for Multi-agent Beliefs 多智能体信念PAC语义的可学习性

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000182

IONELA G. MOCANU, VAISHAK BELLE, BRENDAN JUBA

{"title":"Learnability with PAC Semantics for Multi-agent Beliefs","authors":"IONELA G. MOCANU, VAISHAK BELLE, BRENDAN JUBA","doi":"10.1017/s1471068423000182","DOIUrl":"https://doi.org/10.1017/s1471068423000182","url":null,"abstract":"Abstract The tension between deduction and induction is perhaps the most fundamental issue in areas such as philosophy, cognition, and artificial intelligence. In an influential paper, Valiant recognized that the challenge of learning should be integrated with deduction. In particular, he proposed a semantics to capture the quality possessed by the output of probably approximately correct (PAC) learning algorithms when formulated in a logic. Although weaker than classical entailment, it allows for a powerful model-theoretic framework for answering queries. In this paper, we provide a new technical foundation to demonstrate PAC learning with multi-agent epistemic logics. To circumvent the negative results in the literature on the difficulty of robust learning with the PAC semantics, we consider so-called implicit learning where we are able to incorporate observations to the background theory in service of deciding the entailment of an epistemic query. We prove correctness of the learning procedure and discuss results on the sample complexity, that is how many observations we will need to provably assert that the query is entailed given a user-specified error bound. Finally, we investigate under what circumstances this algorithm can be made efficient. On the last point, given that reasoning in epistemic logics especially in multi-agent epistemic logics is PSPACE-complete, it might seem like there is no hope for this problem. We leverage some recent results on the so-called Representation Theorem explored for single-agent and multi-agent epistemic logics with the only knowing operator to reduce modal reasoning to propositional reasoning.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134983377","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

External Behavior of a Logic Program and Verification of Refactoring 逻辑程序的外部行为与重构的验证

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000200

JORGE FANDINNO, ZACHARY HANSEN, YULIYA LIERLER, VLADIMIR LIFSCHITZ, NATHAN TEMPLE

引用次数: 1

An ASP Framework for the Refinement of Authorization and Obligation Policies 用于细化授权和义务策略的ASP框架

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s147106842300011x

DANIELA INCLEZAN

引用次数: 1

Knowledge-based Reasoning and Learning under Partial Observability in Ad Hoc Teamwork Ad Hoc团队中部分可观察性下的知识推理与学习

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-06-26 DOI: 10.1017/s1471068423000091

HASRA DODAMPEGAMA, MOHAN SRIDHARAN

{"title":"Knowledge-based Reasoning and Learning under Partial Observability in Ad Hoc Teamwork","authors":"HASRA DODAMPEGAMA, MOHAN SRIDHARAN","doi":"10.1017/s1471068423000091","DOIUrl":"https://doi.org/10.1017/s1471068423000091","url":null,"abstract":"Abstract Ad hoc teamwork (AHT) refers to the problem of enabling an agent to collaborate with teammates without prior coordination. State of the art methods in AHT are data-driven , using a large labeled dataset of prior observations to model the behavior of other agent types and to determine the ad hoc agent’s behavior. These methods are computationally expensive, lack transparency, and make it difficult to adapt to previously unseen changes. Our recent work introduced an architecture that determined an ad hoc agent’s behavior based on non-monotonic logical reasoning with prior commonsense domain knowledge and models learned from limited examples to predict the behavior of other agents. This paper describes KAT, a knowledge-driven architecture for AHT that substantially expands our prior architecture’s capabilities to support: (a) online selection, adaptation, and learning of the behavior prediction models; and (b) collaboration with teammates in the presence of partial observability and limited communication. We illustrate and experimentally evaluate KAT’s capabilities in two simulated benchmark domains for multiagent collaboration: Fort Attack and Half Field Offense. We show that KAT’s performance is better than a purely knowledge-driven baseline, and comparable with or better than a state of the art data-driven baseline, particularly in the presence of limited training data, partial observability, and changes in team composition.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135608591","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

System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics 系统预测器:答案集语义下逻辑程序的接地大小估计器

2区数学

Theory and Practice of Logic Programming Pub Date : 2023-06-22 DOI: 10.1017/s1471068423000078

DANIEL BRESNAHAN, NICHOLAS HIPPEN, YULIYA LIERLER

引用次数: 0