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
A nonmonotonic conditional logic for belief revision
[chapter]
The Logic of Theory Change
Preserved Fulltext
Using Gärdenfors's notion of epistemic entrenchment, we develop the semantics of a logic which accounts for the following points. ...
We indicate that consistent additions of new items of belief are not to be performed by transitions to logical expansions. ...
for belief revision. ...
doi:10.1007/bfb0018420
dblp:conf/ltc/Rott89
fatcat:t2ev4l5t2nfyhbmqdbn2i5k3si
Descriptor Revision for Conditionals: Literal Descriptors and Conditional Preservation
[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.
Since our conditional logic subsumes propositional logic, our approach also realises descriptor revision for propositional logic. ...
Descriptor revision by Hansson is a framework for addressing the problem of belief change. In descriptor revision, different kinds of change processes are dealt with in a joint framework. ...
Conditional Descriptor Revision We instantiate descriptor revision for the case in which the underlying logic is the conditional logic L cond and ranking functions serve as a representation for epistemic ...
arXiv:2006.01444v1
fatcat:a7msbrn64ncd5i5cd27v54uime
Weak AGM postulates and strong Ramsey Test: A logical formalization
2005
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 2019; you can also visit the original URL.
The file type is application/pdf.
The logic BCR provides a logical formalization of belief revision in the language of conditional logic. ...
We reformulate AGM postulates for belief revision systems that may contain conditional formulas. ...
This research has been partially supported by the project MIUR PRIN 2003 Logic-based development and verification of multi-agent systems. ...
doi:10.1016/j.artint.2005.06.004
fatcat:bzgq2ykkmbbxpclok6qpasotfu
Belief revision: A vade-mecum
[chapter]
1992
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 2019; you can also visit the original URL.
The file type is application/pdf.
A set of rationality postulates for revisions are presented. A couple of semi-algorithmic models of revision and updating are introduced. ...
Finally, the relation between belief revision and nonmonotonic logic is explored. ...
Then is a comparative expectation inference relation, i.e., there exists an expectation ordering ≤ over L such that = ≤ . ...
doi:10.1007/3-540-56282-6_1
fatcat:lrm4tldudjd5ng36jueu7243d4
On the Ramsey Test without Triviality
2010
Notre Dame Journal of Formal Logic
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.
We present a way of classifying the logically possible ways out of Gärdenfors' inconsistency or triviality result on belief revision with conditionals. ...
This is done by constructing ranked models in which such Ramsey-test conditionals are evaluated and which are subject to natural postulates on belief revision and acceptability sets for conditionals. ...
The logic is Ernest Adams' logic for indicative conditionals again. ...
doi:10.1215/00294527-2010-003
fatcat:meerogsifzdjbcdhe744n4ovvq
Page 1928 of Mathematical Reviews Vol. , Issue 95d
[page]
1995
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.
For this reason, if the characterizations do provide a grounding of the logic of conditionals in something, it is not quite in the logic of belief revision. ...
The difficulty, noted by Gardenfors in his celebrated paper “Belief revision and the Ramsey test for conditionals” [Philos. ...
Simple Hyperintensional Belief Revision
2018
Erkenntnis: An International Journal of Scientific 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 2018; you can also visit the original URL.
The file type is application/pdf.
I present a possible worlds semantics for a hyperintensional belief revision operator, which reduces the logical idealization of cognitive agents affecting similar operators in doxastic and epistemic logics ...
The framework combines, instead, a standard semantics for propositional S5 with a simple mereology of contents. ...
Acknowledgements This research is published within the project 'The Logic of Conceivability', funded by the European Research Council (ERC CoG), grant number 681404. ...
doi:10.1007/s10670-018-9971-1
pmid:32647399
pmcid:PMC7328294
fatcat:2rfl4nrazzbmxa2nmymf5uk2qe
Belief Revision, Conditional Logic and Nonmonotonic Reasoning
1995
Notre Dame Journal of Formal Logic
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 2007; you can also visit the original URL.
The file type is application/pdf.
Finally, we consider the relationship between nonmonotonic reasoning and both conditional logic and belief revision. ...
Adapting the approach of Delgrande, we show that the unique extension of a default theory expressed in our conditional logic of belief revision corresponds to the most conservative belief state which respects ...
the theory change algorithms and on the implementation of the belief revision system. ...
doi:10.1305/ndjfl/1040308829
dblp:journals/ndjfl/Wobcke95
fatcat:weqac4q675anplea7lym2fxz4u
Dynamic logic for belief revision
2007
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 2017; you can also visit the original URL.
The file type is application/pdf.
We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. ...
First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. ...
DEL-style logics of belief revision have a modular architecture with (a) a base logic for a static language of the right expressive power, perhaps 'engineered' for the purpose of reduction, (b) general ...
doi:10.3166/jancl.17.129-155
fatcat:7oxnabthubanpdledhbnzsooku
DDL as an "Internalization" of Dynamic Belief Revision
[chapter]
2013
Outstanding Contributions to Logic
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.
We argue that a correct version of full DDL must give up the Success Postulate for dynamic revision. ...
We construct AGM-friendly versions of full DDL, corresponding to various revising/contracting operations considered in the Belief Revision literature. ...
Complete axiomatization of static revision: the logic CDL To capture static revision, we follow the DEL tradition, by borrowing from conditional logic a conditional belief operator B φ ψ. ...
doi:10.1007/978-94-007-7046-1_12
fatcat:bfxmj53q7zh4vhvfqtpvskqfoa
Conditional Doxastic Models: A Qualitative Approach to Dynamic Belief Revision
2006
Electronical Notes in Theoretical 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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a semantical approach to multi-agent belief revision and belief update. For this, we introduce relational structures called conditional doxastic models (CDM's, for short). ...
We show this setting to be equivalent to an epistemic version of the classical AGM Belief Revision theory. We present a logic of conditional beliefs that is complete w.r.t. CDM's. ...
models, and which gives rise in a natural way to conditional belief operators, and thus to a conditional doxastic logic CDL. ...
doi:10.1016/j.entcs.2006.05.034
fatcat:cjxhzwk7gfathgwgcgdowo52u4
Epistemic Logics for Information Fusion
[chapter]
2003
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 propose some extensions of epistemic logic for reasoning about information fusion. ...
Some modalities corresponding to these fusion operators are added to epistemic logics and the Kripke semantics of these extended logics are presented. ...
The truth condition of [ ϕ (G)]ψ is defined as that for conditional logic [10, 9] . ...
doi:10.1007/978-3-540-45062-7_40
fatcat:co4lyvhi3be45j4syyeessm7gy
A Qualitative Theory of Dynamic Interactive Belief Revision
[chapter]
2016
Readings in Formal Epistemology
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.
We present a logical setting that incorporates a belief-revision mechanism within Dynamic-Epistemic logic. ...
As the "static" basis for belief revision, we use epistemic plausibility models, together with a modal language based on two epistemic operators: a "knowledge" modality K (the standard S5, fully introspective ...
Sonja Smets' contribution to this research was made possible by the post-doctoral fellowship awarded to her by the Flemish Fund for Scientific Research. We thank Johan van Benthem for his insights and ...
doi:10.1007/978-3-319-20451-2_39
fatcat:bxpucoz2vnaw3hed6aclpwtyxi
The Probability of a Possibility: Adding Uncertainty to Default Rules
[chapter]
1993
Uncertainty in 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.
We present a semantics for adding uncertainty to conditional logics for default reasoning and be lief revision. ...
We are able to treat conditional sen tences as statements of conditional probability, and express rules for revision such as "If A were believed, then B would be believed to degree p." ...
We demonstrate the relationship to existing conditional logics for default reasoning and belief revision. ...
doi:10.1016/b978-1-4832-1451-1.50060-3
fatcat:2s23ivvf55grxau7g3fwsqujhi
A New Approach for Revising Logic Programs
[article]
2016
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.
In particular, we will focus on the revision of a body of beliefs that is represented as a logic program under the answer set semantics, while the new information is also similarly represented as a logic ...
We will define a syntactic revision function and subsequently provide representation theorem for characterising it. ...
To this end, we defined a belief revision function for disjunctive logic programs under the answer set semantics. Inconsistency-resolution is an essential task for belief revision. ...
arXiv:1603.09465v1
fatcat:eifb27oyfngfblfhuf4tnk2bcy
« Previous
Showing results 1 — 15 out of 138,913 results