Properties of substitutions and unifications

Recommendations

scientific article; zbMATH DE number 3858458
scientific article; zbMATH DE number 3968580
Higher order unification via explicit substitutions
Axiomatisation of substitution
Unification via the \(\lambda s_e\)-style of explicit substitutions
scientific article; zbMATH DE number 2080005
Confluence properties of weak and strong calculi of explicit substitutions
Explicit substitutions and reducibility
Substitutions into propositional tautologies

Cites work

scientific article; zbMATH DE number 3774914 (Why is no real title available?)
scientific article; zbMATH DE number 3413831 (Why is no real title available?)
A Machine-Oriented Logic Based on the Resolution Principle
An Efficient Unification Algorithm
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
Linear unification
The Concept of Weak Substitution in Theorem-Proving

Cited in

(46)

Finite limits and anti-unification in substitution categories
On equational theories, unification, and (un)decidability
On inductive inference of cyclic structures
Unification, weak unification, upper bound, lower bound, and generalization problems
A new algorithm for computing least generalization of a set of atoms
A compositional semantics for logic programs
Short story of the term “algebraic analysis”
scientific article; zbMATH DE number 177828 (Why is no real title available?)
A non-ground realization of the stable and well-founded semantics
The model evolution calculus as a first-order DPLL method
Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming
Investigations into proof structures
Reduction of cycle unification of type \(Cpg+r\)
Automated inferencing
scientific article; zbMATH DE number 1463151 (Why is no real title available?)
On complexity of the anti-unification problem
Unification for infinite sets of equations between finite terms
A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
On the membership problem for finite automata over symmetric groups
Compositional confluence criteria
Multi-valued logic programming semantics An algebraic approach
Implication of clauses is undecidable
Substitution, Complementarity, and Stability
A denotational semantics and dataflow construction for logic programs
Reduction rules for resolution-based systems
A Kleene Theorem for Forest Languages
Weighted systems of equations
On the cardinality computation problem for regular languages over symmetric groups
Essential unifiers
Epsilon-invariant substitutions and indefinite descriptions
C-expressions: A variable-free calculus for equational logic programming
A theory of observables for logic programs
Unification in combinations of collapse-free regular theories
Compositionality properties of SLD-derivations
Specialisation of Prolog and FCP programs using abstract interpretation
Determinisation of Relational Substitutions in Ordered Categories with Domain
Semantic models for concurrent logic languages
Detecting non-provable goals
On the termination of clause graph resolution
A rewrite-based type discipline for a subset of computer algebra
Learning from Łukasiewicz and Meredith: investigations into proof structures
Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
Improving precision of type analysis using non-discriminative union
scientific article; zbMATH DE number 3858458 (Why is no real title available?)
Unification in a combination of arbitrary disjoint equational theories

This page was built for publication: Properties of substitutions and unifications

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