scientific article
From MaRDI portal
Publication:3785940
zbMath0643.68054MaRDI QIDQ3785940
Deepak Kapur, Paliath Narendran
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A term equality problem equivalent to graph isomorphism, Default reasoning by deductive planning, Complexity of matching problems, An efficient labelled nested multiset unification algorithm, Implication of clauses is undecidable, Computing answers with model elimination, The complexity of counting problems in equational matching, Extensions of unification modulo ACUI, Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini, Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications, Interval propagation to reason about sets: Definition and implementation of a practical language, Unification and matching modulo nilpotence, Removing redundancy from a clause, Simple and Efficient Clause Subsumption with Feature Vector Indexing, AC-unification race: The system solving approach, implementation and benchmarks, Complexity of unification problems with associative-commutative operators, Efficient instance retrieval with standard and relational path indexing, Probabilistic inductive constraint logic, A formalisation of nominal C-matching through unification with protected variables, Complexity of nilpotent unification and matching problems., Formalising nominal C-unification generalised with protected variables, A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters
