Exploring the Landscape of Relational Syllogistic Logics

09/03/2018
by   Alex Kruckman, et al.
0

This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and complexity results for a natural subfamily of relational syllogistic logics, parametrized by constructors for terms and for sentences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/10/2020

An Under-Approximate Relational Logic: Heralding Logics of Insecurity, Incorrect Implementation More

Recently, authors have proposed under-approximate logics for reasoning a...
research
07/04/2018

Logical rules as fractions and logics as sketches

In this short paper, using category theory, we argue that logical rules ...
research
03/15/2018

PAC-Reasoning in Relational Domains

We consider the problem of predicting plausible missing facts in relatio...
research
11/15/2017

K3, L3, LP, RM3, A3, FDE: How to Make Many-Valued Logics Work for You

We investigate some well-known (and a few not-so-well-known) many-valued...
research
03/30/2023

A declarative approach to data narration

This vision paper lays the preliminary foundations for Data Narrative Ma...
research
12/16/2019

Manifesto for Improved Foundations of Relational Model

Normalized relations extended with inherited attributes can be more fait...
research
10/14/2019

On Axiomatization of Lewis' Conditional Logics

This paper first shows that the popular axiomatic systems proposed by Nu...

Please sign up or login with your details

Forgot password? Click here to reset