Výsledky vyhledávání - "Knuth-Bendix Algorithm"

A Path-Deformation Framework for Determining Weighted Genome Rearrangement Distance

Autoři: Sangeeta Bhatia Attila Egri-Nagy Stuart Serdoz a další

Zdroj: Frontiers in Genetics, Vol 11 (2020)

Témata: genome rearrangement, inversion, group theory, Knuth-Bendix algorithm, rewriting systems, Genetics, QH426-470

Popis souboru: electronic resource

Relation: https://www.frontiersin.org/article/10.3389/fgene.2020.01035/full; https://doaj.org/toc/1664-8021

Přístupová URL adresa: https://doaj.org/article/735a6526682349db88cba76d0fcbf006

Solving Equality Reasoning Problems with a Connection Graph Theorem Prover

Autoři: Präcklein, Axel

Témata: ddc:004, Equality reasoning, resolution, Knuth-Bendix algorithm, paramodulation

Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm

Autoři: Bancerek, Grzegorz

Zdroj: Formalized Mathematics. 22:37-56

Témata: abstract reduction systems, 0202 electrical engineering, electronic engineering, information engineering, Knuth-Bendix algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://content.sciendo.com/downloadpdf/journals/forma/22/1/article-p37.pdf
http://mizar.uwb.edu.pl/fm/2014-22/pdf22-1/absred_0.pdf
https://eudml.org/doc/266729
https://repozytorium.uwb.edu.pl/jspui/handle/11320/3701
https://fm.mizar.org/2014-22/pdf22-1/absred_0.pdf
https://dblp.uni-trier.de/db/journals/fm/fm22.html#Bancerek14
http://www.mizar.org/fm/2014-22/pdf22-1/absred_0.pdf

Efficiency issues in the kbmag procedure

Autoři: Jerry Swan

Zdroj: The Journal of Logic and Algebraic Programming. 80:444-452

Témata: Automatic groups, String rewriting, Knuth–Bendix algorithm, Computational Theory and Mathematics, Logic, 0101 mathematics, 01 natural sciences, Software, Theoretical Computer Science

Přístupová URL adresa: https://core.ac.uk/display/81959250
https://www.sciencedirect.com/science/article/pii/S1567832610001025
https://doi.org/10.1016/j.jlap.2010.11.001
https://dblp.uni-trier.de/db/journals/jlp/jlp80.html#Swan11

RRLab : Rewrite Rule Labor

Autoři: Thomas, Christoph

Témata: ddc:004, Finite / unique termination, Rewrite rule system, Normal form, Superposition, Inductionless induction, Endliche / eindeutige Terminierung, Knuth-Bendix Algorithmus, Normalform, Initial algebra approach, Critical pair, Abstract data type, Unification, Initiale Algebrasemantik, Knuth-Bendix Algorithm, Rewrite Rule System, Abstrakter Datentyp, Kritisches Paar, Unifikation, Induktionslose Induktion

Declarative Representation of Algorithms of Completion by Critical Pairs: Declarative representation of algorithms of completion by critical pairs

Autoři: V. A. Volkov

Zdroj: Cybernetics and Systems Analysis. 37:795-799

Témata: Buchberger algorithm, APS algebraic system, algebraic programming, Knuth-Bendix algorithm, 0102 computer and information sciences, declarative representation of critical pairs, 0101 mathematics, Symbolic computation and algebraic computation, computer algebra, properties of termination and correction, logical programming, completion algorithms, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/article/10.1023%2FA%3A1014569528986

The Word Problem for Groups with Regular Relations – Improvement of the Knuth-Bendix Algorithm: The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm

Autoři: Chuya Hayashi

Zdroj: Publications of the Research Institute for Mathematical Sciences. 28:913-942

