An Efficient Unification Algorithm

Cited in

(only showing first 100 items - show all)

Safely composing security protocols
A hybrid programming scheme combining fuzzy-logic and functional-logic resources
Context unification with one context variable
Properties of substitutions and unifications
A parallel algorithm for the monadic unification problem
Associative-commutative unification
Unification problems with one-sided distributivity
Unification in combinations of collapse-free regular theories
A practically efficient and almost linear unification algorithm
A unification algorithm for second-order monadic terms
Finite generation of ambiguity in context-free languages
Inheritance hierarchies: Semantics and unifications
On the relationship of congruence closure and unification
Equational problems and disunification
Enumerating outer narrowing derivations for constructor-based term rewriting systems
Unfold/fold transformation of stratified programs
Horn clause programs with polymorphic types: Semantics and resolution
Completion for unification
The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
Contraction algebras and unification of (infinite) terms
Combining matching algorithms: The regular case
An order-sorted logic for knowledge representation systems
Generalizing completeness results for loop checks in logic programming
An improved general \(E\)-unification method
Probabilistic logic programming
C-expressions: A variable-free calculus for equational logic programming
Complete sets of transformations for general E-unification
Adventures in associative-commutative unification
How to win a game with features
Unification problem in equational theories
A proof procedure for the logic of hereditary Harrop formulas
A semantical framework for supporting subjective and conditional probabilities in deductive databases
Weighted systems of equations
On the duality of abduction and model generation in a framework for model generation with equality
Competing for the \(AC\)-unification race
Computing definite logic programs by partial instantiation
Completeness results for basic narrowing
Accelerating tableaux proofs using compact representations
Definite clause programs are canonical (over a suitable domain)
Unification in sort theories and its applications
Deciding the word problem in the union of equational theories.
On the complexity of equational problems in CNF
Binary decision diagrams for first-order predicate logic.
Relaxed unification -- proposal
TWAM: a certifying abstract machine for logic programs
Nominal unification with atom-variables
On deciding subsumption problems
Complete sets of unifiers and matchers in equational theories
Average-case analysis of Robinson's unification algorithm with two different variables
On the logic of unification
Higher-order unification revisited: Complete sets of transformations
Horn equational theories and paramodulation
An ordering linear unification algorithm
On equational theories, unification, and (un)decidability
Explicit versus implicit representations of subsets of the Herbrand universe.
Higher order unification via explicit substitutions
Complexity of nilpotent unification and matching problems.
Pair-independence and freeness analysis through linear refinement.
Nominal unification
Generalizing theorems in real closed fields
Kinded type inference for parametric overloading
Data storage interpretation of labeled modal logic
Herbrand's fundamental theorem in the eyes of Jean van Heijenoort
Faster linear unification algorithm
Nominal unification with letrec and environment-variables
A formal model for a linear time correctness condition of proof nets of multiplicative linear logic
An efficient labelled nested multiset unification algorithm
The fuzzy logic programming language FASILL: design and implementation
Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach
Automorphisms of types and their applications
Higher-order unification via combinators
Alternating two-way AC-tree automata
Thresholded semantic framework for a fully integrated fuzzy logic language
A modular order-sorted equational generalization algorithm
Symbolic protocol analysis for monoidal equational theories
Non-commutative proof construction: a constraint-based approach
Source-tracking unification
Terminological reasoning is inherently intractable
Unification modulo an equality theory for equational logic programming
General E-unification with eager variable elimination and a nice cycle rule
Effective codescent morphisms in the varieties determined by convergent term rewriting systems.
Vague domains, S-unification and logic programming
Deduction, strategies, and rewriting
An abstract decision procedure for satisfiability in the theory of recursive data types
Unification for infinite sets of equations between finite terms
Specifying and verifying organizational security properties in first-order logic
Certification of Termination Proofs Using CeTA
On complexity of the anti-unification problem
A Rewriting Logic Approach to Type Inference
Constraint and Logic Programming: Ugo Montanari’s Main Contributions and Introduction to the Volume Section
Models of Computation: A Tribute to Ugo Montanari’s Vision
Ugo Montanari and Friends
Unification with Singleton Tree Grammars
The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
Automatic theorem proving. II
Logic and functional programming by retractions : operational semantics
scientific article; zbMATH DE number 1231543 (Why is no real title available?)
Concolic testing in logic programming
A metamodel of access control for distributed environments: applications and properties
T-string unification: unifying prefixes in non-classical proof methods

This page was built for publication: An Efficient Unification Algorithm

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