Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. McCarthy (1987)
SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCEMachine intelligence
S. Shapiro (1993)
Belief spaces as sets of propositionsJ. Exp. Theor. Artif. Intell., 5
(2005)
G.lenn.: Algorithmic learning in a random world Springer Science & Business Media
But this implies that F (V(M R ) ∪ ER n ) is inconsistent. Hence, we get a contradiction
D. Makinson (1994)
General patterns in nonmonotonic reasoning
M. Jago (2009)
Epistemic Logic for Rule-Based AgentsJournal of Logic, Language and Information, 18
D. Dubois, H. Prade, S. Schockaert (2017)
Generalized possibilistic logic: Foundations and applications to qualitative reasoning about uncertaintyArtif. Intell., 252
(2001)
A logic of graded trust and belief fusion
Milos Milosevic, Z. Ognjanovic (2012)
A first-order conditional probability logicLog. J. IGPL, 20
Matthew Richardson, Pedro Domingos (2006)
Markov logic networksMachine Learning, 62
Haythem Ismail (2012)
LogAB: A first-order, non-paradoxical, algebraic logic of beliefLog. J. IGPL, 20
D. Dubois, J. Lang, H. Prade (1994)
Possibilistic logic
S. Shapiro, Haythem Ismail (2003)
Anchoring in a grounded layered architecture with integrated reasoningRobotics Auton. Syst., 43
J. Pearl (1990)
System Z: A Natural Ordering of Defaults with Tractable Applications to Nonmonotonic ReasoningProbabilistic and Causal Inference
D. Lehmann, M. Magidor (1989)
What does a Conditional Knowledge Base Entail?
Robert Mercer (2001)
Book Reviews: Natural Language Processing and Knowledge Representation: Language for Knowledge and Knowledge for LanguageComputational Linguistics, 27
(2008)
Nonmonotonic reasoning: Handbook of knowledge representation
A. Solaki, Francesco Berto, S. Smets (2019)
The Logic of Fast and Slow ThinkingErkenntnis, 86
T. Parsons (1993)
ON DENOTING PROPOSITIONS AND FACTSPhilosophical Perspectives, 7
J. Martins, S. Shapiro (1988)
A Model for Belief RevisionArtif. Intell., 35
P. McNamara (2006)
Deontic logic
E. Adams (1975)
The logic of conditionals
V is supported by at least a graded proposition with an embedding degree of n, we get a contradiction as F (V(M R ) ∪ ER n ) must be inconsistent. Then, it must be that
H. Ditmarsch, Joseph Halpern, W. Hoek, Barteld Kooi (2015)
An Introduction to Logics of Knowledge and BeliefArXiv, abs/1503.00806
Follows from the pigeon-hole principle and from g's being a function on P
Stephen Morris, Anthony Finkelstein (1993)
Development of multiple media documents
M. Shanahan (1997)
Solving the frame problem - a mathematical investigation of the common sense law of inertia
A. Paccanaro, Geoffrey Hinton (2001)
Learning Distributed Representations of Concepts Using Linear Relational EmbeddingIEEE Trans. Knowl. Data Eng., 13
Jianhua Chen (1993)
The Logic of Only Knowing as a Unified Framework for Non-Monotonic ReasoningFundam. Informaticae, 21
It follows from the previous three cases and the monotonicity of filters that π(φ) is a logical consequence of π
Andrea Iacona (2019)
Gödel’s Incompleteness TheoremsLOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science
S. Burris, H. Sankappanavar (1981)
A course in universal algebra, 78
D. Gabbay (1989)
Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems
J. McCarthy (1979)
Circumscription|a Form of Nonmonotonic Reasoning
Don Koks, S. Challa (2003)
An Introduction to Bayesian and Dempster-Shafer Data Fusion
D. Gabbay (2012)
What Is Negation as Failure?
H. Levesque (1990)
All I Know: A Study in Autoepistemic LogicArtif. Intell., 42
G. Bealer (1979)
Theories of properties, relations, and propositionsThe Journal of Philosophy, 76
(2000)
Shapiro
S. Hansson (1994)
Kernel contractionJournal of Symbolic Logic, 59
A. Church (1950)
On Carnap's Analysis of Statements of Assertion and BeliefAnalysis, 10
W. Gasarch, David Mackay, Maulik Dave, Klaus Schneider
The Book Review Column 1 Coverage Untyped Systems Simple Types Recursive Types Higher-order Systems General Impression 3 Organization, and Contents of the Book
D. Perlis (1988)
Languages with Self-Reference II: Knowledge, Belief, and ModalityArtif. Intell., 34
R. Booth, Giovanni Casini, T. Meyer, I. Varzinczak (2015)
On the Entailment Problem for a Logic of Typicality
Fangzhen Lin, Y. Shoham (1989)
Argument Systems: A Uniform Basis for Nonmonotonic Reasoning
J. Delgrande, Torsten Schaub, H. Tompits (2000)
A Compilation of Brewka and Eiter's Approach to Prioritization
K. Britz, T. Meyer, I. Varzinczak (2011)
Preferential Reasoning for Modal Logics
In this case, π(φ) must be a non-monotonic rule embedded at level n whose negation is not embedded at level n. Hence, φ ∈ S and φ ∈ R(T ) by the definition of R(T )
This Is a Publication of the American Association for Artificial Intelligence
Nourhan Ehab, Haythem Ismail (2018)
Towards a Unified Algebraic Framework for Non-Monotonicity
V. Marek, M. Truszczynski (1991)
Autoepistemic logicJ. ACM, 38
Haythem Ismail (2013)
Stability in a Commonsense Ontology of States
Haythem Ismail (2020)
The Good, the Bad, and the Rational: Aspects of Character in Logical Agents
G. Brewka, Thomas Eiter (2000)
Prioritizing Default Logic
S. Benferhat, C. Cayrol, D. Dubois, J. Lang, H. Prade (1993)
Inconsistency Management and Prioritized Syntax-Based Entailment
Y. Shoham (1987)
Nonmonotonic Logics: Meaning and Utility
P. Balbiani, D. Fernández-Duque, E. Lorini (2018)
The Dynamics of Epistemic Attitudes in Resource-Bounded AgentsStudia Logica, 107
A.11 Proof of Proposition 3
R. Reiter (1987)
A Logic for Default ReasoningArtif. Intell., 13
Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, L. Deng (2014)
Embedding Entities and Relations for Learning and Inference in Knowledge BasesCoRR, abs/1412.6575
James Allen (1984)
Towards a General Theory of Action and Time
V survives telescoping and is supported at level n since all members of the top theory T survive telescoping and are supported at all levels
M. Benevides, A. Madeira, M. Martins (2018)
A Family of Graded Epistemic Logics
(2013)
Multisensor data fusion: a review of the state-ofthe-art
D. Dubois, L. Godo, H. Prade (2014)
Weighted logics for artificial intelligence - an introductory discussionInt. J. Approx. Reason., 55
S. Benferhat, D. Dubois, H. Prade (1997)
Nonmonotonic Reasoning, Conditional Objects and Possibility TheoryArtif. Intell., 92
J. Schulze (2016)
Handbook Of Logic In Artificial Intelligence And Logic Programming
Hector Geffner, J. Pearl (1992)
Conditional Entailment: Bridging two Approaches to Default ReasoningArtif. Intell., 53
K. Konolige (1985)
A Computational Theory of Belief Introspection
This can not be as φ must be a grading term and grading terms are never in R
(2010)
Weighted logic Technical report
By Observation 9
Manuel Lamotte-Schubert, Christoph Weidenbach (2017)
BDI: a new decidable clause classJ. Log. Comput., 27
E. Börger, E. Grädel, Y. Gurevich (1997)
The Classical Decision Problem
J. Pearl (1991)
Probabilistic reasoning in intelligent systems - networks of plausible inference
Thomas Bolander (2003)
From Logic Programming Semantics to the Consistency of Syntactical Treatments of Knowledge and Belief
Robert Moore (1987)
Possible-World Semantics for Autoepistemic Logic
Nourhan Ehab, Haythem Ismail (2019)
A Unified Algebraic Framework for Non-MonotonicityArXiv, abs/1907.09103
Suppose that F (V(M R ) ∪ ER n ) is consistent. Let
A. Bondarenko, P. Dung, R. Kowalski, Francesca Toni (1997)
An Abstract, Argumentation-Theoretic Approach to Default ReasoningArtif. Intell., 93
Sarit Kraus, D. Lehmann, M. Magidor (1990)
Nonmonotonic Reasoning, Preferential Models and Cumulative LogicsArXiv, cs.AI/0202021
(2016)
On the Use of Graded Propositions in Uncertain Non-Monotonic Reasoning: With an Application to Plant Disease Forecast
Jens Bjerring, M. Skipper (2018)
A Dynamic Solution to the Problem of Logical OmniscienceJournal of Philosophical Logic, 48
Publisher's note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
E Adams (1965)
166Inquiry, 8
We present LogAG, a weighted algebraic non-monotonic logic for reasoning with graded beliefs. LogAG is algebraic in that it is a language of only terms, some of which denote propositions and may be associated with ordered grades. The grades could be taken to represent a wide variety of phenomena including preference degrees, priority levels, trust ranks, and uncertainty measures. Reasoning in LogAG is non-monotonic and may give rise to contradictions. Belief revision is, hence, an integral part of reasoning and is guided by the grades. This yields a quite expressive language providing an interesting alternative to the currently existing approaches to non-monotonicity. We show how LogAG can be utilised for modelling resource-bounded reasoning; simulating inconclusive reasoning with circular, liar-like sentences; and reasoning about information arriving over a chain of sources each with a different degree of trust. While there certainly are accounts in the literature for each of these issues, we are not aware of any single framework that accounts for them all like LogAG does. We also show how LogAG captures a wide variety of non-monotonic logical formalisms. As such, LogAG is a unifying framework for non-monotonicity which is flexible enough to admit a wide array of potential uses.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jun 20, 2020
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.