The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase well-foundedness (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1984-1999 (16) 2000-2006 (18) 2007-2018 (15) 2019-2020 (3)
Publication types (Num. hits)
article(17) inproceedings(35)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 37 occurrences of 31 keywords

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