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

A Survey of the Proof-Theoretic Foundations of Logic Programming 逻辑规划的证明理论基础综述

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-09-03 DOI: 10.1017/s1471068421000533

D. Miller

{"title":"A Survey of the Proof-Theoretic Foundations of Logic Programming","authors":"D. Miller","doi":"10.1017/s1471068421000533","DOIUrl":"https://doi.org/10.1017/s1471068421000533","url":null,"abstract":"\u0000 Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this article, we will survey the use of structural proof theory as an alternative foundation. Researchers have been using this foundation for the past 35 years to elevate logic programming from its roots in first-order classical logic into higher-order versions of intuitionistic and linear logic. These more expressive logic programming languages allow for capturing stateful computations and rich forms of abstractions, including higher-order programming, modularity, and abstract data types. Term-level bindings are another kind of abstraction, and these are given an elegant and direct treatment within both proof theory and these extended logic programming languages. Logic programming has also inspired new results in proof theory, such as those involving polarity and focused proofs. These recent results provide a high-level means for presenting the differences between forward-chaining and backward-chaining style inferences. Anchoring logic programming in proof theory has also helped identify its connections and differences with functional programming, deductive databases, and model checking.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"62 1","pages":"859-904"},"PeriodicalIF":1.4,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86064928","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

Introduction to the 37th International Conference on Logic Programming Special Issue I 第37届逻辑程序设计国际会议导论第一期

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-09-01 DOI: 10.1017/S1471068421000442

A. Brik, A. Formisano, Yanhong A. Liu, Joost Vennekens

引用次数: 0

Thirty years of Epistemic Specifications 三十年的认知规范

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-08-17 DOI: 10.1017/s147106842100048x

Jorge Fandinno, Wolfgang Faber, M. Gelfond

引用次数: 4

Planning with Incomplete Information in Quantified Answer Set Programming 定量答案集规划中不完全信息的规划

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-08-13 DOI: 10.1017/S1471068421000259

Jorge Fandinno, Franccois Laferriere, J. Romero, Torsten Schaub, Tran Cao Son New Mexico State University, Usa, Omaha State University, U. Potsdam, H Germany

引用次数: 6

Temporal Minimal-World Query Answering over Sparse ABoxes 稀疏框上的时间最小世界查询应答

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-08-11 DOI: 10.1017/s1471068421000119

Stefan Borgwardt, Walter Forkel, Alisa Kovtunova

{"title":"Temporal Minimal-World Query Answering over Sparse ABoxes","authors":"Stefan Borgwardt, Walter Forkel, Alisa Kovtunova","doi":"10.1017/s1471068421000119","DOIUrl":"https://doi.org/10.1017/s1471068421000119","url":null,"abstract":"Ontology-mediated query answering is a popular paradigm for enriching answers to user queries with background knowledge. For querying the absence of information, however, there exist only few ontology-based approaches. Moreover, these proposals conflate the closed-domain and closed-world assumption and, therefore, are not suited to deal with the anonymous objects that are common in ontological reasoning. Many real-world applications, like processing electronic health records, also contain a temporal dimension and require efficient reasoning algorithms. Moreover, since medical data are not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. Our contribution consists of two main parts: In the first part, we introduce a new closed-world semantics for answering conjunctive queries (CQs) with negation over ontologies formulated in the description logic $${mathcal E}{mathcal L}{{mathcal H}_ bot }$$ , which is based on the minimal canonical model. We propose a rewriting strategy for dealing with negated query atoms, which shows that query answering is possible in polynomial time in data complexity. In the second part, we extend this minimal-world semantics for answering metric temporal CQs with negation over the lightweight temporal logic and obtain similar rewritability and complexity results.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"3 1","pages":"193-228"},"PeriodicalIF":1.4,"publicationDate":"2021-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86639784","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

Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming 用答案集和认识逻辑程序确定STRIPS中的动作可逆性

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-08-11 DOI: 10.1017/S1471068421000429

L. Chrpa, Wolfgang Faber, Daniel Fiser, Michael Morak

引用次数: 1

Refactoring the Whitby Intelligent Tutoring System for Clean Architecture 面向Clean架构的Whitby智能辅导系统重构

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-08-10 DOI: 10.1017/s1471068421000326

Paul S. Brown, V. Dimitrova, G. Hart, A. Cohn, P. Moura

{"title":"Refactoring the Whitby Intelligent Tutoring System for Clean Architecture","authors":"Paul S. Brown, V. Dimitrova, G. Hart, A. Cohn, P. Moura","doi":"10.1017/s1471068421000326","DOIUrl":"https://doi.org/10.1017/s1471068421000326","url":null,"abstract":"\u0000 Whitby is the server-side of an Intelligent Tutoring System application for learning System-Theoretic Process Analysis (STPA), a methodology used to ensure the safety of anything that can be represented with a systems model. The underlying logic driving the reasoning behind Whitby is Situation Calculus, which is a many-sorted logic with situation, action, and object sorts. The Situation Calculus is applied to Ontology Authoring and Contingent Scaffolding: the primary activities within Whitby. Thus many fluents and actions are aggregated in Whitby from these two sub-applications and from Whitby itself, but all are available through a common situation query interface that does not depend upon any of the fluents or actions. Each STPA project in Whitby is a single situation term, which is queried for fluents that include the ontology, and to determine what pedagogical interventions to offer. Initially Whitby was written in Prolog using a module system. In the interest of a cleaner architecture and implementation with improved code reuse and extensibility, the initial application was refactored into Logtalk. This refactoring includes decoupling the Situation Calculus reasoner, Ontology Authoring framework, and Contingent Scaffolding framework into third-party libraries that can be reused in other applications. This extraction was achieved by inverting dependencies via Logtalk protocols and categories, which are reusable interfaces and components that provide functionally cohesive sets of predicate declarations and predicate definitions. In this paper the architectures of two iterations of Whitby are evaluated with respect to the motivations behind the refactor: clean architecture enabling code reuse and extensibility.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"21 1","pages":"818-834"},"PeriodicalIF":1.4,"publicationDate":"2021-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88912907","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

Modal Logic S5 Satisfiability in Answer Set Programming 回答集程序设计中的模态逻辑S5的可满足性

IF 1.4 2区数学

Theory and Practice of Logic Programming Pub Date : 2021-08-09 DOI: 10.1017/S1471068421000247

Mario Alviano, Sotiris Batsakis, George Baryannis

{"title":"Modal Logic S5 Satisfiability in Answer Set Programming","authors":"Mario Alviano, Sotiris Batsakis, George Baryannis","doi":"10.1017/S1471068421000247","DOIUrl":"https://doi.org/10.1017/S1471068421000247","url":null,"abstract":"Abstract Modal logic S5 has attracted significant attention and has led to several practical applications, owing to its simplified approach to dealing with nesting modal operators. Efficient implementations for evaluating satisfiability of S5 formulas commonly rely on Skolemisation to convert them into propositional logic formulas, essentially by introducing copies of propositional atoms for each set of interpretations (possible worlds). This approach is simple, but often results into large formulas that are too difficult to process, and therefore more parsimonious constructions are required. In this work, we propose to use Answer Set Programming for implementing such constructions, and in particular for identifying the propositional atoms that are relevant in every world by means of a reachability relation. The proposed encodings are designed to take advantage of other properties such as entailment relations of subformulas rooted by modal operators. An empirical assessment of the proposed encodings shows that the reachability relation is very effective and leads to comparable performance to a state-of-the-art S5 solver based on SAT, while entailment relations are possibly too expensive to reason about and may result in overhead.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"21 1","pages":"527 - 542"},"PeriodicalIF":1.4,"publicationDate":"2021-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49488199","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

Planning for an Efficient Implementation of Hypothetical Bousi∼Prolog 有效实施假设Bousi ~ Prolog的规划

IF 1.4 2区数学

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

Pascual Julián-Iranzo, F. Sáenz-Pérez

引用次数: 1

A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction 具有有序位错的逻辑程序优选模型的一个逻辑表征

IF 1.4 2区数学

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

A. Charalambidis, P. Rondogiannis, Antonis Troumpoukis

{"title":"A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction","authors":"A. Charalambidis, P. Rondogiannis, Antonis Troumpoukis","doi":"10.1017/S1471068421000235","DOIUrl":"https://doi.org/10.1017/S1471068421000235","url":null,"abstract":"Abstract Logic programs with ordered disjunction (LPODs) extend classical logic programs with the capability of expressing alternatives with decreasing degrees of preference in the heads of program rules. Despite the fact that the operational meaning of ordered disjunction is clear, there exists an important open issue regarding its semantics. In particular, there does not exist a purely model-theoretic approach for determining the most preferred models of an LPOD. At present, the selection of the most preferred models is performed using a technique that is not based exclusively on the models of the program and in certain cases produces counterintuitive results. We provide a novel, model-theoretic semantics for LPODs, which uses an additional truth value in order to identify the most preferred models of a program. We demonstrate that the proposed approach overcomes the shortcomings of the traditional semantics of LPODs. Moreover, the new approach can be used to define the semantics of a natural class of logic programs that can have both ordered and classical disjunctions in the heads of clauses. This allows programs that can express not only strict levels of preferences but also alternatives that are equally preferred.","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"21 1","pages":"629 - 645"},"PeriodicalIF":1.4,"publicationDate":"2021-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46828846","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