Back to Results
First PageMeta Content
Mathematical logic / Rewriting / Monotonic function / Monotonicity criterion / Abstraction / Mathematics / Formal languages / Logic in computer science


Dependency Pairs are a Simple Semantic Path Ordering Nachum Dershowitz School of Computer Science, Tel Aviv University Ramat Aviv, Israel
Add to Reading List

Document Date: 2013-08-26 10:13:12


Open Document

File Size: 312,71 KB

Share Result on Facebook

City

Malo / Berlin / Pittsburgh / Barcelona / Urbana / Ordering / Ramat Aviv / Oxford / /

Country

Germany / France / United Kingdom / Israel / Spain / /

Currency

WST / /

/

Facility

Tel Aviv University / Chapel Hill / University of Illinois / /

IndustryTerm

ordinary termination-proof systems / search space / term-rewriting systems / /

Organization

University of Illinois / Universitat Politècnica de Catalunya / Department of Computer Science / Simple Semantic Path Ordering Nachum Dershowitz School of Computer Science / Universität Ulm / Tel Aviv University / /

Person

Z. Sam Kamin / Ori Lahav / Pierre Réty / Cristina Borralleras Andreu / Sam Kamin / Rewriting Techniques / Maria Ferreira / Laurence Puel / Jean-Pierre Jouannaud / David Plaisted / Jean-Jacques Lévy / Jügen Giesl / Albert Rubio / Thomas Arts / Jacques Chabin / Proof / Computation / Cristina Borralleras / Nachum Dershowitz / Rewriting / Jürgen Giesl / Leo Bachmair / Charles Hoot / /

Position

editor / head / /

ProvinceOrState

Illinois / /

PublishedMedium

Theoretical Computer Science / Journal of Symbolic Computation / Lecture Notes in Computer Science / /

Technology

http / pdf / /

URL

http /

SocialTag