Pages that link to "Item:Q1074342"
From MaRDI portal
The following pages link to Properties of substitutions and unifications (Q1074342):
Displaying 41 items.
- Unification for infinite sets of equations between finite terms (Q287056) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- Multi-valued logic programming semantics An algebraic approach (Q673383) (← links)
- Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (Q915431) (← links)
- Automated inferencing (Q1070835) (← links)
- Unification in combinations of collapse-free regular theories (Q1099652) (← links)
- Specialisation of Prolog and FCP programs using abstract interpretation (Q1108783) (← links)
- Implication of clauses is undecidable (Q1110493) (← links)
- A rewrite-based type discipline for a subset of computer algebra (Q1176783) (← links)
- Semantic models for concurrent logic languages (Q1177921) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- C-expressions: A variable-free calculus for equational logic programming (Q1208416) (← links)
- Compositionality properties of SLD-derivations (Q1274454) (← links)
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles (Q1274977) (← links)
- Weighted systems of equations (Q1311966) (← links)
- A compositional semantics for logic programs (Q1314414) (← links)
- A denotational semantics and dataflow construction for logic programs (Q1318723) (← links)
- On the termination of clause graph resolution (Q1344889) (← links)
- SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs (Q1350529) (← links)
- Reduction of cycle unification of type \(Cpg+r\) (Q1383467) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- A theory of observables for logic programs (Q1854446) (← links)
- On inductive inference of cyclic structures (Q1924733) (← links)
- Learning from Łukasiewicz and Meredith: investigations into proof structures (Q2055843) (← links)
- Finite limits and anti-unification in substitution categories (Q2185886) (← links)
- The model evolution calculus as a first-order DPLL method (Q2389629) (← links)
- Essential unifiers (Q2494722) (← links)
- On the membership problem for finite automata over symmetric groups (Q2685503) (← links)
- On complexity of the anti-unification problem (Q3184519) (← links)
- Substitution, Complementarity, and Stability (Q3299267) (← links)
- A Kleene Theorem for Forest Languages (Q3618626) (← links)
- Short story of the term “algebraic analysis” (Q4716314) (← links)
- A New Algorithm for Computing Least Generalization of a Set of Atoms (Q5041770) (← links)
- Unification, weak unification, upper bound, lower bound, and generalization problems (Q5055751) (← links)
- Epsilon-invariant substitutions and indefinite descriptions (Q5176660) (← links)
- Detecting non-provable goals (Q5210774) (← links)
- Improving precision of type analysis using non-discriminative union (Q5437649) (← links)
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics (Q5958767) (← links)
- On the cardinality computation problem for regular languages over symmetric groups (Q6572947) (← links)
- Investigations into proof structures (Q6653096) (← links)
