Deductive Nonmonotonic Inference Operations: Antitonic Representations

03/01/2002
by   Yuri Kaluzhny, et al.
0

We provide a characterization of those nonmonotonic inference operations C for which C(X) may be described as the set of all logical consequences of X together with some set of additional assumptions S(X) that depends anti-monotonically on X (i.e., X is a subset of Y implies that S(Y) is a subset of S(X)). The operations represented are exactly characterized in terms of properties most of which have been studied in Freund-Lehmann(cs.AI/0202031). Similar characterizations of right-absorbing and cumulative operations are also provided. For cumulative operations, our results fit in closely with those of Freund. We then discuss extending finitary operations to infinitary operations in a canonical way and discuss co-compactness properties. Our results provide a satisfactory notion of pseudo-compactness, generalizing to deductive nonmonotonic operations the notion of compactness for monotonic operations. They also provide an alternative, more elegant and more general, proof of the existence of an infinitary deductive extension for any finitary deductive operation (Theorem 7.9 of Freund-Lehmann).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2002

Nonmonotonic inference operations

A. Tarski proposed the study of infinitary consequence operations as the...
research
07/31/2023

Canonical Gradings of Monads

We define a notion of grading of a monoid T in a monoidal category C, re...
research
12/21/2017

Bisymmetric and quasitrivial operations: characterizations and enumerations

We investigate the class of bisymmetric and quasitrivial binary operatio...
research
10/05/2021

Unifying AI Algorithms with Probabilistic Programming using Implicitly Defined Representations

We introduce Scruff, a new framework for developing AI systems using pro...
research
12/06/2018

Generalizations of Laver tables

We shall generalize the notion of a Laver table to algebras which may ha...
research
01/27/2021

Optimal Oracles for Point-to-Set Principles

The point-to-set principle <cit.> characterizes the Hausdorff dimension ...
research
05/24/2022

Extending the Network Calculus Algorithmic Toolbox for Ultimately Pseudo-Periodic Functions: Pseudo-Inverse and Composition

Network Calculus (NC) is an algebraic theory that represents traffic and...

Please sign up or login with your details

Forgot password? Click here to reset