Linear unification
From MaRDI portal
Publication:1243575
DOI10.1016/0022-0000(78)90043-0zbMATH Open0371.68013OpenAlexW4213232664WikidataQ56092429 ScholiaQ56092429MaRDI QIDQ1243575FDOQ1243575
Authors: K. Appert 
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(78)90043-0
Cites Work
Cited In (84)
- Source-tracking unification
- Free-variable semantic tableaux for the logic of fuzzy inequalities
- Referential logic of proofs
- Graph unification and matching
- Book review of: Matthias Baaz and Alexander Leitsch, Methods of cut-elimination
- Logic and functional programming by retractions : operational semantics
- Data storage interpretation of labeled modal logic
- Title not available (Why is that?)
- Proof schemata in Hilbert-type axiomatic theories
- The negation elimination from syntactic equational formula is decidable
- Accelerating tableaux proofs using compact representations
- Automata-driven efficient subterm unification
- Distinct fringe subtrees in random trees
- Computational complexity and constraint logic programming languages
- On complexity of the anti-unification problem
- Tight complexity bounds for term matching problems
- Unification of drags and confluence of drag rewriting
- Some complexity theoretic aspects of AC rewriting
- Refinement of bounds of the height of terms in the most general unifier
- Automatic theorem proving. II
- A new approach to general E-unification based on conditional rewriting systems
- C-expressions: A variable-free calculus for equational logic programming
- The undecidability of the second-order unification problem
- Average-case analysis of unification algorithms
- A note on the parallel complexity of anti-unification
- Projecting CLP(\({\mathcal R}\)) constraints
- Equality and abductive residua for Horn clauses
- On the parameterized complexity of associative and commutative unification
- On the parameterized complexity of associative and commutative unification
- On equational theories, unification, and (un)decidability
- Complete sets of transformations for general E-unification
- Unification theory
- Incorporating equality into logic programming via surface deduction
- On the relationship of congruence closure and unification
- Horn clause programs with polymorphic types: Semantics and resolution
- Unifications, deunifications, and their complexity
- Optimal parallel algorithms for forest and term matching
- Using multiset discrimination to solve language processing problems without hashing
- The complexity of type inference for higher-order typed lambda calculi
- The correctness of Newman's typability algorithm and some of its extensions
- Effective codescent morphisms in the varieties determined by convergent term rewriting systems.
- Terminological reasoning is inherently intractable
- A rational reconstruction of the domain of feature structures
- Unification for infinite sets of equations between finite terms
- On the tree-transformation power of XSLT
- Herbrand's fundamental theorem in the eyes of Jean van Heijenoort
- An almost linear Robinson unification algorithm
- Equational unification, word unification, and 2nd-order equational unification
- Faster linear unification algorithm
- On Herbrand's theorem
- Linear unification of higher-order patterns
- Polymorphic type inference and containment
- Unification in a combination of arbitrary disjoint equational theories
- Binary decision diagrams for first-order predicate logic.
- Complexity of unification problems with associative-commutative operators
- Fundamental properties of infinite trees
- Properties of substitutions and unifications
- Unification problems with one-sided distributivity
- About the Paterson-Wegman linear unification algorithm
- Nominal unification
- Unification in sort theories and its applications
- On the time and tape complexity of weak unification
- A practical unification algorithm
- Decomposable theories
- Unifiability is complete for co-N Log Space
- Complete sets of unifiers and matchers in equational theories
- An ordering linear unification algorithm
- A practically efficient and almost linear unification algorithm
- Context unification with one context variable
- Theory and practice of unparsed patterns for metacompilation
- Automated theorem proving methods
- Complete symbolic reachability analysis using back-and-forth narrowing
- On the logic of unification
- Heterogeneous active agents. III: Polynomially implementable agents
- Working with ARMs: Complexity results on atomic representations of Herbrand models
- Simple second-order languages for which unification is undecidable
- Semi-unification
- Finite generation of ambiguity in context-free languages
- Constraint Satisfaction Problems with Infinite Templates
- A view of computability on term algebras
- The single-conclusion proof logic and inference rules specification
- Unification problem in equational theories
- A parallel algorithm for the monadic unification problem
- Rigid E-unification: NP-completeness and applications to equational matings
This page was built for publication: Linear unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243575)
