4,081 Hits in 5.9 sec

Page 706 of Linguistics and Language Behavior Abstracts: LLBA Vol. 24, Issue 2 [page]

1990 Linguistics and Language Behavior Abstracts: LLBA  
A model of naive semantics is outlined as the basis for the KT system under development. The first phase of the project is a text under- standing & query system.  ...  A practical parsing system, based on the algorithm, is presented.  ... 

Present and Future of Formal Argumentation (Dagstuhl Perpectives Workshop 15362)

Dov M. Gabbay, Massimiliano Giacomin, Beishui Liao, Leendert Van Der Torre, Marc Herbstritt
2016 Dagstuhl Reports  
This report documents the program and the outcomes of Dagstuhl Perspectives Workshop 15362 "Present and Future of Formal Argumentation".  ...  The goal of this Dagstuhl Perspectives Workshop was to gather the world leading experts in formal argumentation in order to develop a SWOT (Strength, Weaknesses, Opportunities, Threats) analysis of the  ...  Our approach rests on the notion of explicit acceptance conditions, as first studied in Abstract Dialectical Frameworks (ADFs).  ... 
doi:10.4230/dagrep.5.8.74 dblp:journals/dagstuhl-reports/GabbayGLT15 fatcat:htoo2zzpi5hyjogjeck2m6iilm

Stage semantics and the SCC-recursive schema for argumentation semantics

Wolfgang Dvořák, Sarah Alice Gaggl
2014 Journal of Logic and Computation  
The stage semantics does not satisfy the above mentioned evaluation criteria, whereas cf2 semantics produces some questionable results on frameworks with cycles of length ≥ 6.  ...  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

What Is a Reasonable Argumentation Semantics? [chapter]

Sarah Alice Gaggl, Sebastian Rudolph, Michaël Thomazo
2015 Lecture Notes in Computer Science  
We discuss three attempts of such a characterization, based on computational complexity, logical expressivity and invariance under partial duplication, which are satisfied by most, if not all, known semantics  ...  In view of the plethora of different argumentation semantics, we consider the question what the essential properties of a "reasonable" semantics are.  ...  As this Festschrift is dedicated to Gerd Brewka's 60 th birthday, we want to congratulate him as well as thank him for his inspiring work and the fruitful and enjoyable discussions.  ... 
doi:10.1007/978-3-319-14726-0_21 fatcat:fvfcteo4onh4je5tbssvyknxua

Logical models of argument

Carlos Iván Chesñevar, Ana Gabriela Maguitman, Ronald Prescott Loui
2000 ACM Computing Surveys  
We trace the evolution of argumentation from the mid-1980s, when argument systems emerged as an alternative to nonmonotonic formalisms based on classical logic, to the present, as argument is embedded  ...  in different complex systems for real-world applications, and allows more formal work to be done in different areas, such as AI and Law, case-based reasoning and negotiation among intelligent agents.  ...  ACKNOWLEDGMENTS We want to thank anonymous referees for suggestions and comments that helped to improve the structure of the first version of this paper. Computación (Oct.) Ciencias de la  ... 
doi:10.1145/371578.371581 fatcat:fcifpsaik5hd7diovit5h67p7e

On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics

Sarah Alice Gaggl, Sebastian Rudolph, Hannes Straß
2021 The Journal of Artificial Intelligence Research  
We perform an exhaustive analysis of the computational complexity of these new, so-called naive-based semantics.  ...  dialectical frameworks (ADFs) are a recently introduced powerful generalization of Dung's popular abstract argumentation frameworks (AFs).  ...  We thank several anonymous reviewers for their helpful feedback.  ... 
doi:10.1613/jair.1.11348 fatcat:o3yxqoqpxvfl5ctrgzkuglsmpe

Methods for solving reasoning problems in abstract argumentation – A survey

