Natural language syntax and first-order inference
Artificial Intelligence
On the syllogistic structure of object-oriented programming
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
A Qualitative Approach to Syllogistic Reasoning
Annals of Mathematics and Artificial Intelligence
Journal of Logic, Language and Information
Complexity of the Two-Variable Fragment with Counting Quantifiers
Journal of Logic, Language and Information
Natural Logic for Natural Language
Logic, Language, and Computation
No Syllogisms for the Numerical Syllogistic
Languages: From Formal to Natural
Journal of Logic and Computation
The data complexity of the syllogistic fragments of English
Proceedings of the 17th Amsterdam colloquium conference on Logic, language and meaning
Modal Logics for Region-based Theories of Space
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Hi-index | 0.00 |
We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: $$\begin{array}{ll}\mathbf{Some}\, a \,{\rm are} \,R-{\rm related}\, {\rm to}\, \mathbf{some} \,b;\\ \mathbf{Some}\, a \,{\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{all}\, b;\\ \mathbf{All}\, a\, {\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{some}\, b;\\ \mathbf{All}\, a\, {\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{all} \,b.\end{array}$$ Such primitives formalize sentences from natural language like `All students read some textbooks'. Here a, b denote arbitrary sets (of objects), and R denotes an arbitrary binary relation between objects. The language of the logic contains only variables denoting sets, determining the class of set terms, and variables denoting binary relations between objects, determining the class of relational terms. Both classes of terms are closed under the standard Boolean operations. The set of relational terms is also closed under taking the converse of a relation. The results of the paper are the completeness theorem with respect to the intended semantics and the computational complexity of the satisfiability problem.