A more expressive formulation of many sorted logic

DOI10.1007/BF00243207zbMath0642.68166OpenAlexW2029903604MaRDI QIDQ1101261

Anthony G. Cohn

Publication date: 1987

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00243207

zbMATH Keywords

controlsortingpolymorphismknowledge representationLLAMAmany sorted logicSchubert's steamrollersort array

Mathematics Subject Classification ID

Classical first-order logic (03B10)

Related Items (15)

Resolution for label-based formulas in hierarchical representation ⋮ Unification in sort theories and its applications ⋮ Reasoning without believing: on the mechanisation of presuppositions and partiality ⋮ The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning ⋮ An order-sorted logic for knowledge representation systems ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ Exploiting lattices in a theory of space and time ⋮ Completing sort hierarchies ⋮ Tableau methods for a logic with term declarations ⋮ Unnamed Item ⋮ A mechanization of strong Kleene logic for partial functions ⋮ Tesseral spatio-temporal reasoning for multi-dimensional data ⋮ Carving Up space: Steps towards construction of an absolutely complete theory of spatial regions ⋮ A typed resolution principle for deduction with conditional typing theory ⋮ Order-sorted logic programming with predicate hierarchy

This page was built for publication: A more expressive formulation of many sorted logic