January 01, 2011 conference-paper A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems Lecture notes in computer science DOI: 10.1007/978-3-642-22438-6_32 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 22 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access A Dependency Pair Framework for Relative Termination of Term Rewriting 2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 2 citations Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs 2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 7 citations 2 results References 0