Search results for "well-foundedness"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Solange Coupet-Grimal, William Delobel	An effective proof of the well-foundedness of the multiset path ordering.	Appl. Algebra Eng. Commun. Comput.	2006	DBLP DOI BibTeX RDF	Well-foundedness, Multiset path order, Termination, Constructive logic
77	Miquel Bofill, Albert Rubio	Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation.	CADE	2002	DBLP DOI BibTeX RDF
76	Amir Pnueli, Andreas Podelski, Andrey Rybalchenko	Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems.	TACAS	2005	DBLP DOI BibTeX RDF
66	Jean Goubault-Larrecq	Well-Founded Recursive Relations.	CSL	2001	DBLP DOI BibTeX RDF	well-foundedness, path orderings, Knuth-Bendix orderings, higher-order path orderings, graphs, automata, Termination, calculus
58	Henk Doornbos, Roland Carl Backhouse	Algebra of Program Termination.	Algebraic and Coalgebraic Methods in the Mathematics of Program Construction	2000	DBLP DOI BibTeX RDF
56	Jeremy Gow, Alan Bundy, Ian Green	Extensions to the Estimation Calculus.	LPAR	1999	DBLP DOI BibTeX RDF
47	Thomas E. Forster, John Kenneth Truss	Non-well-foundedness of well-orderable power sets.	J. Symb. Log.	2003	DBLP DOI BibTeX RDF
45	Shilong Ma, Yuefei Sui, Ke Xu 0001	Well limit behaviors of term rewriting systems.	Frontiers Comput. Sci. China	2007	DBLP DOI BibTeX RDF	Gröbner bases, well-foundedness, term rewriting systems, limits
38	Eitetsu Ken, Kenji Tojo, Kazuki Watanabe 0003, Masaki Natori	On principal types and well-foundedness of terms in ECC.	CoRR	2020	DBLP BibTeX RDF
38	Nicolai Kraus, Jakob von Raumer	Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type Theory.	LICS	2020	DBLP DOI BibTeX RDF
38	Stefano Bistarelli, Francesco Santini 0001	Well-Foundedness in Weighted Argumentation Frameworks.	JELIA	2019	DBLP DOI BibTeX RDF
38	Stefano Bistarelli, Francesco Santini 0001	Some Thoughts On Well-Foundedness in Weighted Abstract Argumentation.	KR	2018	DBLP BibTeX RDF
38	Stefano Berardi	Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness.	CSL	2015	DBLP DOI BibTeX RDF
38	Dandolo Flumini, Kentaro Sato	From hierarchies to well-foundedness.	Arch. Math. Log.	2014	DBLP DOI BibTeX RDF
38	Ian J. Hayes	Invariants and Well-Foundedness in Program Algebra.	ICTAC	2010	DBLP DOI BibTeX RDF
38	Thomas Chatain, Victor Khomenko	On the well-foundedness of adequate orders used for construction of complete unfolding prefixes.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
38	Mohammad Reza Mousavi 0001, Michel A. Reniers	On Well-Foundedness and Expressiveness of Promoted Tyft: Being Promoted Makes a Difference.	SOS@CONCUR	2006	DBLP DOI BibTeX RDF
38	Martin Hofmann 0001, Jaap van Oosten, Thomas Streicher	Well-foundedness in Realizability.	Arch. Math. Log.	2006	DBLP DOI BibTeX RDF
38	Shuly Wintner, Nissim Francez	Off-Line Parsability and the Well-Foundedness of Subsumption.	J. Log. Lang. Inf.	1999	DBLP DOI BibTeX RDF
38	Piotr Rudnicki, Andrzej Trybulec	On Equivalents of Well-Foundedness.	J. Autom. Reason.	1999	DBLP DOI BibTeX RDF
38	Shuly Wintner, Nissim Francez	Off-line Parsability and the Well-foundedness of Subsumption	CoRR	1997	DBLP BibTeX RDF
38	Maria C. F. Ferreira, Hans Zantema	Well-foundedness of Term Orderings.	CTRS	1994	DBLP DOI BibTeX RDF
38	John R. Steel	The Well-Foundedness of the Mitchell Order.	J. Symb. Log.	1993	DBLP DOI BibTeX RDF
38	Ran Rinat, Nissim Francez, Orna Grumberg	Infinite Trees, Markings and Well-Foundedness	Inf. Comput.	1988	DBLP DOI BibTeX RDF
38	Ran Rinat, Nissim Francez, Orna Grumberg	Infinite Trees, Markings and Well Foundedness.	CAAP	1986	DBLP DOI BibTeX RDF
38	Robert Goldblatt	An algebraic study of well-foundedness.	Stud Logica	1985	DBLP DOI BibTeX RDF
38	Jeremy E. Dawson, Rajeev Goré	A General Theorem on Termination of Rewriting.	CSL	2004	DBLP DOI BibTeX RDF	well-founded ordering, recursive path ordering, termination, rewriting
21	Arnold Beckmann	A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets.	Arch. Math. Log.	2002	DBLP DOI BibTeX RDF
20	Cédric Dégremont, Olivier Roy	Agreement Theorems in Dynamic-Epistemic Logic.	LORI	2009	DBLP DOI BibTeX RDF
20	Cédric Dégremont, Olivier Roy	Agreement theorems in dynamic-epistemic logic.	TARK	2009	DBLP DOI BibTeX RDF
20	José-Antonio Alonso, Joaquín Borrego-Díaz, María-José Hidalgo, Francisco-Jesús Martín-Mateos, José-Luis Ruiz-Reina	A Formally Verified Prover for the ALC Description Logic.	TPHOLs	2007	DBLP DOI BibTeX RDF
19	Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio	Higher-Order Termination: From Kruskal to Computability.	LPAR	2006	DBLP DOI BibTeX RDF
19	Shuvendu K. Lahiri, Shaz Qadeer	Verifying properties of well-founded linked lists.	POPL	2006	DBLP DOI BibTeX RDF	first-order axiomatization, heap abstraction, well-founded linked lists, decision procedure, automated theorem proving
19	Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio	Paramodulation with Non-Monotonic Orderings.	LICS	1999	DBLP DOI BibTeX RDF	term rewriting, automated deduction
19	Maria C. F. Ferreira, Hans Zantema	Syntactical Analysis of Total Termination.	ALP	1994	DBLP DOI BibTeX RDF
19	Jeffrey Sarnat, Carsten Schürmann 0001	Lexicographic Path Induction.	TLCA	2009	DBLP DOI BibTeX RDF
19	Nachum Dershowitz	On Lazy Commutation.	Languages: From Formal to Natural	2009	DBLP DOI BibTeX RDF
19	Roland Carl Backhouse, Henk Doornbos	Datatype-Generic Termination Proofs.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Allegory, Generic programming, Relation algebra, Programming methodology, Datatype
19	Cynthia Kop, Femke van Raamsdonk	A Higher-Order Iterative Path Ordering.	LPAR	2008	DBLP DOI BibTeX RDF
19	Pierre Courtieu, Julien Forest, Xavier Urbain	Certifying a Termination Criterion Based on Graphs, without Graphs.	TPHOLs	2008	DBLP DOI BibTeX RDF
19	Umut A. Acar, Amal Ahmed 0001, Matthias Blume	Imperative self-adjusting computation.	POPL	2008	DBLP DOI BibTeX RDF	mutable state, incremental computation, memoization, change propagation, self-adjusting computation, imperative programming, step-indexed logical relations
19	Steven Obua	Partizan Games in Isabelle/HOLZF.	ICTAC	2006	DBLP DOI BibTeX RDF
19	Enrico Franconi, Sergio Tessaris	The logic of RDF and SPARQL: a tutorial.	PODS	2006	DBLP DOI BibTeX RDF	semantic web, query language, data model
19	Adam Koprowski	Certified Higher-Order Recursive Path Ordering.	RTA	2006	DBLP DOI BibTeX RDF
19	Roland Carl Backhouse	Datatype-Generic Reasoning.	CiE	2006	DBLP DOI BibTeX RDF	allegory, generic programming, relation algebra, programming methodology, Datatype
19	Alexander Serebrenik, Danny De Schreye	Termination of Floating-Point Computations.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	floating point, numerical computation, termination analysis
19	James Brotherston	Cyclic Proofs for First-Order Logic with Inductive Definitions.	TABLEAUX	2005	DBLP DOI BibTeX RDF
19	Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti	Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case.	Appl. Algebra Eng. Commun. Comput.	1999	DBLP DOI BibTeX RDF	Semantic unification, Hypersets, NP-completeness, Bisimulations, Set theory
19	Yves Moinard, Raymond Rolland	Around a Powerful Property of Circumscriptions.	JELIA	1994	DBLP DOI BibTeX RDF
19	Julian C. Bradfield	A Proof Assistant for Symbolic Model-Checking.	CAV	1992	DBLP DOI BibTeX RDF
19	Françoise Bellegarde, Pierre Lescanne	Transformation Ordering.	TAPSOFT, Vol.1	1987	DBLP DOI BibTeX RDF
19	Nissim Francez, Dexter Kozen	Generalized Fair Termination.	POPL	1984	DBLP DOI BibTeX RDF