Exploring the Landscape of Relational Syllogistic Logics
This work addresses foundational logical reasoning problems for researchers in formal logic and AI, but it is incremental as it builds on known systems.
The paper investigates relational syllogistic logics, a decidable family of logical systems for reasoning about relations, and proves completeness theorems and complexity results for a natural subfamily parametrized by constructors.
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.