On the public citation graph

Unification in sort theories and its applications

https://doi.org/10.1007/bf02127750
0 signed · 57 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-50667-5_58openalex-snapshot
Logic programming with polymorphically order-sorted types
inferredcites →https://doi.org/10.1007/3-540-51081-8_101openalex-snapshot
Inductive proofs by specification transformations
inferredcites →https://doi.org/10.1007/3-540-52337-6openalex-snapshot
Sorts and Types in Artificial Intelligence
inferredcites →https://doi.org/10.1007/3-540-52337-6_18openalex-snapshot
Tableau calculus for order sorted logic
inferredcites →https://doi.org/10.1007/3-540-55210-3_181openalex-snapshot
Equality and disequality constraints on direct subterms in tree automata
inferredcites →https://doi.org/10.1007/3-540-55602-8_163openalex-snapshot
Sorted unification using set constraints
inferredcites →https://doi.org/10.1007/3-540-55602-8_164openalex-snapshot
An abstract view of sorted unification
inferredcites →https://doi.org/10.1007/3-540-55602-8_197openalex-snapshot
A many sorted logic with possibly empty sorts
inferredcites →https://doi.org/10.1007/3-540-56503-5_50openalex-snapshot
Solving systems of set constraints using tree automata
inferredcites →https://doi.org/10.1007/3-540-58156-1_26openalex-snapshot
A mechanization of strong Kleene logic for partial functions
inferredcites →https://doi.org/10.1007/3-540-58201-0_88openalex-snapshot
Pumping, cleaning and symbolic constraints solving
inferredcites →https://doi.org/10.1007/978-1-4612-2360-3_5openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/978-1-4684-0357-2_5openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/978-3-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/bf00047165openalex-snapshot
Journal of automated reasoning
inferredcites →https://doi.org/10.1007/bf00243207openalex-snapshot
A more expressive formulation of many sorted logic
inferredcites →https://doi.org/10.1007/bf01396685openalex-snapshot
Untersuchungen zur mehrsortigen Quantorenlogik
inferredcites →https://doi.org/10.1007/bf01448954openalex-snapshot
�ber deduktive Theorien mit mehreren Sorten von Grunddingen
inferredcites →https://doi.org/10.1007/bfb0018991openalex-snapshot
A new sorted logic
inferredcites →https://doi.org/10.1007/bfb0024065openalex-snapshot
Computational Aspects of an Order-Sorted Logic with Term Declarations
inferredcites →https://doi.org/10.1007/bfb0032066openalex-snapshot
Equational formulas in order-sorted algebras
inferredcites →https://doi.org/10.1016/0004-3702(85)90029-3openalex-snapshot
A mechanical solution of Schubert's Steamroller by many-sorted resolution
inferredcites →https://doi.org/10.1016/0004-3702(91)90009-9openalex-snapshot
The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
inferredcites →https://doi.org/10.1016/0004-3702(92)90055-3openalex-snapshot
An order-sorted logic for knowledge representation systems
inferredcites →https://doi.org/10.1016/0022-0000(78)90043-0openalex-snapshot
Linear unification
inferredcites →https://doi.org/10.1016/0304-3975(92)90302-vopenalex-snapshot
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
inferredcites →https://doi.org/10.1016/0304-3975(92)90322-7openalex-snapshot
Semantics of order-sorted specifications
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1016/b978-0-273-08718-2.50007-9openalex-snapshot
Many-Sorted Resolution and Paramodulation
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50121-4openalex-snapshot
An Ontology of Meta-Level Categories
inferredcites →https://doi.org/10.1016/c2013-0-11758-8openalex-snapshot
A Many-Sorted Calculus Based on Resolution and Paramodulation
inferredcites →https://doi.org/10.1016/j.ic.2005.02.001openalex-snapshot
19th International Conference on Automated Deduction (CADE-19)
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1016/s0747-7171(89)80012-4openalex-snapshot
Unification theory
inferredcites →https://doi.org/10.1016/s0747-7171(89)80036-7openalex-snapshot
Order-sorted unification
inferredcites →https://doi.org/10.1080/00029890.1985.11971545openalex-snapshot
AUTOMATED REASONING
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08555-9openalex-snapshot
A variant of a recursively unsolvable problem
inferredcites →https://doi.org/10.1093/jigpal/3.6.887openalex-snapshot
First-Order Tableaux with Sorts
inferredcites →https://doi.org/10.1111/j.1755-2567.1960.tb00558.xopenalex-snapshot
An improved proof procedure1
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.22028/d291-40500openalex-snapshot
A Resolution Calculus with Dynamic Sort Structures and Partial Functions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-48483-3_13openalex-snapshot
Rasiowa-Sikorski Deduction Systems: A Handy Tool for Computer Science Logics
inferred← citeshttps://doi.org/10.1007/3-540-58467-6_29openalex-snapshot
Unification in a sorted λ-calculus with term declarations and function sorts
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_99openalex-snapshot
Unification in pseudo-linear sort theories is decidable
inferred← citeshttps://doi.org/10.1007/3-540-61732-9_69openalex-snapshot
Reasoning with preorders and dynamic sorts using free variable tableaux
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_10openalex-snapshot
SPASS Version 3.5
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50010-2openalex-snapshot
Unification Theory
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.11.010openalex-snapshot
Order-sorted Equational Unification Revisited
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.08.002openalex-snapshot
Regular expression order-sorted unification and matching
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00320-6openalex-snapshot
Rasiowa–Sikorski deduction systems in computer science applications
inferred← citeshttps://doi.org/10.1080/11663081.2012.705962openalex-snapshot
Reasoning without believing: on the mechanisation of presuppositions and partiality
inferred← citeshttps://doi.org/10.32920/ryerson.14637291openalex-snapshot
A Logic of Actions Revisited
inferred← citeshttps://doi.org/10.32920/ryerson.14637291.v1openalex-snapshot
A Logic of Actions Revisited
inferred← citeshttps://doi.org/10.32920/ryerson.14637291.v2openalex-snapshot
A Logic of Actions Revisited
inferred← citeshttps://doi.org/10.4230/lipics.rta.2010.193openalex-snapshot
Order-Sorted Unification with Regular Expression Sorts
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.