BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Graph explorer

Termination of LCTRSs

Logically Constrained Term Rewriting Systems (LCTRSs) provide a general framework for term rewriting with constraints. We discuss a simple dependency pair approach to prove termination of LCTRSs. We see that existing techniques transfer to the constrained setting in a natural way.

3 nodes2 linksoverview mapTermination of LCTRSs
SearchCollections
3 nodes2 links
Termination of LCTRSs3 visible / 3 total nodes / 2 links
AuthorshipTopic signalWTermination of LCTRSspreprint / 2016ACynthia KopResearcherTLogic in Computer Science2208 works
PaperSignal 102 links

Termination of LCTRSs

preprint / 2016

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached so you can return to the same research slice later.

Sign in

Public snapshots

1 shared view(s)