scientific article; zbMATH DE number 3349328
From MaRDI portal
zbMath0219.68044MaRDI QIDQ5624680
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Higher-order pattern anti-unification in linear time, Evolution of rule-based programs, A New Algorithm for Computing Least Generalization of a Set of Atoms, Polymorphic type inference with overloading and subtyping, Metaphors and heuristic-driven theory projection (HDTP), Order-sorted equational generalization algorithm revisited, The Girard-Reynolds isomorphism, An algebraic semantics approach to the effective resolution of type equations, Lower bounds on type checking overloading, Static correctness of hierarchical procedures, Most specific logic programs, A higher-order calculus and theory abstraction, Unranked second-order anti-unification, A Library of Anti-unification Algorithms, The Girard-Reynolds isomorphism (second edition), Schema induction for logic program synthesis, Learning unions of tree patterns using queries, On the generation of quantified lemmas, Existential type systems between Church and Curry style (type-free style), Analogical logic program synthesis algorithm that can refute inappropriate similarities, Varieties of chain-complete algebras, Variant-based equational anti-unification, A modular order-sorted equational generalization algorithm, Type inference with subtypes, The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause, Anti-unification and the theory of semirings, Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach, E-generalization using grammars, Reduction rules for resolution-based systems, The extended calculus of constructions (ECC) with inductive types, Learning unions of tree patterns using queries, Efficient parallel term matching and anti-unification, The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types, C-expressions: A variable-free calculus for equational logic programming, Heuristic-Driven Theory Projection: An Overview, A game semantics for generic polymorphism, On Generalization and Subsumption for Ordered Clauses, A Modular Equational Generalization Algorithm, Analogical program derivation based on type theory, A certifying square root and division elimination, Synthesis of rewrite programs by higher-order and semantic unification, A Generic Framework for Higher-Order Generalizations., Order-Sorted Generalization, A framework for approximate generalization in quantitative theories, Mixtus: An automatic partial evaluator for full Prolog, The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus, Sound and complete partial deduction with unfolding based on well-founded measures, Anti-unification for unranked terms and hedges, Logic program synthesis from incomplete specifications, A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
