A more expressive formulation of many sorted logic

DOI10.1007/BF00243207MaRDI QIDQ1101261zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(18)

• scientific article; zbMATH DE number 4053066 (Why is no real title available?)
• An order-sorted logic for knowledge representation systems
• Reasoning without believing: on the mechanisation of presuppositions and partiality
• Completing sort hierarchies
• Exploiting lattices in a theory of space and time
• scientific article; zbMATH DE number 6139879 (Why is no real title available?)
• A typed resolution principle for deduction with conditional typing theory
• Many-sorted first-order composition-nominative logic as institution
• A mechanization of strong Kleene logic for partial functions
• Strict coherence of conditional rewriting modulo axioms
• Unification in sort theories and its applications
• Carving up space: steps towards construction of an absolutely complete theory of spatial regions
• Tesseral spatio-temporal reasoning for multi-dimensional data
• Tableau methods for a logic with term declarations
• Order-sorted logic programming with predicate hierarchy
• The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
• scientific article; zbMATH DE number 7577582 (Why is no real title available?)
• Resolution for label-based formulas in hierarchical representation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101261)