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.
Filters
Efficient Computation of Extensions for Dynamic Abstract Argumentation Frameworks: An Incremental Approach
2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Preserved Fulltext
In this paper, we tackle the problem of incrementally computing extensions for dynamic AFs: given an initial extension and an update (or a set of updates), we devise a technique for computing an extension ...
argumentation frameworks (AFs) are a well-known formalism for modelling and deciding many argumentation problems. ...
grounded) and propose a general approach for incrementally solving the following computational task: Given an AF A 0 , an extension for A 0 under semantics S, and an update u, determine an extension of ...
doi:10.24963/ijcai.2017/8
dblp:conf/ijcai/AlfanoGP17
fatcat:6xr2fsgrxnfspnob667xupzgle
Incremental and Modular Context-sensitive Analysis
[article]
2020
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 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1804.01839v3 fatcat:e4hc6bqiq5dnpbgjdls5hiydliOther Versions
This paper describes, implements, and evaluates an algorithm that performs efficient context-sensitive analysis incrementally on modular partitions of programs. ...
This has been achieved to date through incremental global analysis fixpoint algorithms that achieve cost reductions at fine levels of granularity, such as changes in program lines. ...
Incremental algorithms compute an updated output from a previous output and a difference on the input data, which the hope that the process is (computationally) cheaper than computing from scratch a new ...
arXiv:1804.01839v5
fatcat:dedzgwfxdzgznczgtfuq72r4s4
An Incremental Approach to Abstraction-Carrying Code
[chapter]
2006
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.
Abstraction-Carrying Code (ACC) has recently been proposed as a framework for proof-carrying code (PCC) in which the code supplier provides a program together with an abstraction (or abstract model of ...
In the context of ACC, we propose an incremental approach to PCC for the generation of certificates and the checking of untrusted updates of a (trusted) program, i.e., when a producer provides a modified ...
During analysis, dependencies are used for achieving efficient implementations of fixed-point re-computations. ...
doi:10.1007/11916277_26
fatcat:mro5f3iezffbhei3nellc22ebe
On the Incremental Computation of Argumentation Frameworks
2018
Sistemi Evoluti per Basi di Dati
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 introduce an incremental approach that, given an initial argumentation framework, an initial extension for it, and an update, computes an extension of the updated framework. ...
We tackle the problem of efficiently recomputing extensions of dynamic Argumentation Frameworks (AFs) under well-known semantics, namely frameworks able to model human ability to argue. ...
We first proposed a technique for incrementally computing extensions of dynamic abstract argumentation frameworks (AFs): given an initial extension and a set of updates, our algorithm computes an extension ...
dblp:conf/sebd/X18
fatcat:3dajah4xobevvcoqups5qshzpu
A meta-argumentation approach for the efficient computation of stable and preferred extensions in dynamic bipolar argumentation frameworks
2019
Intelligenza Artificiale
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.
In particular, focusing on a deductive interpretation of support, we introduce an incremental algorithm that, given an initial BAF, an initial extension for it, and an update, computes an extension of ...
In this paper we tackle the problem of efficiently recomputing sets of accepted arguments of dynamic BAFs (under the preferred and stable semantics). ...
an extension of an updated BAF to that of determining an extension of a corresponding updated Dung's argumentation framework. 3) We define an incremental algorithm for computing extensions of dynamic ...
doi:10.3233/ia-180002
fatcat:s5n5czaqrff7ndgrxlhbsyefd4
An Efficient Algorithm for Skeptical Preferred Acceptance in Dynamic Argumentation Frameworks
2019
Proceedings of the Twenty-Eighth International Joint Conference on 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 2022; you can also visit the original URL.
The file type is application/pdf.
Though there has been an extensive body of work on efficiently solving computational problems for static Dung's argumentation frameworks (AFs), little work has been done for handling dynamic AFs and in ...
In this paper we devise an efficient algorithm for computing the skeptical preferred acceptance in dynamic AFs. ...
To the best our knowledge, this is the first paper proposing an efficient technique for the incremental computation of skeptical acceptance in dynamic AFs. ...
doi:10.24963/ijcai.2019/3
dblp:conf/ijcai/AlfanoGP19
fatcat:zpnxaoktvjcwhnoqlrls4xuho4
The Matrix Approach for Abstract Argumentation Frameworks
[chapter]
2015
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 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, an efficient approach for determining the basic extensions has been developed using two types of standard matrix. ...
The second one enables to decompose an extension into several extensions of different sub-argumentation frameworks. ...
The matrix approach can be used for other applications. One direction for further research is to study the structural properties and status-based properties of dynamics of AFs as defined by [10] . ...
doi:10.1007/978-3-319-28460-6_15
fatcat:propladvcbeevaw4yx2iexksje
Initial sets in abstract argumentation frameworks
2018
Journal of Applied Non-Classical Logics
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.
Another one is directionality which can be employed for the study of dynamics of argumentation. ...
Dung's abstract argumentation provides us with a general framework to deal with argumentation, non-monotonic reasoning and logic programming. ...
Several works have proposed efficient ways for handling dynamics, such as [Lia11] which introduces the divisionbased method, and [Xu15] where a matrix approach allows for a decomposition of traditional ...
doi:10.1080/11663081.2018.1457252
fatcat:gqbxha6z75hsxjllploqvzozwm
Senses of 'argument' in instantiated argumentation frameworks
2015
Argument & 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 2017; you can also visit the original URL.
The file type is application/pdf.
Our framework retains the theoretical and computational benefits of an abstract AF, distinguishes senses of argument, and efficiently computes extensions. ...
As a consequence of the approach, we reduce the effort of computing argumentation extensions, which is in contrast to other approaches. ...
Conflict of interest disclosure statement No potential conflict of interest was reported by the authors. Note 1. ...
doi:10.1080/19462166.2014.1002535
fatcat:wsp627j25jbmtdz53fdoki3ufy
A distributed parallel programming framework
2002
IEEE Transactions on Software Engineering
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.
AbstractÐThis paper presents Visper, a novel object-oriented framework that identifies and enhances common services and programming primitives, and implements a generic set of classes applicable to multiple ...
As a use case, Visper integrates parallel programming in an MPI-like messagepassing paradigm at a high level with services such as checkpointing and fault tolerance at a lower level. ...
ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their insightful and constructive comments that have helped them to improve the final presentation of the paper. ...
doi:10.1109/tse.2002.1000451
fatcat:acw7bcyu4zd5jffq7rsfw4dmr4
MAFRA — A MApping FRAmework for Distributed Ontologies
[chapter]
2002
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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present MAFRA, an interactive, incremental and dynamic framework for mapping distributed ontologies in the Semantic Web. ...
However, the decentralized nature of the Web makes achieving this consensus across communities difficult, thus, hampering efficient knowledge sharing between them. ...
In this paper we presented the Ontology Mapping Framework (MAFRA) supporting the interactive, incremental and dynamic ontology mapping process in the context of the Semantic Web. ...
doi:10.1007/3-540-45810-7_23
fatcat:ve2lmov77vbzxaueduvsl6af74
Framework design for end-to-end optimization
[chapter]
1998
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 2006; you can also visit the original URL.
The file type is application/pdf.
Their application is illustrated for two complex frameworks: a virtual memory framework and a framework for distributed objects. ...
A catalog of patterns that covers common optimizations is also presented. ...
We gratefully acknowledge help from Fabio Kon and Amitabh Dave (UIUC), John Heintz (Icon Computing), and Sharad Singhai (UMass) for their comments, and thank Monika Chandak (UIUC) for support and for loaning ...
doi:10.1007/bfb0054090
fatcat:ttc4jkvzwjhyrhg55wk6haof5m
The Backstroke framework for source level reverse computation applied to parallel discrete event simulation
2011
Proceedings of the 2011 Winter Simulation Conference (WSC)
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 2015; you can also visit the original URL.
The file type is application/pdf.
We introduce Backstroke, a new open source framework for the automatic generation of reverse code for functions written in C++. ...
Backstroke enables reverse computation for optimistic parallel discrete event simulations. ...
The primary purpose of Backstroke is to enable reverse computation for fast, efficient rollback in optimistic parallel discrete event simulations. ...
doi:10.1109/wsc.2011.6147998
dblp:conf/wsc/VulovHVFQJ11
fatcat:nx4e3lrl6nhljpvivvsggwtcri
A nonlinear model predictive control framework using reference generic terminal ingredients
[article]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For such systems, we provide a reference generic offline procedure to compute an incrementally stabilizing feedback with a continuously parameterized quadratic quasi infinite horizon terminal cost. ...
The practicality of this approach is demonstrated with a benchmark example. ...
This result is an extension of [11] , [1] to arbitrary dynamic references.
B. ...
arXiv:1909.12765v1
fatcat:il5aybuhw5aejhidsqthxfyxli
A Study of Unrestricted Abstract Argumentation Frameworks
2017
Proceedings of the Twenty-Sixth International Joint Conference on 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 2018; you can also visit the original URL.
The file type is application/pdf.
Research in abstract argumentation typically per-tains to finite argumentation frameworks (AFs). ...
Apartfrom these practical cases a profound analysis yieldsa better understanding of how the nonmonotonic the-ory of abstract argumentation works in general. ...
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence ...
doi:10.24963/ijcai.2017/112
dblp:conf/ijcai/BaumannS17
fatcat:erbvo3sevndixlizvgxonejzue
« Previous
Showing results 1 — 15 out of 32,179 results