Günther Charwat, Wolfgang Dvořák, Sarah A. Gaggl, Johannes P. Wallner, Stefan Woltran
2015 Artificial Intelligence  
Although the idea of abstract argumentation is appealingly simple, several reasoning problems in this formalism exhibit high computational complexity.  ...  Moreover, we highlight available state-of-the-art systems for abstract argumentation, which put these methods to practice. (S.A. Gaggl), (J.P.  ...  The authors are grateful to the anonymous reviewers for their detailed reviews and helpful comments as well as to all colleagues who discussed their works and systems with the authors.  ... 
doi:10.1016/j.artint.2014.11.008 pmid:25737590 pmcid:PMC4318991 fatcat:qrw6bic4vjc5zdqkvi5tlhcs7m

Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory

Hannes Strass, Johannes Peter Wallner
2015 Artificial Intelligence  
As a technical vehicle, we employ the approximation fixpoint theory of Denecker, Marek and Truszczyński, thus showing that it is also a useful tool for complexity analysis of operator-based semantics.  ...  In this paper, we present a comprehensive analysis of the computational complexity of ADFs.  ...  We thank several anonymous reviewers for helpful feedback.  ... 
doi:10.1016/j.artint.2015.05.003 fatcat:q4inivx7qndmzck76i2ssa6e5u

COMET: A Domain-Specific Compilation of High-Performance Computational Chemistry [article]

Erdal Mutlu, Ruiqin Tian, Bin Ren, Sriram Krishnamoorthy, Roberto Gioiosa, Jacques Pienaar, Gokcen Kestor
2021 arXiv   pre-print
We present a system of progressive lowering through multiple layers of abstraction and optimization that achieves up to 1.98X speedup for 30 tensor contractions commonly used in computational chemistry  ...  The computational power increases over the past decades havegreatly enhanced the ability to simulate chemical reactions andunderstand ever more complex transformations.  ...  optimized based on the operations semantics.  ... 
arXiv:2102.06827v1 fatcat:aekbdo7nfrhqfd42llgzbyhh7a

SCF2 – an Argumentation Semantics for Rational Human Judgments on Argument Acceptability: Technical Report [article]

Marcos Cramer, Leendert van der Torre
2019 arXiv   pre-print
In abstract argumentation theory, many argumentation semantics have been proposed for evaluating argumentation frameworks.  ...  This paper is based on the following research question: Which semantics corresponds well to what humans consider a rational judgment on the acceptability of arguments?  ...  Moreover, many principles have been proposed for alternative semantics of argumentation frameworks such as ranking semantics [1] , and for extended argumentation frameworks, for example for abstract dialectical  ... 
arXiv:1908.08406v1 fatcat:7qjpgtblqfelvj7y3tncldo6i4

Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving

Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes P. Wallner, Stefan Woltran
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
dialectical frameworks (ADFs) constitute one of the most powerful formalisms in abstract argumentation.  ...  Their high computational complexity poses, however, certain challenges when designing efficient systems.  ...  Conclusion In this work, we studied the complexity of subclasses of ADFs and incorporated these insights into a novel and competitive system based on incremental SAT solving.  ... 
doi:10.24963/ijcai.2018/263 dblp:conf/ijcai/LinsbichlerMNWW18 fatcat:bapuiffso5hufgofbxof4wb43e

Present and Future of Formal Argumentation (Dagstuhl Perspectives Workshop 15362)

Dov M. Gabbay, Massimiliano Giacomin, Beishui Liao, Leendert Van Der Torre, Michael Wagner
2018 Dagstuhl Manifestos  
The turning point for the modern stage of formal argumentation theory, much similar to the introduction of possible worlds semantics for the theory of modality, is the framework and language of Dung's  ...  This is still not fully true for what is going on in argumentation theory.  ...  We thank the anonymous reviewers for valuable comments. We have received funding from the European Union's H2020  ... 
doi:10.4230/dagman.7.1.69 dblp:journals/dagstuhl-manifestos/GabbayGLT18 fatcat:g4dtu63a2vfwhp4sr6z74jh2va

Domain-Specific Multi-Level IR Rewriting for GPU [article]

Tobias Gysi, Christoph Müller, Oleksandr Zinenko, Stephan Herhut, Eddie Davis, Tobias Wicky, Oliver Fuhrer, Torsten Hoefler, Tobias Grosser
2020 arXiv   pre-print
We demonstrate the effectiveness of this approach for the weather and climate domain.  ...  In particular, we develop a prototype compiler and design stencil- and GPU-specific dialects based on a set of newly introduced design principles.  ...  Finally, we thank Hannes Vogt for providing the initial out-of-tree devel-opment setup and Felix Thaler for sharing performance results that inspired our work.  ... 
arXiv:2005.13014v2 fatcat:3kjj5bdukbemte6yf4zgeq7spq

On the expressive power of collective attacks

Wolfgang Dvořák, Jorge Fandinno, Stefan Woltran
2019 Argument & Computation  
We first provide a comprehensive analysis of the expressiveness of SETAFs under conflict-free, naive, stable, complete, admissible and preferred semantics.  ...  In this paper, we consider SETAFs due to Nielsen and Parsons, an extension of Dung's abstract argumentation frameworks that allow for collective attacks.  ...  This research has been supported by FWF through projects I2854 and P30168 and by CIMI through the program ANR-11-IDEX-0002-02.  ... 
doi:10.3233/aac-190457 fatcat:dgo2jdnogbg4hg24uixbgdrepa

Progressive Raising in Multi-level IR

Lorenzo Chelini, Andi Drebes, Oleksandr Zinenko, Albert Cohen, Nicolas Vasilache, Tobias Grosser, Henk Corporaal
2021 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)  
We further introduce Multi-Level Tactics, our declarative approach for progressive raising, implemented on top of the MLIR framework, and demonstrate the progressive raising from affine loop nests specified  ...  languages that are not semantically rich enough to model the required abstractions.  ...  The research of Tobias Grosser is partially supported through the Swiss National Science Foundation under the Ambizione programme (grant PZ00P2168016) and ARM Ltd. and Xilinx Inc., in the context of Polly  ... 
doi:10.1109/cgo51591.2021.9370332 fatcat:vwomis2givhjvdbeidzt5pz45y
« Previous Showing results 1 — 15 out of 4,081 results