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.
Filters
Weakly Complete Semantics Based on Undecidedness Blocking
[article]
2021
arXiv
pre-print
Preserved Fulltext
Since the two families of semantics do not coincide, a principle-based analysis of the two approaches is provided. ...
The analysis shows how our semantics satisfy a number of principles satisfied by Dung's complete semantics but not by Baumann et al. semantics, including directionality, abstention, SCC-decomposability ...
We perform a principle-based analysis of such new semantics and a comparison with the weakly admissible semantics recently proposed by Baumann et al. [3] . ...
arXiv:2103.10701v1
fatcat:bjtou6kk4je55i67fku24ghwuq
Page 4435 of Mathematical Reviews Vol. , Issue 84k
[page]
1984
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The theorems of this paper assume that B is weakly admissible, i.e. olcf(B)<olp(B). (Every admissible ordinal is weakly admissible.) Under this assumption, S. ...
Below 0'/*, there is a class of B-r.e. degrees called the tame degrees, whose structural analysis resembles that of the a-r.e. degrees for a admissible. ...
Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
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.
In this paper we extend Dung's formal approach from admissibility to less demanding extension semantics allowing arguments in cycles of attacks. ...
Furthermore, an algorithmic characterization of those games exhibits clearly how self-attacking or in odd-length cycles of attack can be rationally managed beyond the limits of admissibility. ...
Baroni and Giacomin [3] presented a more systematic approach to the evaluation of extension semantics, based on how they satisfy certain principles. ...
doi:10.1093/logcom/exu004
fatcat:mz4cecfvebfp5biq6brziudyhu
On the Acceptability of Meta-arguments
2009
2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology
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.
Metaarguments are generated from atomic arguments, and extensions of acceptable meta-arguments are based on Dung's argumentation semantics. ...
In this paper we introduce a theory of meta-argumentation, by using Dung's theory of abstract argumentation to reason about itself. ...
Baroni and Giacomin identify two fundamental principles underlying the definition of extension-based semantics in Dung's framework, the language independent principle and the conflict free principle. ...
doi:10.1109/wi-iat.2009.159
dblp:conf/iat/BoellaTV09
fatcat:k7kbi3yrbvctdoq757vdxpxddq
A choice-semantical approach to theoretical truth
2016
Studies in History and Philosophy of Science Part A
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.
A central topic in the logic of science concerns the proper semantic analysis of theoretical sentences, that is sentences containing theoretical terms. ...
In this paper, we present a novel choice-semantical account of theoretical truth based on the epsilonterm definition of theoretical terms. ...
The first one is to provide an explicit model-theoretic analysis of the epsilon account of theoretical terms based on a choicefunctional semantics for the epsilon operator ( [21, 4, 24] ). ...
doi:10.1016/j.shpsa.2016.02.001
pmid:27474181
fatcat:eydszerajvf3dhcqrfqos3sohe
The Prospects of a Paraconsistent Response to Vagueness
[chapter]
2010
Cuts and Clouds
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.
Some have thought so but the majority view has been that a paracomplete response 1 -roughly, a truth-value gap response -is as radical a departure from classical semantics as is necessary (and, of course ...
A paraconsistent response will require the abandonment of classical logic and requires a more radical departure from classical semantics. The choice is seen by many then to be clear. ...
However, since it is traditionally a development of a non-classical semantics from a classical base, and this tradition has circumscribed the ensuing issues, problems and debate, supervaluationism as it ...
doi:10.1093/acprof:oso/9780199570386.003.0023
fatcat:4waevyclyjaarlvt6arnjsjeva
Abstract argumentation and the rational man
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
In the literature, the different approaches to abstract argumentation that were refined over the years are typically evaluated from a formal logics perspective; an analysis that is based on models of economically ...
model of economic rationality and create a new argumentation principle that ensures compliance with this property. ...
An overview of semantics that fulfil this principle is provided in Appendix C, based on an analysis by Baumann [8] . ...
doi:10.1093/logcom/exab003
fatcat:3knxbxf4h5epridhvpclrv5ipu
States of Affairs as Structured Extensions in Free Logic
2020
Logic and Logical Philosophy
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.
By means of this principle, a strict criterion for the admissibility of objects as extensions of sentences can be derived: every object is admissible as the extension of a sentence that is preserved under ...
The search for the extensions of sentences can be guided by Frege's "principle of compositionality of extension", according to which the extension of a composed expression depends only on its logical form ...
I am indebted to Karel (Joe) Lambert for the discussion on a longer version of the paper as well as to an anonymous referee for his helpful comments. ...
doi:10.12775/llp.2020.025
fatcat:r4mtzxma4bcvnh7lgqv3uqdvpa
On the Intertranslatability of Argumentation Semantics
2011
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 2015; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We provide such an investigation in terms of different semantics proposed for abstract argumentation frameworks, a nonmonotonic yet simple formalism which received increasing interest within the last decade ...
Although the properties of these different semantics are nowadays well understood, there are no explicit results about intertranslatability. ...
A preliminary version of this paper has been presented at the International Conference "30 Years of Nonmonotonic Logic". ...
doi:10.1613/jair.3318
fatcat:iozpvmehybcm7cvfvxres6oiqm
Abstract Argumentation and the Rational Man
[article]
2021
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:
2020 pre-print arXiv:1911.13024v4 fatcat:54a7ccikvnakpf62b3qg53os5uOther Versions
In the literature, the different approaches to abstract argumentation that were refined over the years are typically evaluated from a formal logics perspective; an analysis that is based on models of economically ...
model of economic rationality and create a new argumentation principle that ensures compliance with this property. ...
An overview of semantics that fulfill this principle is provided in Appendix C, based on an analysis by Baumann [8] . ...
arXiv:1911.13024v6
fatcat:suqgtl7xpneqxk47owxkmmqu5i
Declassification: Dimensions and principles
2009
Journal of Computer Security
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 2013; you can also visit the original URL.
The file type is application/pdf.
With a general declassification framework as a long-term goal, we identify some prudent principles of declassification. ...
While the security community has recognised the importance of the problem, the state-of-the-art in information release is, unfortunately, a number of approaches with somewhat unconnected semantic goals ...
The paper has also benefited from the comments of Gerard Boudol, Stephen Chong, Mads Dam, Roberto Giacobazzi, Sebastian Hunt, Peng Li, Isabella Mastroeni, David Naumann and the anonymous reviewers. ...
doi:10.3233/jcs-2009-0352
fatcat:c6ngeq6bbrgnvfdc6r3jjqz77a
Synthesis of the Canonical Models for Database Integration Preserving Semantics of the Value Inventive Data Models
[chapter]
2012
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 2013; you can also visit the original URL.
The file type is application/pdf.
The paper 1 examines the decidable classes of dependencies reflecting the semantics of value inventive data models considering such classes to be the extensions of the canonical data model kernel. ...
The issue of identifying of decidable subsets of the canonical model extension is considered. ...
Principles of database integration. ...
doi:10.1007/978-3-642-33074-2_17
fatcat:3ywixhd5mrdkfpfse4haqnm5xe
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.
In this work, we present a generic approach for reasoning over AFs, based on the novel concept of complexity-sensitivity. ...
So far, implemented systems for evaluating AFs have either followed a straight-forward reduction-based approach or been limited to certain tractable classes of AFs. ...
Our complexity analysis is based on six different classes of argumentation frameworks which are known to yield milder complexity results for at least one of these semantics. ...
doi:10.1016/j.artint.2013.10.001
fatcat:jlc67qtkvbaixfihkgryslxt5e
Offline and online data: on upgrading functional information to knowledge
2012
Philosophical Studies
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.
The formal framework, on which the definitions are based, uses a contextual version of the verificationist principle of truth in order to connect functional to semantic information, avoiding Gettierization ...
Its use in the formal epistemology of information theories is crucial to solve the debate on the veridical nature of information, and it represents the companion notion to standard strongly semantic information ...
Acknowledgments This paper was first presented at an informal meeting of the IEG held at the Oxford e-Research Centre, June, 08, 2010. ...
doi:10.1007/s11098-012-9860-4
fatcat:grehqx4iyjfbfcnkxvn2sipwsi
A method for solving Nash equilibria of games based on public announcement logic
2010
Science China Information Sciences
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.
Keywords iterated admissibility algorithm, rationality, public announce logic, demo Citation Cui J Y, Tang X J. A method for solving Nash equilibria of games based on public announcement logic. ...
the iterated admissibility algorithm in game theory, which offers a dynamic epistemic foundation for this algorithm. ...
Acknowledgements We are grateful to Johan van Benthem and Jonathan A. Zvesper for valuable suggestions, and special thanks are due to two anonymous referees for their insightful comments. ...
doi:10.1007/s11432-010-4010-0
fatcat:w26qpxaq35fq3khkxujcpf67he
« Previous
Showing results 1 — 15 out of 2,281 results