Search results for "term-orderings"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
110	Alexander Serebrenik, Danny De Schreye	Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings.	LOPSTR (LNCS 2042: Selected Papers)	2000	DBLP DOI BibTeX RDF	acceptability, termination analysis, term-orderings
80	Guillem Godoy, Robert Nieuwenhuis	Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups.	Constraints An Int. J.	2004	DBLP DOI BibTeX RDF	symbolic constraints, built-in theories, automated deduction, term orderings
60	Joachim Steinbach	Extensions and Comparison of Simplification Orderings.	RTA	1989	DBLP DOI BibTeX RDF
57	Albert Rubio	Extension Orderings.	ICALP	1995	DBLP DOI BibTeX RDF
42	Salvador Lucas	mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.	RTA	2004	DBLP DOI BibTeX RDF
39	Evelyne Contejean, Claude Marché, Ana Paula Tomás, Xavier Urbain	Mechanically Proving Termination Using Polynomial Interpretations.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	polynomial interpretations, termination, term rewriting
39	Jürgen Stuber	Theory Path Orderings.	RTA	1999	DBLP DOI BibTeX RDF
29	Andreas Weiermann	A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets.	CiE	2009	DBLP DOI BibTeX RDF	well-partial orderings, maximal order types, finite multisets, well-quasi orderings, ordinals, term orderings
29	Leo Bachmair, Nachum Dershowitz	Equational Inference, Canonical Proofs, and Proof Orderings.	J. ACM	1994	DBLP DOI BibTeX RDF	term rewriting, rewrite systems, proof theory, equational logic, inference systems, term orderings
24	Bernhard Gramlich	Relating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems.	LPAR	1992	DBLP DOI BibTeX RDF
21	Stephan Schulz 0001	Empirical Properties of Term Orderings for Superposition.	PAAR@IJCAR	2022	DBLP BibTeX RDF
21	Akihisa Yamada 0002	Term Orderings for Non-reachability of (Conditional) Rewriting.	IJCAR	2022	DBLP DOI BibTeX RDF
21	Jan Jakubuv, Martin Suda 0001, Josef Urban	Automated Invention of Strategies and Term Orderings for Vampire.	GCAI	2017	DBLP DOI BibTeX RDF
21	Alexander B. Levin	Gröbner bases with respect to several term orderings and multivariate dimension polynomials.	ISSAC	2007	DBLP DOI BibTeX RDF	Gröbner basis, differential field extension, dimension polynomial, ore polynomials, p-dimensional ltration
21	Jinwang Liu, Zhuojun Liu, Mingsheng Wang	The term orderings which are compatible with composition II.	J. Symb. Comput.	2003	DBLP DOI BibTeX RDF
21	Alexander Serebrenik, Danny De Schreye	Non-tranformational termination analysis of logic programs, based on general term-orderings.	LOPSTR	2000	DBLP BibTeX RDF
21	Jürgen Giesl	Termination Analysis for Functional Programs using Term Orderings	SAS	1995	DBLP DOI BibTeX RDF
21	Maria C. F. Ferreira, Hans Zantema	Well-foundedness of Term Orderings.	CTRS	1994	DBLP DOI BibTeX RDF
21	François Bronsard, Uday S. Reddy, Robert W. Hasker	Induction using Term Orderings.	CADE	1994	DBLP DOI BibTeX RDF
21	Heinz Kredel	Admissible term orderings used in computer algebra systems.	SIGSAM Bull.	1988	DBLP DOI BibTeX RDF
21	Lorenzo Robbiano	Term Orderings on the Polynominal Ring.	European Conference on Computer Algebra (2)	1985	DBLP DOI BibTeX RDF
21	Claus-Peter Wirth	History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!	Mechanizing Mathematical Reasoning	2005	DBLP DOI BibTeX RDF
15	Cristina Borralleras, Albert Rubio	Orderings and Constraints: Theory and Practice of Proving Termination.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
15	Deepak Kapur, Paliath Narendran, Lida Wang	An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation.	RTA	2003	DBLP DOI BibTeX RDF
12	Bernd Löchner	Things to Know when Implementing KBO.	J. Autom. Reason.	2006	DBLP DOI BibTeX RDF	Knuth-Bendix ordering, program transformation
12	Andreas Abel 0001	Towards Generic Programming with Sized Types.	MPC	2006	DBLP DOI BibTeX RDF
12	Salvador Lucas	Polynomials for Proving Termination of Context-Sensitive Rewriting.	FoSSaCS	2004	DBLP DOI BibTeX RDF	Programming languages, termination, rewriting
12	Elizabeth L. Mansfield, Ágnes Szántó	Elimination theory for differential difference polynomials.	ISSAC	2003	DBLP DOI BibTeX RDF	Gröbner basis, differential polynomial, ore algebra, difference equation
12	Michaël Rusinowitch	Rewriting for Deduction and Verification.	RTA	2001	DBLP DOI BibTeX RDF
12	Guillem Godoy, Robert Nieuwenhuis	Paramodulation with Built-in Abelian Groups.	LICS	2000	DBLP DOI BibTeX RDF	term rewriting, automated deduction
12	Ashish Tiwari 0001, Leo Bachmair, Harald Rueß	Rigid E-Unification Revisited.	CADE	2000	DBLP DOI BibTeX RDF