Nonmonotonic inference operations

@article{Freund1993NonmonotonicIO,
  title={Nonmonotonic inference operations},
  author={Michael Freund and Daniel J. Lehmann},
  journal={Log. J. IGPL},
  year={1993},
  volume={1},
  pages={23-68}
}
A. Tarski proposed the study of infinitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations. In this paper, we weaken the monotonicity requirement and consider more general operations, inference operations. These operations describe the nonmonotonic logics both humans and machines seem to be using when infering defeasible information from incomplete knowledge. We single out a number of interesting families of… 

Nonmonotonic reasoning: from finitary relations to infinitary inference operations

This paper weakens the monotonicity requirement and considers more general operations, inference operations, which describe the nonmonotonic logics both humans and machines seem to be using when infering defeasible information from incomplete knowledge.

Compactness Properties of Nonmonotonic Inference Operations

It is proved that minimal reasoning in propositional logic is weakly supracompact and that the associated inference operator is uniquely determined by its finitary restriction via an extension operator Δ4.

Deductive Nonmonotonic Inference Operations: Antitonic Representations

The results provide a satisfactory notion of pseudo-compactness, generalizing to deductive nonmonotonic operations the notion of compactness for monotonic ops and provide an alternative, more elegant and more general proof of the existence of an infinitary deductive extension for any finitary deductives operation.

Generalized Compactness of Nonmonotonic Inference Operations

  • H. Herre
  • Computer Science
    J. Appl. Non Class. Logics
  • 1995
Compactness properties play a fundamental in the study of non-monotonic inference, and in the paper several new versions of compactness are studied.

ON GENERALIZATIONS OF CONSEQUENCE OPERATION

We define some classes of operation generalizing the notion of logical consequence operation. Then we investigate them in terms of properties of their theories. Kraus Lehmann and Magidor in [2]

Nonmonotonic Logics and Semantics

A more general semantics is described in this paper, based on a set of natural properties of choice functions, which is shown to be equivalent to a semantics based on comparing the relative "importance" of sets of models, by what amounts to a qualitative probability measure.

A Formula-Preferential Base for Paraconsistent and Plausible Reasoning Systems

A general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning is provided, based on preferential systems whose preferences are based on the satisfaction of formulas in models.

Formula-Preferential Systems for Paraconsistent Non-Monotonic Reasoning (an extended abstract)

A general framework for constructing natural consequence relations for paraconsistent and plausible nonmonotonic reasoning is provided, based on preferential systems whose preferences are based on the satisfaction of formulas in models.

Defaults as restrictions on classical Hilbert-style proofs

It is proposed to describe default logic as a logic where the juxtaposition of default proofs is subordinate to a restriction condition Ψ, and to prove cumulativity for any default logic (L, Ψ) by slightly modifying the notion of default proof.

Characterizations of Preferential Entailments

The paper provides a characterization result for four kinds of preferential entailments of propositional logic, and it appears that the apparently most complicated notion possesses by far the simplest characterization result.

References

SHOWING 1-10 OF 45 REFERENCES

The relationship between KLM and MAK models for nonmonotonic inference operations

The notion of the core of a KLM model, which suffices to fully determine the associated nonmonotonic inference relation, is introduced and corollary characterizations of certain particular classes of KLM models are given, notably those that are (in their terminology) cumulative and more specifically those they call preferential.

Nonmonotonic Reasoning, Preferential Models and Cumulative Logics

Supracompact inference operations

This paper shows that for any arbitrary cumulative operationC, there exists a supracompact cumulative operationK(C) that is smaller thenC and agrees withC on finite sets and inherits most of the properties thatC may enjoy, like monotonicity, distributivity or disjunctive rationality.

Rationality, Transitivity, and Contraposition

What does a Conditional Knowledge Base Entail?

A Logical Framework for Default Reasoning

  • D. Poole
  • Computer Science, Philosophy
    Artif. Intell.
  • 1988

Logic, Semantics, Metamathematics: Papers from 1923 to 1938

This edition of The Concept of Truth in Formalized Languages includes a new preface and a new analytical index for use by philosophers and linguists as well as by historians of mathematics and philosophy.

Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems

  • D. Gabbay
  • Computer Science
    Logics and Models of Concurrent Systems
  • 1984
Inference mechanism to extract more information out of P, a set of propositions of predicate logic, which is a collection of confirmed data items.

General patterns in nonmonotonic reasoning

General Theory of Cumulative Inference