scientific article

From MaRDI portal

Revision as of 16:33, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3838762

Jump to:navigation, search

zbMath0903.03008MaRDI QIDQ3838762

Christoph Meyer, Florent Jacquemard, Christoph Weidenbach

Publication date: 13 August 1998

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

zbMATH Keywords

decidability unification tree automata Horn clause extensions of shallow equational theories

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Related Items (9)

The unification problem for confluent right-ground term rewriting systems. ⋮ Tree automata with equality constraints modulo equational theories ⋮ Modular proof systems for partial functions with Evans equality ⋮ Superposition as a decision procedure for timed automata ⋮ Superposition decides the first-order logic fragment over ground theories ⋮ Superposition for Fixed Domains ⋮ Harald Ganzinger’s Legacy: Contributions to Logics and Programming ⋮ From Search to Computation: Redundancy Criteria and Simplification at Work ⋮ SPASS-AR: a first-order theorem prover based on approximation-refinement into the monadic shallow linear fragment

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3838762&oldid=17436374"