Related papers: Logics for the Relational Syllogistic
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…
This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {\sf All $x$ are $y$} and {\sf Some $x$ are…
We propose a new modal logic endowed with a simple deductive system to interpret Aristotle's theory of the modal syllogism. While being inspired by standard propositional modal logic it is also a logic of terms that admits a (sound)…
We extend the language of the classical syllogisms with the sentence-forms "At most 1 p is a q" and "More than 1 p is a q". We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation…
We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are…
We study properties related to relevance in non-monotonic consequence relations obtained by systems of structured argumentation. Relevance desiderata concern the robustness of a consequence relation under the addition of irrelevant…
We present a coherence-based probability semantics and probability propagation rules for (categorical) Aristotelian syllogisms. For framing the Aristotelian syllogisms as probabilistic inferences, we interpret basic syllogistic sentence…
There is knowledge. There is belief. And there is tacit agreement.' 'We may talk about objects. We may talk about attributes of the objects. Or we may talk both about objects and their attributes.' This work inspects tacit agreements on…
Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…
We present a reading of the traditional syllogistics in a fragment of the propositional intuitionistic multiplicative linear logic and prove that with respect to a diagrammatic logical calculus that we introduced in a previous paper, a…
Aristotelian assertoric syllogistic, which is currently of growing interest, has attracted the attention of the founders of modern logic, who approached it in several (semantical and syntactical) ways. Further approaches were introduced…
With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…
Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…
We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…
We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…
We introduce and investigate a family of consequence relations with the goal of capturing certain important patterns of data-driven inference. The inspiring idea for our framework is the fact that data may reject, possibly to some degree,…
We add strong negation $N$ to classical logic and interpret the attack relation of "$x$ attacks $y$" in argumentation as $(x\to Ny)$. We write a corresponding object level (using $N$ only) classical theory for each argumentation network and…
In this paper, we propose a fresh perspective on argumentation semantics, to view them as a relational database. It offers encapsulation of the underlying argumentation graph, and allows us to understand argumentation semantics under a…
This paper describes a formalism that subsumes Peterson's intermediate quantifier syllogistic system, and extends the ideas by van Eijck on Aristotle's logic. Syllogisms are expressed in a concise form making use of and extending the…
Syllogism is a type of deductive reasoning involving quantified statements. The syllogistic reasoning scheme in the classical Aristotelian framework involves three crisp term sets and four linguistic quantifiers, for which the main support…