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

On the equivalence between logic programming semantics and argumentation semantics

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING 2015年 58卷 87-111页

作者： Caminada, Martin Sa, Samy Alcantara, Joao Dvorak, Wolfgang Univ Aberdeen Aberdeen AB9 1FX Scotland Univ Fed Ceara Fortaleza Ceara Brazil Univ Vienna Fac Comp Sci A-1010 Vienna Austria

In the current paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We observe that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) is able to serve as a basis for describing various equivalences between logic programming semantics and argumentation semantics. In particular, we are able to show equivalence between regular semantics for logic programming and preferred semantics for formal argumentation. We also show that there exist logic programming semantics (L-stable semantics) that cannot be captured by any abstract argumentation semantics. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Abstract argumentation semantics logic programming semantics

来源：评论

学校读者我要写书评

暂无评论

A game semantics for disjunctive logic programming

引用

ANNALS OF PURE AND APPLIED logic 2013年第11期164卷 1144-1175页

作者： Tsouanas, Thanos Univ Lyon Ecole Normale Super Lyon Lab Informat Parallelisme LIP UMR CNRS ENS Lyon UCBL INRIA 5668 F-69364 Lyon 07 France

Denotational semantics of logic programming and its extensions (by allowing negation, disjunctions, or both) have been studied thoroughly for many years. In 1998, a game semantics was given to definite logic programs by Di Cosmo, Loddo, and Nicolet, and a few years later it was extended to deal with negation by Rondogiannis and Wadge. Both approaches were proven equivalent to the traditional semantics. In this paper we define a game semantics for disjunctive logic programs and prove soundness and completeness with respect to the minimal model semantics of Minker. The overall development has been influenced by the games studied for PCF and functional programming in general, in the styles of Abramsky-Jagadeesan-Malacaria and Hyland-Ong-Nickau. (C) 2013 Elsevier B.V. All rights reserved.

关键词： logic programming Disjunctive logic programming Game semantics logic programming semantics

来源：评论

学校读者我要写书评

暂无评论

On the Equivalence between logic programming and SETAF

引用

THEORY AND PRACTICE OF logic programming 2024年第6期24卷 1208-1236页

作者： Alcantara, Joao Cordeiro, Renan Sa, Samy Univ Fed Ceara Fortaleza Brazil

A framework with sets of attacking arguments ( SETAF ) is an extension of the well-known Dung's Abstract Argumentation Frameworks (AAFs) that allows joint attacks on arguments. In this paper, we provide a translation from Normal logic Programs (NLPs) to SETAFs and vice versa, from SETAFs to NLP s. We show that there is pairwise equivalence between their semantics, including the equivalence between L-stable and semi-stable semantics. Furthermore, for a class of NLPs called Redundancy-Free Atomic logic Programs (RFALPs), there is also a structural equivalence as these back-and-forth translations are each other's inverse. Then, we show that RFALPs are as expressive as NLPs by transforming any NLP into an equivalent RFALP through a series of program transformations already known in the literature. We also show that these program transformations are confluent, meaning that every NLP will be transformed into a unique RFALP. The results presented in this paper enhance our understanding that NLPs and SETAFs are essentially the same formalism.

关键词： argumentation logic programming semantics program transformations

来源：评论

学校读者我要写书评

暂无评论

Range-based argumentation semantics as two-valued models

引用

THEORY AND PRACTICE OF logic programming 2017年第1期17卷 75-90页

作者： Osorio, Mauricio Nieves, Juan Carlos Univ Americas Puebla Dept Actuaria Fis & Matemat Cholula 72820 Mexico Umea Univ Dept Comp Sci SE-90187 Umea Sweden

Characterizations of semi-stable and stage extensions in terms of two-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming counterparts of the notion of range which is an established concept in argumentation semantics.

关键词： logic programming semantics argumentation semantics non-monotonic reasoning

来源：评论

学校读者我要写书评

暂无评论

Abducible semantics and Argumentation

引用

FUNDAMENTA INFORMATICAE 2017年第3期155卷 293-319页

作者： Osorio, Mauricio Luis Carballido, Jose Zepeda, Claudia Univ Americas Puebla Cholula Mexico Benemerita Univ Atonoma Puebla Fac Ciencias Computac Puebla Mexico

