scientific article

zbMath1109.68499MaRDI QIDQ3427354

No author found.

Publication date: 19 March 2007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Grammars and rewriting systems (68Q42)

Related Items (19)

A maximal-literal unit strategy for horn clauses ⋮ Extending Bachmair's method for proof by consistency to the final algebra ⋮ Sound generalizations in mathematical induction ⋮ Structures for abstract rewriting ⋮ Induction using term orders ⋮ Tree algebras and varieties of tree languages ⋮ The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability ⋮ Towards a foundation of completion procedures as semidecision procedures ⋮ An algebraic semantics for structured transition systems and its application to logic programs ⋮ Well rewrite orderings and well quasi-orderings ⋮ Termination Tools in Ordered Completion ⋮ Pattern-matching spi-calculus ⋮ A general framework to build contextual cover set induction provers ⋮ Formalizing Bachmair and Ganzinger's ordered resolution prover ⋮ Order-Sorted Generalization ⋮ On the modelling of search in theorem proving -- towards a theory of strategy analysis ⋮ A categorical approach to unification of generalised terms1 1This work has been developed as a cooperation organised within COST 274. ⋮ Induction = I-axiomatization + first-order consistency. ⋮ Deductive and inductive synthesis of equational programs

This page was built for publication: