Ordering-Based Representations of Rational Inference

  title={Ordering-Based Representations of Rational Inference},
  author={Konstantinos Georgatos},
Rational inference relations were introduced by Lehmann and Magidor as the ideal systems for drawing conclusions from a conditional base. However, there has been no simple characterization of these relations, other than its original representation by preferential models. In this paper, we shall characterize them with a class of total preorders of formulas by improving and extending Gardenfors and Makinson's results for expectation inference relations. A second representation is application… 
Relevance Sensitive Non-Monotonic Inference on Belief Sequences
The inference operation thus defined easily handles iterated revision by maintaining a revision history, blocks the derivation of inconsistent answers from a possibly inconsistent sequence and maintains the distinction between explicit and implicit beliefs.
Nonmonotonic Proof Systems: Algebraic Foundations
MAK triples and KLM triples are formed in ways similar to MAK models and K LM models but now on the algebraic structures for the nonmonotonic systems, thereby a new type of semantics is given to these systems.
Maxi-Adjustment and Possibilistic Deduction for Adaptive Information Agents
This paper illustrates how maxi-adjustment and possibilistic deduction can be applied to develop the adaptive information agents.
Belief Revision for Adaptive Information Filtering Agents
A symbolic framework for representing domain knowledge in an adaptive information filtering agent is described and how the AGM belief revision paradigm can be applied to develop the agent's learning mechanism is illustrated.
Relevance as Deduction: A Logical View of Information Retrieval
This work introduces a simple but powerful logical framework of relevance feedback, derived from the well founded area of nonmonotonic logic, which claims that retrieval is a form of deduction.
A Logical approach to Query Reformulation motivatedfrom Belief
This article attempts to draw parallels between query reformulation and the theory of belief change. We argue that query expansion and query revision can be explained in terms of the revision of the
A Logical approach to Query Reformulation motivated from Belief Change
It is argued that query expansion and query revision can be explained in terms of the revision of the user's beliefs in query terms as well as being under-pinned by a process of belief expansion.
To Preference via Entrenchment
Entrenchment Relations: A Uniform Approach to Nonmonotonicity
We show that Gabbay's nonmonotonic consequence relations can be reduced to a new family of relations, called entrenchment relations. Entrenchment relations provide a direct generalization of


Nonmonotonic Inference Based on Expectations
Belief Revision and Default Reasoning: Syntax-Based Approaches
It is shown that a general form of syntax-based belief revision corresponds to a special kind of partial meet revision in the sense of variants of logics for default reasoning, which turns out to be located at the lower end of the polynomial hierarchy.
Nonmonotonic reaso ning, preferential models and cumulative logics.Artificial Intelligence, 44:167–207
  • 1990
Decision Order and Time in Human Affairs
The second edition of Professor Shackle's book has a fresh preface, an extra chapter and a number of additions to its bibliography on how a decision can be rational only in a special sense.
Possibility Theory - An Approach to Computerized Processing of Uncertainty
This chapter discusses the use of Fuzzy Sets for the Evaluation and Ranking of Objects, a Quantitative Approach to Multiaspect Choice, and some of the techniques used in this approach.
General patterns in nonmonotonic reasoning
A semantical approach to nonmonotonic logics
Relations between the logic of theory change and nonmonotonic logic
The purpose of this paper is to investigate the close relations between the logic of theory change (alias belief revision) on the one hand, and nonmonotonic logic on the other. The connection is most