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

Theory and Practice of Logic Programming最新文献

筛选
英文 中文
An Efficient Solver for ASP(Q) ASP(Q)问题的高效求解器
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000121
WOLFGANG FABER, GIUSEPPE MAZZOTTA, FRANCESCO RICCA
{"title":"An Efficient Solver for ASP(Q)","authors":"WOLFGANG FABER, GIUSEPPE MAZZOTTA, FRANCESCO RICCA","doi":"10.1017/s1471068423000121","DOIUrl":"https://doi.org/10.1017/s1471068423000121","url":null,"abstract":"Abstract Answer Set Programming with Quantifiers ASP(Q) extends Answer Set Programming (ASP) to allow for declarative and modular modeling of problems from the entire polynomial hierarchy. The first implementation of ASP(Q), called QASP, was based on a translation to Quantified Boolean Formulae (QBF) with the aim of exploiting the well-developed and mature QBF-solving technology. However, the implementation of the QBF encoding employed in qasp is very general and might produce formulas that are hard to evaluate for existing QBF solvers because of the large number of symbols and subclauses. In this paper, we present a new implementation that builds on the ideas of QASP and features both a more efficient encoding procedure and new optimized encodings of ASP(Q) programs in QBF. The new encodings produce smaller formulas (in terms of the number of quantifiers, variables, and clauses) and result in a more efficient evaluation process. An algorithm selection strategy automatically combines several QBF-solving back-ends to further increase performance. An experimental analysis, conducted on known benchmarks, shows that the new system outperforms QASP.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"16 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":"135364269","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
Toward A Logical Theory Of Fairness and Bias 《公平与偏见的逻辑理论
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000157
VAISHAK BELLE
{"title":"Toward A Logical Theory Of Fairness and Bias","authors":"VAISHAK BELLE","doi":"10.1017/s1471068423000157","DOIUrl":"https://doi.org/10.1017/s1471068423000157","url":null,"abstract":"Abstract Fairness in machine learning is of considerable interest in recent years owing to the propensity of algorithms trained on historical data to amplify and perpetuate historical biases. In this paper, we argue for a formal reconstruction of fairness definitions, not so much to replace existing definitions but to ground their application in an epistemic setting and allow for rich environmental modeling. Consequently we look into three notions: fairness through unawareness, demographic parity and counterfactual fairness, and formalize these in the epistemic situation calculus.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"75 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":"135509285","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 39th International Conference on Logic Programming Special Issue 第39届逻辑规划国际会议特刊导论
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000212
STEFANIA COSTANTINI, ENRICO PONTELLI, ALESSANDRA RUSSO, FRANCESCA TONI
{"title":"Introduction to the 39<sup>th</sup> International Conference on Logic Programming Special Issue","authors":"STEFANIA COSTANTINI, ENRICO PONTELLI, ALESSANDRA RUSSO, FRANCESCA TONI","doi":"10.1017/s1471068423000212","DOIUrl":"https://doi.org/10.1017/s1471068423000212","url":null,"abstract":"An abstract is not available for this content. As you have access to this content, full HTML content is provided on this page. A PDF of this content is also available in through the ‘Save PDF’ action button.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"4 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":"135363825","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
Locksynth: Deriving Synchronization Code for Concurrent Data Structures with ASP Locksynth:用ASP派生并发数据结构的同步代码
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000303
SARAT CHANDRA VARANASI, NEERAJ MITTAL, GOPAL GUPTA
{"title":"Locksynth: Deriving Synchronization Code for Concurrent Data Structures with ASP","authors":"SARAT CHANDRA VARANASI, NEERAJ MITTAL, GOPAL GUPTA","doi":"10.1017/s1471068423000303","DOIUrl":"https://doi.org/10.1017/s1471068423000303","url":null,"abstract":"Abstract We present Locksynth , a tool that automatically derives synchronization needed for destructive updates to concurrent data structures that involve a constant number of shared heap memory write operations. Locksynth serves as the implementation of our prior work on deriving abstract synchronization code. Designing concurrent data structures involves inferring correct synchronization code starting with a prior understanding of the sequential data structure’s operations. Further, an understanding of shared memory model and the synchronization primitives is also required. The reasoning involved transforming a sequential data structure into its concurrent version can be performed using Answer Set Programming, and we mechanized our approach in previous work. The reasoning involves deduction and abduction that can be succinctly modeled in ASP. We assume that the abstract sequential code of the data structure’s operations is provided, alongside axioms that describe concurrent behavior. This information is used to automatically derive concurrent code for that data structure, such as dictionary operations for linked lists and binary search trees that involve a constant number of destructive update operations. We also are able to infer the correct set of locks (but not code synthesis) for external height-balanced binary search trees that involve left/right tree rotations. Locksynth performs the analyses required to infer correct sets of locks and as a final step, also derives the C++ synchronization code for the synthesized data structures. We also provide a performance analysis of the C++ code synthesized by Locksynth with the hand-crafted versions available from the Synchrobench microbenchmark suite. To the best of our knowledge, our tool is the first to employ ASP as a backend reasoner to perform concurrent data structure synthesis.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"39 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":"135804826","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
ASPER: Answer Set Programming Enhanced Neural Network Models for Joint Entity-Relation Extraction 联合实体关系抽取的答案集规划增强神经网络模型
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000297
TRUNG HOANG LE, HUIPING CAO, TRAN CAO SON
{"title":"ASPER: Answer Set Programming Enhanced Neural Network Models for Joint Entity-Relation Extraction","authors":"TRUNG HOANG LE, HUIPING CAO, TRAN CAO SON","doi":"10.1017/s1471068423000297","DOIUrl":"https://doi.org/10.1017/s1471068423000297","url":null,"abstract":"Abstract A plethora of approaches have been proposed for joint entity-relation (ER) extraction. Most of these methods largely depend on a large amount of manually annotated training data. However, manual data annotation is time-consuming, labor-intensive, and error-prone. Human beings learn using both data (through induction) and knowledge (through deduction). Answer Set Programming (ASP) has been a widely utilized approach for knowledge representation and reasoning that is elaboration tolerant and adept at reasoning with incomplete information. This paper proposes a new approach, ASP-enhanced Entity-Relation extraction (ASPER), to jointly recognize entities and relations by learning from both data and domain knowledge. In particular, ASPER takes advantage of the factual knowledge (represented as facts in ASP) and derived knowledge (represented as rules in ASP) in the learning process of neural network models. We have conducted experiments on two real datasets and compare our method with three baselines. The results show that our ASPER model consistently outperforms the baselines.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"55 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":"135607905","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
Automatic Differentiation in Prolog Prolog中的自动区分
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000145
TOM SCHRIJVERS, BIRTHE VAN DEN BERG, FABRIZIO RIGUZZI
{"title":"Automatic Differentiation in Prolog","authors":"TOM SCHRIJVERS, BIRTHE VAN DEN BERG, FABRIZIO RIGUZZI","doi":"10.1017/s1471068423000145","DOIUrl":"https://doi.org/10.1017/s1471068423000145","url":null,"abstract":"Abstract Automatic differentiation (AD) is a range of algorithms to compute the numeric value of a function’s (partial) derivative, where the function is typically given as a computer program or abstract syntax tree. AD has become immensely popular as part of many learning algorithms, notably for neural networks. This paper uses Prolog to systematically derive gradient-based forward- and reverse-mode AD variants from a simple executable specification: evaluation of the symbolic derivative. Along the way we demonstrate that several Prolog features (DCGs, co-routines) contribute to the succinct formulation of the algorithm. We also discuss two applications in probabilistic programming that are enabled by our Prolog algorithms. The first is parameter learning for the Sum-Product Loop Language and the second consists of both parameter learning and variational inference for probabilistic logic programming.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"1 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":"135409535","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
Knowledge Authoring for Rules and Actions 规则和操作的知识创作
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000169
YUHENG WANG, PAUL FODOR, MICHAEL KIFER
{"title":"Knowledge Authoring for Rules and Actions","authors":"YUHENG WANG, PAUL FODOR, MICHAEL KIFER","doi":"10.1017/s1471068423000169","DOIUrl":"https://doi.org/10.1017/s1471068423000169","url":null,"abstract":"Abstract Knowledge representation and reasoning (KRR) systems describe and reason with complex concepts and relations in the form of facts and rules. Unfortunately, wide deployment of KRR systems runs into the problem that domain experts have great difficulty constructing correct logical representations of their domain knowledge. Knowledge engineers can help with this construction process, but there is a deficit of such specialists. The earlier Knowledge Authoring Logic Machine (KALM) based on Controlled Natural Language (CNL) was shown to have very high accuracy for authoring facts and questions. More recently, KALM FL , a successor of KALM, replaced CNL with factual English, which is much less restrictive and requires very little training from users. However, KALM FL has limitations in representing certain types of knowledge, such as authoring rules for multi-step reasoning or understanding actions with timestamps. To address these limitations, we propose KALM RA to enable authoring of rules and actions. Our evaluation using the UTI guidelines benchmark shows that KALM RA achieves a high level of correctness (100%) on rule authoring. When used for authoring and reasoning with actions, KALM RA achieves more than 99.3% correctness on the bAbI benchmark, demonstrating its effectiveness in more sophisticated KRR jobs. Finally, we illustrate the logical reasoning capabilities of KALM RA by drawing attention to the problems faced by the recently made famous AI, ChatGPT.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"65 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":"135453900","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
“What if?” in Probabilistic Logic Programming “如果什么?在概率逻辑规划中
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000133
RAFAEL KIESEL, KILIAN RÜCKSCHLOß, FELIX WEITKÄMPER
{"title":"“What if?” in Probabilistic Logic Programming","authors":"RAFAEL KIESEL, KILIAN RÜCKSCHLOß, FELIX WEITKÄMPER","doi":"10.1017/s1471068423000133","DOIUrl":"https://doi.org/10.1017/s1471068423000133","url":null,"abstract":"Abstract A ProbLog program is a logic program with facts that only hold with a specified probability. In this contribution, we extend this ProbLog language by the ability to answer “What if” queries. Intuitively, a ProbLog program defines a distribution by solving a system of equations in terms of mutually independent predefined Boolean random variables. In the theory of causality, Judea Pearl proposes a counterfactual reasoning for such systems of equations. Based on Pearl’s calculus, we provide a procedure for processing these counterfactual queries on ProbLog programs, together with a proof of correctness and a full implementation. Using the latter, we provide insights into the influence of different parameters on the scalability of inference. Finally, we also show that our approach is consistent with CP-logic, that is with the causal semantics for logic programs with annotated with disjunctions.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"3 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":"135509452","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
Neuro-Symbolic AI for Compliance Checking of Electrical Control Panels 电气控制面板符合性检查的神经符号人工智能
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000170
VITO BARBARA, NICOLA LEONE, FRANCESCO RICCA, MASSIMO GUARASCIO, GIUSEPPE MANCO, ALESSANDRO QUARTA, ETTORE RITACCO
{"title":"Neuro-Symbolic AI for Compliance Checking of Electrical Control Panels","authors":"VITO BARBARA, NICOLA LEONE, FRANCESCO RICCA, MASSIMO GUARASCIO, GIUSEPPE MANCO, ALESSANDRO QUARTA, ETTORE RITACCO","doi":"10.1017/s1471068423000170","DOIUrl":"https://doi.org/10.1017/s1471068423000170","url":null,"abstract":"Abstract Artificial Intelligence plays a main role in supporting and improving smart manufacturing and Industry 4.0, by enabling the automation of different types of tasks manually performed by domain experts. In particular, assessing the compliance of a product with the relative schematic is a time-consuming and prone-to-error process. In this paper, we address this problem in a specific industrial scenario. In particular, we define a Neuro-Symbolic approach for automating the compliance verification of the electrical control panels. Our approach is based on the combination of Deep Learning techniques with Answer Set Programming (ASP), and allows for identifying possible anomalies and errors in the final product even when a very limited amount of training data is available. The experiments conducted on a real test case provided by an Italian Company operating in electrical control panel production demonstrate the effectiveness of the proposed approach.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"154 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":"135452752","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
Implementing Backjumping by Means of Exception Handling 通过异常处理实现回跳
2区 数学
Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI: 10.1017/s1471068423000285
WŁODZIMIERZ DRABENT
{"title":"Implementing Backjumping by Means of Exception Handling","authors":"WŁODZIMIERZ DRABENT","doi":"10.1017/s1471068423000285","DOIUrl":"https://doi.org/10.1017/s1471068423000285","url":null,"abstract":"Abstract We discuss how to implement backjumping (or intelligent backtracking) in Prolog by using the built-ins throw/1 and catch/3. We show that it is impossible in a general case, contrary to a claim that “backjumping is exception handling.\" We provide two solutions. One works for binary programs; in a general case it imposes a restriction on where backjumping may originate. The other restricts the class of backjump targets. We also discuss implementing backjumping by using backtracking and the Prolog database. Additionally, we explain the semantics of Prolog exception handling in the presence of coroutining.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"19 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":"135763100","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
首页 上一页 下一页 尾页
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学术官方微信