English
Related papers

Related papers: A theory of hierarchical consequence and condition…

200 papers

Recent work on the logical structure of non-locality has constructed scenarios where observations of multi-partite systems cannot be adequately described by compositions of non-signaling subsystems. In this paper we apply these frameworks…

Computer Science and Game Theory · Computer Science 2015-12-10 William Zeng , Philipp Zahn

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…

Logic in Computer Science · Computer Science 2007-05-23 Konstantinos Georgatos

We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained…

Logic in Computer Science · Computer Science 2024-01-17 Filippo Bonchi , Alessandro Di Giorgio , Nathan Haydon , Pawel Sobocinski

In this note let us give two remarks on proof-theory of PA. First a derivability relation is introduced to bound witnesses for provable $\Sigma_{1}$-formulas in PA. Second Paris-Harrington's proof for their independence result is…

Logic · Mathematics 2021-01-01 Toshiyasu Arai

Abstract algebra provides a large hierarchy of properties that a collection of objects can satisfy, such as forming an abelian group or a semiring. These classifications can arranged into a broad and typically acyclic directed graph. This…

Logic in Computer Science · Computer Science 2023-07-24 Eric Wieser

Hierarchically structured agent plans are important for efficient planning and acting, and they also serve (among other things) to produce "richer" classical plans, composed not just of a sequence of primitive actions, but also "abstract"…

Artificial Intelligence · Computer Science 2017-08-11 Lavindra de Silva , Sebastian Sardina , Lin Padgham

In the present paper a new concept of representability is introduced, which can be applied to not total and also to intransitive relations (semiorders in particular). This idea tries to represent the orderings in the simplest manner,…

General Topology · Mathematics 2024-01-25 Gianni Bosi , Asier Estevan , Magali Zuanon

We give an up-to-date perspective with a general overview of the theory of causal properties, the derived causal structures, their classification and applications, and the definition and construction of causal boundaries and of causal…

General Relativity and Quantum Cosmology · Physics 2016-08-16 Alfonso García-Parrado , José M. M. Senovilla

We develop a novel framework that aims to create bridges between the computational social choice and the database management communities. This framework enriches the tasks currently supported in computational social choice with relational…

Databases · Computer Science 2018-05-14 Benny Kimelfeld , Phokion G. Kolaitis , Julia Stoyanovich

We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…

Logic · Mathematics 2022-12-07 Rosalie Iemhoff , Robert Passmann

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

Logic · Mathematics 2019-02-01 Rob Egrot

Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…

Logic in Computer Science · Computer Science 2017-08-17 Abhinav Aggarwal , Padam Kumar

We propose an integration of possibility theory into non-classical logics. We obtain many formal results that generalize the case where possibility and necessity functions are based on classical logic. We show how useful such an approach is…

Artificial Intelligence · Computer Science 2013-02-28 Philippe Besnard , Jerome Lang

We study the structural complexity of bimatrix games, formalized via rank, from an empirical perspective. We consider a setting where we have data on player behavior in diverse strategic situations, but where we do not observe the relevant…

Computer Science and Game Theory · Computer Science 2013-05-16 Siddharth Barman , Umang Bhaskar , Federico Echenique , Adam Wierman

Classification of ordinal data is one of the most important tasks of relation learning. In this thesis a novel framework for ordered classes is proposed. The technique reduces the problem of classifying ordered classes to the standard…

Artificial Intelligence · Computer Science 2007-05-23 Jaime S. Cardoso

We propose a society-first theory of normative appropriateness where individuals, modeled as pre-trained actors with cognitive architectures analogous to Large Language Models (LLMs), generate behavior via predictive pattern completion. Our…

Causal inference is a central goal across many scientific disciplines. Over the past several decades, three major frameworks have emerged to formalize causal questions and guide their analysis: the potential outcomes framework, structural…

Statistics Theory · Mathematics 2026-02-12 Linbo Wang , Thomas Richardson , James Robins

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…

Computer Science and Game Theory · Computer Science 2021-05-18 Jonas Israel , Markus Brill

Machine learning plays a role in many deployed decision systems, often in ways that are difficult or impossible to understand by human stakeholders. Explaining, in a human-understandable way, the relationship between the input and output of…

Machine Learning · Computer Science 2022-11-17 Sahil Verma , Varich Boonsanong , Minh Hoang , Keegan E. Hines , John P. Dickerson , Chirag Shah

Human beings possess the most sophisticated computational machinery in the known universe. We can understand language of rich descriptive power, and communicate in the same environment with astonishing clarity. Two of the many contributors…

Computation and Language · Computer Science 2021-01-01 Karthikeya Ramesh Kaushik , Andrea E. Martin