## Stem lexicograph$ (all stems)

### 11 papers:

- CAV-2015-Ben-AmramG #complexity #ranking
- Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions (AMBA, SG), pp. 304–321.
- TACAS-2013-CookSZ #proving #termination
- Ramsey vs. Lexicographic Termination Proving (BC, AS, FZ), pp. 47–61.
- SAC-2009-BasgaluppBCFR #algorithm #induction #multi #named #search-based
- LEGAL-tree: a lexicographic multi-objective genetic algorithm for decision tree induction (MPB, RCB, ACPLFdC, AAF, DDR), pp. 1085–1090.
- TLCA-2009-SarnatS #induction
- Lexicographic Path Induction (JS, CS), pp. 279–293.
- ICML-2008-YamanWLd #approximate #modelling
- Democratic approximation of lexicographic preference models (FY, TJW, MLL, Md), pp. 1200–1207.
- KR-2008-YahiBLSP
- A Lexicographic Inference for Partially Preordered Belief Bases (SY, SB, SL, MS, OP), pp. 507–517.
- LATA-2007-BaturoR #standard #word
- Occurrence and Lexicographic Properties of Standard Sturmian Words (PB, WR), pp. 79–90.
- LATA-2007-StawikowskaO #on the
- On Star-Free Trace Languages and their Lexicographic Representations (KS, EO), pp. 541–552.
- RTA-2004-Toyama #higher-order #lisp #term rewriting #termination
- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms (YT), pp. 40–54.
- ICALP-1997-DiekertMM #equation #normalisation #using
- Solving Trace Equations Using Lexicographical Normal Forms (VD, YM, AM), pp. 336–346.
- ICALP-1987-Miyano #algorithm #problem
- The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms (SM), pp. 425–434.