A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Computing stable semantics of AF by 0–1 integer programming
2015
2015 International Conference on Electronics, Communications and Computers (CONIELECOMP)
Preserved Fulltext
We present a novel method, to the best of our knowledge, for computing semi-stable semantics using 0-1 integer programming, and also experimentally compare it with an answer set programming approach. ...
One research branch in abstract argumentation has focused on finding new methods for computing its different semantics. ...
Computing SS Semantics by 0-1 Integer Programming In this section we show: the 0-1 integer programming formulation for the SS semantics problem, its encoding in FICO Xpress Mosel 1 language and also explain ...
doi:10.1109/conielecomp.2015.7086953
dblp:conf/conielecomp/OsorioDS15
fatcat:fu6dghifwnfvfgqannnowuwnpe
Preferred Extensions as Minimal Models of Clark's Completion Semantics
2013
Research in Computing Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Additionally, we make use of integer programming for computing preferred extensions by a method defined by Bell et al. [3], which translates a logic program into an integer program which in turn can be ...
Dung established the connections between several logic programming semantics and various argumentation framework semantics. ...
By considering total interpretations, as the ones suggested by logic programming semantics as stable model semantics [10] , we can assume that any argument which is not defeated in a model of Π AF will ...
doi:10.13053/rcs-68-1-5
fatcat:6d6f5ie4jrd2pgyodbmdqjp2rm
Complete Extensions as Clark's Completion Semantics
2013
2013 Mexican International Conference on Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
us to identify the possibility of computing argumentation frameworks based on integer programming. ...
The Complete Semantics is a fundamental argumentation semantics which identifies a set of admissible sets which contains the grounded, stable, preferred and ideal semantics. ...
Indeed we are comparing mixed integer programming methods and answer set solvers for computing argumentation semantics. ...
doi:10.1109/enc.2013.18
dblp:conf/enc/OsorioNS13
fatcat:tsg5ut4kynecdnt5i45ys3pv4u
Synthesizing Argumentation Frameworks from Examples
2019
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Indeed, from the perspective of AI and computer science, understanding computational and representational aspects of AFs is key in the study of argumentation. ...
Realizability of AFs has been recently proposed as a central notion for analyzing the expressive power of AFs under different semantics. ...
ACKNOWLEDGEMENTS Work funded by Academy of Finland, grants 251170 COIN, 276412, and 284591; and Research Funds of the University of Helsinki. ...
doi:10.1613/jair.1.11758
fatcat:34evu6suuzfezm6qixobyk5rzi
Theorem proving support in programming language semantics
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. ...
Extraction of an interpreter from the denotational semantics is also described. All different aspects are formally proved sound with respect to the natural semantics specification. ...
An example of use in proof by reflection We consider the program that adds the n first positive integers. ...
arXiv:0707.0926v2
fatcat:mtcz3ffiuzfpbb7iqvislxdw7a
An Implementation, Empirical Evaluation and Proposed Improvement for Bidirectional Splitting Method for Argumentation Framework Under Stable Semantics
2018
Figshare
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Experimental data suggest that using a minimum cut will not improve the performance of computing stable semantics in most cases. ...
Splitting an argumentation framework can efficiently speed up the computation of argumentation semantics. ...
ACKNOWLEDGEMENTS Part of the work for the present paper was conducted at Leipzig University, Germany and most of the work at Nanjing University, China. ...
doi:10.6084/m9.figshare.6974090.v1
fatcat:sp7znujo5ncr7eavicf2i7m5vi
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation
2016
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We provide a nearly complete computational complexity map of fixed-argument extension enforcement under various major AF semantics, with results ranging from polynomial-time algorithms to completeness ...
Understanding the dynamics of argumentation frameworks (AFs) is important in the study of argumentation in AI. ...
For nonstrict enforcement under stable semantics, our encoding is essentially the same as the integer programming formulation presented by Coste-Marquis et al. (2015) . ...
doi:10.1609/aaai.v30i1.10101
fatcat:chwtrbjljvh5vafxjivc6r7dfe
Encoding Argumentation Semantics by Boolean Algebra
2017
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Then, we show that these models can be easily translated into logic programs, and can be solved by a constraint solver over Boolean variables. ...
In addition, we propose some querying strategies to accelerate the calculation of the grounded, stable and complete extensions. ...
The research reported here was supported by the Fund NSFC61572279. ...
doi:10.1587/transinf.2016edp7313
fatcat:amco5kkczvhlfhdyotkaelgdc4
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
1995
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
By showing that argumentation can be viewed as a special form of logic programming with negation as failure, we introduce a general logic programming-based method for generating metainterpreters for argumentation ...
This argument is based on a result showing that our theory captures naturally the solutions of the theory of n-person games and of the well-known stable marriage problem. ...
,s kn (0),x)} have the form {x/s k (0)} and for all nonnegative integers k1,..,kn, we have f(k1,..,kn)=k iff {x/s k (0)} is the computed answer for P ∪ {← p f (s k1 (0),..,s kn (0),x)}. ...
doi:10.1016/0004-3702(94)00041-x
fatcat:fagvcqzmurbh3jjm5zqhintsbq
An Implementation, Empirical Evaluation and Proposed Improvement for Bidirectional Splitting Method for Argumentation Framework Under Stable Semantics
2018
International Journal of Artificial Intelligence & Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Experimental data suggest that using a minimum cut will not improve the performance of computing stable semantics in most cases. ...
Splitting an argumentation framework can efficiently speed up the computation of argumentation semantics. ...
ACKNOWLEDGEMENTS Part of the work for the present paper was conducted at Leipzig University, Germany and most of the work at Nanjing University, China. ...
doi:10.5121/ijaia.2018.9402
fatcat:agrsql23bfhhzi4ft2fwhr4y6u
Syntactic transformation rules under P-Stable semantics: theory and implementation
2009
Inteligencia Artificial
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of a normal logic program, a integer n representing the number of P-Stable models to compute output: A list of P-Stable models program ← invokeAndCreateInput(f ileN ame); if simplification is enabled ...
By Lemma 3.22, M 1 is a minimal model of RED(N AF (P ), M 1 ), to conclude the proof, let assume by contradiction that RED(N AF (P ), M 1 ) C M 1 , this implies the existence of a minimal model M 2 of ...
We remark by the way that constraints can be encoded including in the program the following clauses [21] c ← a 1 , . . . , a m , not a m+1 , . . . , not a m+n . x ← not y, c. where c, x, y, z are fresh ...
doi:10.4114/ia.v13i41.1028
fatcat:2p7jhuw57ndbzmup7rkllsqvyq
Complexity-sensitive decision procedures for abstract argumentation
2014
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Establishing the theoretical foundations of this approach, we derive several new complexity results for preferred, semi-stable and stage semantics which complement the current complexity landscape for ...
abstract argumentation, providing further understanding on the sources of intractability of AF reasoning problems. ...
Acknowledgments This work has been funded by Vienna Science and Technology Fund (WWTF) through project ICT08-028, by the Austrian Science Fund (FWF) through projects ...
doi:10.1016/j.artint.2013.10.001
fatcat:jlc67qtkvbaixfihkgryslxt5e
System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15)
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
of computational approaches to abstract argumentation problems. ...
This volume contains the system description of the 18 solvers submitted to the First International Competition on Computational Models of Argumentation (ICCMA'15) and therefore gives an overview on state-of-the-art ...
If we have a node ai with multiple parents (in the Ar-
gumentation graph) af 1 , af 2 , . . . , af k , we need to add a constraint ¬(ai =
0 ∧ af 1 = 0 ∧ · · · ∧ af k = 0). ...
arXiv:1510.05373v1
fatcat:ll33crzcwfenll4v7yf4xae7ya
Stage semantics and the SCC-recursive schema for argumentation semantics
2014
Journal of Logic and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Besides the analysis of stage2 semantics we also complement existing complexity results for cf2 by an analysis of tractable fragments and fixed parameter tractability. ...
Recently, stage and cf2 semantics for abstract argumentation attracted specific attention. By distancing from the notion of defense, they are capable to select arguments out of odd-length cycles. ...
Acknowledgments Earlier versions of parts of this paper have been presented at the 14th International Workshop on Non-Monotonic Reasoning (NMR'12) [29] and the Fourth International Conference on Computational ...
doi:10.1093/logcom/exu006
fatcat:6c7egvjidfetrjppeza4v2wcje
On Reductive Semantics of Aggregates in Answer Set Programming
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We also present a generalization of semantics of aggregates without involving grounding, and define loop formulas for programs with aggregates guided by the reductive approach. ...
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. ...
This work was partially supported by the National Science Foundation under Grant IIS-0839821. ...
doi:10.1007/978-3-642-04238-6_17
fatcat:ix52ghn775c6jduedkpe6oxw4m
« Previous
Showing results 1 — 15 out of 1,003 results