Témata: word problem, Generators, relations, and presentations of groups, algorithm, Word problems, other decision problems, connections with logic and automata (group-theoretic aspects), confluent set of relations, 01 natural sciences, Cayley graph, regular confluent set of relations, hyperbolic groups, Grammars and rewriting systems, finite group presentation, finite state automaton, Software, source code, etc. for problems pertaining to group theory, Knuth-Bendix algorithm, 0101 mathematics, finite presentations

Popis souboru: application/xml

Přístupová URL adresa: http://www.ems-ph.org/journals/show_pdf.php?issn=0034-5318&vol=28&iss=6&rank=2
https://zbmath.org/597463
https://doi.org/10.2977/prims/1195167732
https://www.ems-ph.org/journals/show_abstract.php?issn=0034-5318&vol=28&iss=6&rank=2
https://www.jstage.jst.go.jp/article/kyotoms1969/28/6/28_6_913/_pdf
https://www.ems-ph.org/journals/show_pdf.php?issn=0034-5318&vol=28&iss=6&rank=2
https://ci.nii.ac.jp/naid/130003585221

Reachability Test in Petri Nets by Gröbner Bases

Autoři: Olga Caprotti Alois Ferscha Hoon Hong a další

Přispěvatelé: Olga Caprotti Alois Ferscha Hoon Hong a další

Zdroj: http://www.soft.uni-linz.ac.at/Research/Publications/Documents/tr95groebner.ps.gz.

Témata: Petri Nets, Reachability Problem, Equality Problem, Canonical Algebraic Simplification, Knuth-Bendix Algorithm, Grobner Bases Algorithm

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2327

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2327
http://www.soft.uni-linz.ac.at/Research/Publications/Documents/tr95groebner.ps.gz

Complete Sets of Reductions for Some Equational Theories: Complete sets of reductions for some equational theories

Autoři: Mark E. Stickel Gerald E. Peterson

Zdroj: Journal of the ACM. 28:233-264

Témata: complete unification algorithms, Software, source code, etc. for problems pertaining to general algebraic systems, finite termination property, free commutative groups, 0102 computer and information sciences, 02 engineering and technology, Boolean algebra, 01 natural sciences, distributive lattices, unique termination property, extension of the Knuth-Bendix algorithm for finding complete sets of reductions, theory of a finite number of associative and commutative functions, 0202 electrical engineering, electronic engineering, information engineering, commutative rings with unit, well-founded partial order, Theorem proving (deduction, resolution, etc.)

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jacm/jacm28.html#PetersonS81
https://dl.acm.org/doi/10.1145/322248.322251
https://dl.acm.org/ft_gateway.cfm?id=322251&type=pdf
https://doi.org/10.1145/322248.322251

On Proving Uniform Termination and Restricted Termination of Rewriting Systems: On proving uniform termination and restricted termination of rewriting systems

Autoři: John V. Guttag Deepak Kapur David R. Musser

Zdroj: SIAM Journal on Computing. 12:189-214

Témata: equational axioms, rewrite rules, rewrite dominoes, 0102 computer and information sciences, 02 engineering and technology, restricted termination, uniform termination, 01 natural sciences, term rewriting systems, confluence, 0202 electrical engineering, electronic engineering, information engineering, global finiteness, canonical, Knuth-Bendix algorithm, overlap closure, Abstract data types, algebraic specification, Theorem proving (deduction, resolution, etc.)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3835346
https://doi.org/10.1137/0212012
https://locus.siam.org/doi/abs/10.1137/0212012
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp12.html#GuttagKM83
https://epubs.siam.org/doi/10.1137/0212012

Knuth-Bendix procedure and non deterministic behavior - an example

Autoři: Gnaedig, I.

Témata: nondeterminism, rules ordering, Software, source code, etc. for problems pertaining to computer science, Knuth-Bendix algorithm, rewriting rules, completion, Theorem proving (deduction, resolution, etc.), rewriting systems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/4080964

Exact computation sequences

Autoři: Pelin, Alex

Témata: free algebras, Grammars and rewriting systems, exact computation sequences, Knuth-Bendix algorithm

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/975358