17 citations · 46 across the 16 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2016★ 17 cited
Nominal Unification of Higher Order Expressions with Recursive Let
Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy +1
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also…
cs.PL2010★ 3 cited
Strategies in PRholog
Besik Dundua, Temur Kutsia, Mircea Marin
PRholog is an experimental extension of logic programming with strategic conditional transformation rules, combining Prolog with Rholog calculus. The rules perform nondeterministic…