„Knuth-Bendix completion“

Suchergebnisse

1.000+ Treffer

• A Homotopical Completion Procedure with Applications to Coherence of Monoids
  Guiraud, Yves ; Malbos, Philippe ; Mimram, Samuel 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Integration of Rewriting, Narrowing, Compilation, and Heuristics for Equality Reasoning in Resolution-Based Theorem Proving
  Präcklein, Axel 1999 Technische Universität Kaiserslautern, Fachbereich Informatik
• The application of goal-oriented heuristics for proving equational theorems via the unfailing Knuth-Bendix completion procedure. – A case study: lattice ordered groups
  Fuchs, Matthias 2024 Saarländische Universitäts- und Landesbibliothek
• About Changing the Ordering During Knuth-Bendix Completion
  Sattler-Klein, Andrea 2024 Saarländische Universitäts- und Landesbibliothek
• Integration of Rewriting, Narrowing, Compilation, and Heuristics for Equality Reasoning in Resolution-Based Theorem Proving
  Präcklein, Axel 2024 Saarländische Universitäts- und Landesbibliothek
• About changing the ordering during Knuth-Bendix completion
  Sattler-Klein, Andrea 1999 Technische Universität Kaiserslautern, Fachbereich Informatik
• Optimizing mkbTT
  Winkler, Sarah ; Sato, Haruhiko ; Middeldorp, Aart ; Kurihara, Masahito 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion
  Sternagel, Christian ; Thiemann, René 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk)
  Okada, Mitsuhiro 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Maximal Completion
  Klein, Dominik ; Hirokawa, Nao 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Experiments with multi-threated Knuth Bendix completion
  Bündgen, Reinhard ; Göbel, Manfred ; Küchlin, Wolfgang 1994 WSI
• Integration of rewriting, narrowing, compilation, and heuristics for equality reasoning in resolution-based theorem proving
  Präcklein, Axel
• Knuth-Bendix completion of Horn clause programs for restricted linear resolution and paramodulation
  Bertling, Hubert
• An implementation and investigation of the Knuth-Bendix completion procedure
  Küchlin, Wolfgang 1983 Univ., Inst. für Informatik
• Time comparison of four implementations of the Knuth-Bendix completion procedure
  Fortenbacher, Albrecht 1982 Inst. für Informatik I, Univ.
• Paramodulation and Knuth–Bendix Completion with Nontotal and Nonmonotonic Orderings
  Bofill, Miquel ; Godoy, Guillem ; Nieuwenhuis, Robert ; Rubio, Albert
• Knuth-Bendix completion versus fold-unfold – a comparative study in program synthesis
  Fronhöfer, Bertram ; Furbach, Ulrich 1986 UniBw München, Fak. für Informatik
• On the termination of the Knuth-Bendix completion algorithm
  Avenhaus, Jürgen 1984 Fachbereich Informatik, Univ.
• Termination of Ground Non-Symmetric Knuth-Bendix Completion
  Struth, Georg 2006 Universität Augsburg
• Declarative Graph Algorithms via Knuth-Bendix Completion
  Struth, Georg 2006 Universität Augsburg