We extend further the relationship that exists between logic programming semantics and some of the semantics of extensions defined on argumentation frameworks. We define a new logic programming semantics based on the addition of abducible atoms to those normal logic programs that do not have stable models, and consider the argumentation extensions that result from it when using a well-known translation mapping between argumentation frameworks and normal programs. We call this programming semantics the stable m-ab-m logic programming semantics. This semantics defines a new type of semantics of extensions on argumentation frameworks that is not comparable to the semi-stable argumentation semantics, yet both argumentation semantics share several properties, since they both generalize the stable semantics of extensions. We also define a semantics for normal logic programs based on minimal classical two-valued models and the Gelfond-Lifschitz reduct. This semantics corresponds to the semi-stable extensions in argumentation frameworks according to the mapping mentioned before;this way we obtain a general version of a semi-stable semantics for normal logic programs. Each of these new semantics has the property of being non-empty for any normal logic program or argumentation framework, and each of them agrees with the respective stable semantics in the case where the stable semantics is a non-empty set.

关键词： Argumentation framework argumentation semantics logic programming semantics

来源：评论

学校读者我要写书评

暂无评论

A logic programming SYSTEM FOR NONMONOTONIC REASONING

引用

JOURNAL OF AUTOMATED REASONING 1995年第1期14卷 93-147页

作者： ALFERES, JJ DAMASIO, CV PEREIRA, LM UNIV EVORA DMAT P-7000 EVORA PORTUGAL UNIV NOVA LISBOA CRIA P-2825 MONTE DE CAPARICA PORTUGAL UNIV NOVA LISBOA DCS P-2825 MONTE DE CAPARICA PORTUGAL

The evolution of logic programming semantics has included the introduction of a new explicit form of negation, beside the older implicit (or default) negation typical of logic programming. The richer language has been shown adequate for a spate of knowledge representation and reasoning forms. The widespread use of such extended programs requires the definition of a correct top-down querying mechanism, much as for Prolog wrt. normal pro,srams. One purpose of this paper is to present and exploit a SLDNF-like derivation procedure, SLX, for programs with explicit negation under well-founded semantics (WFSX) and prove its soundness and completeness. (Its soundness wrt. the answer-sets semantics is also shown.) Our choice of WFSX as the base semantics is justified by the structural properties it enjoys, which are paramount for top-down query evaluation. Of course, introducing explicit negation requires dealing with contradiction. Consequently, we allow for contradiction to appear, and show moreover how it can be removed by freely changing the truth-values of some subset of a set of predefined revisable literals. To achieve this, we introduce a paraconsistent version of WFSX, WFSX,, that allows contradictions and for which our SLX top-down procedure is proven correct as well. This procedure can be used to detect the existence of pairs of complementary literals in WESX(p) simply by detecting the violation of integrity rules f double left arrow L, inverted right perpendicular L introduced for each L in the language of the program. Furthermore, integrity constraints of a more general form are allowed, whose violation can likewise be detected by SLX. Removal of contradiction or integrity violation is accomplished by a variant of the SLX procedure that collects, in a formula, the alternative combinations of revisable literals' truth-values that ensure the said removal. The formulas, after simplification, can then be satisfied by a number of truth-values changes in the revisable

关键词： logic programming PROCEDURES logic programming semantics NONMONOTONIC REASONING BELIEF REVISION WELL-FOUNDED semantics

来源：评论

学校读者我要写书评

暂无评论

Defining Stage Argumentation semantics in Terms of an Abducible semantics

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2016年 328卷 59-71页

作者： Osorio, Mauricio Luis Carballido, Jose Zepeda, Claudia Univ Americas Puebla Cholula Mexico Benemerita Univ Autonoma Puebla Puebla Mexico

We define a new logic programming semantics in terms of abducible atoms. We use it to characterize the stage extensions of an argumentation framework AF by means of an associated normal program PAF. We also define the... 详细信息

关键词： Argumentation semantics stage argumentation semantics logic programming semantics

来源：评论

学校读者我要写书评

暂无评论

Expressing p-stable semantics based on stable semantics

Expressing p-stable semantics based on stable semantics

引用

20th International Conference on Electronics, Communications and Computers

作者： Osorio, Mauricio Luis Carballido, Jose Zepeda, Claudia Uni Amer Puebla Mexico Benemerita Univ Autonoma Puebla Puebla Mexico

We study one of the semantics that is useful to formalize NMR, called the p-stable semantics. We explore the relation between the p-stable and the stable semantics. We give a condition under which the two semantics ag... 详细信息

ISBN: (纸本)9781424453535

关键词： logic programming semantics stable semantics p-stable semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：