Related papers: From Many-Valued Consequence to Many-Valued Connec…
We investigate the problem of inferring the causal predictors of a response $Y$ from a set of $d$ explanatory variables $(X^1,\dots,X^d)$. Classical ordinary least squares regression includes all predictors that reduce the variance of $Y$.…
The Goodman-Nguyen relation is a partial order generalising the implication (inclusion) relation to conditional events. As such, with precise probabilities it both induces an agreeing probability ordering and is a key tool in a certain…
We propose a new framework for integrating quantifiers with other logical connectives in a higher-categorical setting. Our method systematically incorporates key coherence conditions-including those akin to the Beck-Chevalley property-and…
The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…
We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…
Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar and Hallden, these systems are equipped with an additional…
Causal inference has traditionally focused on interventions at the unit level. In many applications, however, the central question concerns the causal effects of connections between units, such as transportation links, social relationships,…
We prove a new class of relations among multiple zeta values (MZV's) which contains Ohno's relation. We also give the formula for the maximal number of independent MZV's of fixed weight, under our new relations. To derive our formula for…
Belnap-Dunn logic, also knows as the logic of First-Degree Entailment, is a logic that can serve as the underlying logic of theories that are inconsistent or incomplete. For various reasons, different expansions of Belnap-Dunn logic with…
In this paper we investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a multilayer neural network model. Weighted knowledge bases for a simple description logic with…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
In this paper we develop a 2-valued reduction of many-valued logics, into 2-valued multi-modal logics. Such an approach is based on the contextualization of many-valued logics with the introduction of higher-order Herbrand interpretation…
In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…
We initiate the study of counting Markov Equivalence Classes (MEC) under logical constraints. MECs are equivalence classes of Directed Acyclic Graphs (DAGs) that encode the same conditional independence structure among the random variables…
This paper discusses system consequence, a central idea in the project to lift the theory of information flow to the abstract level of universal logic and the theory of institutions. The theory of information flow is a theory of distributed…
In this paper, we present a framework for the semantics and the computation of aggregates in the context of logic programming. In our study, an aggregate can be an arbitrary interpreted second order predicate or function. We define…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
Consequence-based calculi are a family of reasoning algorithms for description logics (DLs), and they combine hypertableau and resolution in a way that often achieves excellent performance in practice. Up to now, however, they were proposed…
We propose a means to relate properties of an interconnected system to its separate component systems in the presence of cascade-like phenomena. Building on a theory of interconnection reminiscent of the behavioral approach to systems…
Relational properties arise in many settings: relating two versions of a program that use different data representations, noninterference properties for security, etc. The main ingredient of relational verification, relating aligned pairs…