English
Related papers

Related papers: Nonmonotonic inference operations

200 papers

The paper studies complementary choice functions, i.e. monotonic and consistent choice functions. Such choice functions were introduced and used in the work \cite{RY} for investigation of matchings with complementary contracts. Three…

Combinatorics · Mathematics 2022-09-15 Vladimir Danilov

This paper studies the design of programming languages with handlers of higher-order effectful operations -- effectful operations that may take in computations as arguments or return computations as output. We present and analyse a core…

Programming Languages · Computer Science 2025-11-11 Zhixuan Yang , Nicolas Wu

In a previous work, we proved an index theorem for families of asymptotically hyperbolic discrete dynamical systems and obtained applications to bifurcation theory. A weaker and far more common assumption than asymptotic hyperbolicity is…

Functional Analysis · Mathematics 2020-03-30 Robert Skiba , Nils Waterstraat

In this paper, we present the interval neutrosophic logics which generalizes the fuzzy logic, paraconsistent logic, intuitionistic fuzzy logic and many other non-classical and non-standard logics. We will give the formal definition of…

Logic in Computer Science · Computer Science 2007-05-23 Haibin Wang , Florentin Smarandache , Yanqing Zhang , Rajshekhar Sunderraman

This paper describes an implementation based on a recent model in the psycholinguistic literature. We define a parsing operation which allows the reanalysis of dependencies within an incremental and monotonic processing architecture, and…

cmp-lg · Computer Science 2008-02-03 Patrick Sturt

This paper presents a logical approach to nonmonotonic reasoning based on the notion of a nonmonotonic consequence relation. A conditional knowledge base, consisting of a set of conditional assertions of the type "if ... then ...",…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann , Menachem Magidor

This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the…

Logic in Computer Science · Computer Science 2023-06-22 Filippo Bonchi , Ana Sokolova , Valeria Vignudelli

Tarski's theorem states that every monotone function from a complete lattice to itself has a fixed point. We analyze the query complexity of finding such a fixed point on the $k$-dimensional grid of side length $n$ under the $\leq$…

Computational Complexity · Computer Science 2025-07-15 Simina Brânzei , Reed Phillips , Nicholas Recker

We generalise the termination method of higher-order polynomial interpretations to a setting with impredicative polymorphism. Instead of using weakly monotonic functionals, we interpret terms in a suitable extension of System F-omega. This…

Logic in Computer Science · Computer Science 2019-04-23 Łukasz Czajka , Cynthia Kop

In this paper, we will show a new characterization of operator monotone functions by a matrix reverse Cauchy inequality.

Functional Analysis · Mathematics 2015-12-14 Dinh Trung Hoa

We present a new result on uniform attractivity of the origin for nonlinear time-varying systems. Our theorem generalizes Matrosov's theorem which extends, in a certain manner, Krasovskii-LaSalle invariance principle to the case of general…

Optimization and Control · Mathematics 2007-05-23 Andrew R. Teel , Antonio Loria , Elena Panteley , Dobrivoje Popovic

We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…

Optimization and Control · Mathematics 2024-04-16 Neal Hermer , D. Russell Luke , Anja Sturm

We present a static analysis technique for non-termination inference of logic programs. Our framework relies on an extension of the subsumption test, where some specific argument positions can be instantiated while others are generalized.…

Programming Languages · Computer Science 2007-05-23 Etienne Payet , Fred Mesnard

We propose the use of the hypothetical retrospection argumentation procedure, developed by Sven Ove Hansson to improve existing approaches to machine ethical reasoning by accounting for probability and uncertainty from a position of…

Artificial Intelligence · Computer Science 2023-07-13 Simon Kolker , Louise Dennis , Ramon Fraga Pereira , Mengwei Xu

The purpose of this paper is to generalize a very famous result on products of normal operators, due to I. Kaplansky. The context of generalization is that of bounded hyponormal and unbounded normal operators on complex separable Hilbert…

Functional Analysis · Mathematics 2014-03-04 Abdelkader Benali , Mohammed Hichem Mortad

Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by the ideals obtained from relations such as the prefix,…

Formal Languages and Automata Theory · Computer Science 2019-03-11 Joey Eremondi , Oscar H. Ibarra , Ian McQuillan

Networked dynamical systems are common throughout science in engineering; e.g., biological networks, reaction networks, power systems, and the like. For many such systems, nonlinearity drives populations of identical (or near-identical)…

Dynamical Systems · Mathematics 2023-02-10 James Koch , Zhao Chen , Aaron Tuor , Jan Drgona , Draguna Vrabie

The comonotonic maxitivity property of functionals frequently appears in the characterization of fuzzy integrals based on the maximum operation. In some special cases, comonotonic maxitivity implies monotonicity of functionals. The question…

General Topology · Mathematics 2025-04-21 Taras Radul

This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…

High Energy Physics - Theory · Physics 2008-02-03 Israel Gelfand , D. Krob , Alain Lascoux , B. Leclerc , V. S. Retakh , J. -Y. Thibon

While probability theory is normally applied to external environments, there has been some recent interest in probabilistic modeling of the outputs of computations that are too expensive to run. Since mathematical logic is a powerful tool…

Artificial Intelligence · Computer Science 2016-10-10 Scott Garrabrant , Benya Fallenstein , Abram Demski , Nate Soares