Hans Zantema - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 61 from 61

2009

2008

2007

2006

Matrix Interpretations for Proving Termination of Term RewritingJörg Endrullis, Johannes Waldmann, Hans Zantema. cade 2006: 574-588 [doi]

Automation of Recursive Path Ordering for Infinite Labelled Rewrite SystemsAdam Koprowski, Hans Zantema. cade 2006: 332-346 [doi]

2005

2004

Finding Finite Automata That Certify Termination of String RewritingAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. wia 2004: 134-145 [doi]

A Proof System and a Decision Procedure for Equality LogicOlga Tveretina, Hans Zantema. latin 2004: 530-539 [doi]

TORPA: Termination of Rewriting Proved AutomaticallyHans Zantema. RTA 2004: 95-104 [doi]

2003

Liveness in RewritingJürgen Giesl, Hans Zantema. RTA 2003: 321-336 [doi]

Simulating liveness by reduction strategiesJürgen Giesl, Hans Zantema. ENTCS, 86(4):641-656, 2003. [doi]

Resolution and binary decision diagrams cannot simulate each other polynomiallyJan Friso Groote, Hans Zantema. DAM, 130(2):157-171, 2003. [doi]

Transforming equality logic to propositional logicHans Zantema, Jan Friso Groote. ENTCS, 86(1):162-173, 2003. [doi]

2002

Relative Undecidability in Term Rewriting: I. The Termination HierarchyAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. iandc, 178(1):101-131, 2002. [doi]

Relative Undecidability in Term Rewriting: II. The Confluence HierarchyAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. iandc, 178(1):132-148, 2002. [doi]

Sizes of Ordered Decision TreesHans Zantema, Hans Leo Bodlaender. ijfcs, 13(3):445-458, 2002. [doi]

2001

Resolution and Binary Decision Diagrams Cannot Simulate Each Other PolynomiallyJan Friso Groote, Hans Zantema. ershov 2001: 33-38 [doi]

The Termination Hierarchy for Term RewritingHans Zantema. aaecc, 12(1/2):3-19, 2001. [doi]

A rewriting approach to binary decision diagramsHans Zantema, Jaco van de Pol. jlp, 49(1-2):61-86, 2001.

2000

Binary Decision Diagrams by Shard RewritingJaco van de Pol, Hans Zantema. mfcs 2000: 609-618 [doi]

A Complete Characterization of Termination of 0:::p::: 1:::q:::-> 1:::r::: 0:::s:::Hans Zantema, Alfons Geser. aaecc, 11(1):1-25, 2000. [doi]

Finding Small Equivalent Decision Trees is HardHans Zantema, Hans Leo Bodlaender. ijfcs, 11(2):343-354, 2000.

1999

Non-looping string rewritingAlfons Geser, Hans Zantema. ita, 33(3):279-302, 1999.

1997

Termination Modulo Equations by Abstract Commutation with an Application to IterationWan Fokkink, Hans Zantema. TCS, 177(2):407-423, 1997. [doi]

Relative Undecidability in the Termination Hierarchy of Single Rewrite RulesAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. tapsoft 1997: 237-248

Simple Termination of Rewrite SystemsAart Middeldorp, Hans Zantema. TCS, 175(1):127-158, 1997. [doi]

Termination of Context-Sensitive RewritingHans Zantema. RTA 1997: 172-186

1996

Total Termination of Term RewritingMaria C. F. Ferreira, Hans Zantema. aaecc, 7(2):133-162, 1996. [doi]

Relative Undecidability in Term RewritingAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. csl 1997: 150-166

Transforming Termination by Self-LabellingAart Middeldorp, Hitoshi Ohsaki, Hans Zantema. cade 1996: 373-387

1995

1994

Syntactical Analysis of Total TerminationMaria C. F. Ferreira, Hans Zantema. icalp 1994: 204-222

Well-foundedness of Term OrderingsMaria C. F. Ferreira, Hans Zantema. ctrs 1995: 106-123

Basic Process Algebra with Iteration: Completeness of its Equational AxiomsWan Fokkink, Hans Zantema. cj, 37(4):259-268, 1994.

Simple Termination RevisitedAart Middeldorp, Hans Zantema. cade 1994: 451-465

Termination of Term Rewriting: Interpretation and Type EliminationHans Zantema. JSC, 17(1):23-50, 1994.

1993

Total Termination of Term RewritingMaria C. F. Ferreira, Hans Zantema. RTA 1993: 213-227

1992

Type Removal in Term RewritingHans Zantema. ctrs 1993: 148-154

Termination of Term Rewriting by InterpretationHans Zantema. ctrs 1993: 155-167

Longest Segment ProblemsHans Zantema. SCP, 18(1):39-66, 1992.

1991

Minimizing Sums of Addition ChainsHans Zantema. jal, 12(2):281-307, 1991.

Sign in or sign up to see more results.

runs on WebDSL