Computational aspects of an order-sorted logic with term declarations
From MaRDI portal
Publication:1801289
zbMATH Open0689.68001MaRDI QIDQ1801289FDOQ1801289
Authors: Manfred Schmidt-Schauß 
Publication date: 5 June 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mechanization of proofs and logical operations (03B35) Thue and Post systems, etc. (03D03) Abstract data types; algebraic specification (68Q65)
Cited In (48)
- Title not available (Why is that?)
- A note on assumptions about Skolem functions
- An order-sorted logic for knowledge representation systems
- Title not available (Why is that?)
- Strict coherence of conditional rewriting modulo axioms
- Solving divergence in Knuth--Bendix completion by enriching signatures
- A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics
- Higher-order unification, polymorphism, and subsorts
- Symbolic computation in Maude: some tapas
- Reasoning with preorders and dynamic sorts using free variable tableaux
- A typed resolution principle for deduction with conditional typing theory
- An order-sorted resolution in theory and practice
- Currying of order-sorted term rewriting systems
- The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
- Order-sorted logic programming with predicate hierarchy
- Automatic synthesis of logical models for order-sorted first-order theories
- Fuzzy types: A framework for handling uncertainty about types of objects
- A First Class Boolean Sort in First-Order Theorem Proving and TPTP
- The calculus of context relations
- Title not available (Why is that?)
- Unification in an extensional lambda calculus with ordered function sorts and constant overloading
- Title not available (Why is that?)
- A simple abstract semantics for equational theories
- Unification in pseudo-linear sort theories is decidable
- Unique-sort order-sorted theories : A description as monad morphisms
- Unification in a combination of arbitrary disjoint equational theories
- Regular expression order-sorted unification and matching
- Unification in sort theories and its applications
- Title not available (Why is that?)
- Projection: a unification procedure for tableaux in conceptual graphs
- Dynamically-typed computations for order-sorted equational presentations
- An algebraic semantics of higher-order types with subtypes
- Order-sorted equational unification revisited
- On the Completeness of Context-Sensitive Order-Sorted Specifications
- Equality and disequality constraints on direct subterms in tree automata
- Tableau methods for a logic with term declarations
- Title not available (Why is that?)
- Reduction and unification in lambda calculi with a general notion of subtype
- Another look at parameterization for oder-sorted algebraic specifications
- Semantics of order-sorted specifications
- A resolution principle for constrained logics
- A mechanization of strong Kleene logic for partial functions
- Regular substitution sets: A means of controlling E-unification
- Order-Sorted Rewriting and Congruence Closure
- A rewrite-based type discipline for a subset of computer algebra
- Title not available (Why is that?)
- On Skolemization in constrained logics
- Logics in Artificial Intelligence
This page was built for publication: Computational aspects of an order-sorted logic with term declarations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801289)
