2007 |
15 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Intruders with Caps.
RTA 2007: 20-35 |
2006 |
14 | EE | Barbara Fila,
Siva Anantharaman:
Automata for Positive Core XPath Queries on Compressed Documents.
LPAR 2006: 467-481 |
2005 |
13 | EE | Siva Anantharaman,
Jing Chen,
Gaétan Hains:
A Synchronous Process Calculus for Service Costs.
SEFM 2005: 435-444 |
12 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Closure properties and decision problems of dag automata.
Inf. Process. Lett. 94(5): 231-240 (2005) |
2004 |
11 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Unification Modulo ACUI Plus Distributivity Axioms.
J. Autom. Reasoning 33(1): 1-28 (2004) |
2003 |
10 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Unification Modulo ACU I Plus Homomorphisms/Distributivity.
CADE 2003: 442-457 |
9 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
ACID-Unification Is NEXPTIME-Decidable.
MFCS 2003: 169-178 |
1998 |
8 | EE | Siva Anantharaman,
Gilles Richard:
A Rewrite Mechanism for Logic Programs with Negation.
Theor. Comput. Sci. 192(1): 77-106 (1998) |
1995 |
7 | | Leo Bachmair,
Ta Chen,
I. V. Ramakrishnan,
Siva Anantharaman,
Jacques Chabin:
Experiments with Associative-Commutative Discrimination Nets.
IJCAI 1995: 348-355 |
6 | | Siva Anantharaman,
Gilles Richard:
A Rewrite Mechanism for Logic Programs with Negation.
RTA 1995: 163-178 |
5 | | Ta Chen,
Siva Anantharaman:
STORM: A MAny-to-One Associative-Commutative Matcher.
RTA 1995: 414-419 |
1990 |
4 | | Siva Anantharaman,
Maria Paola Bonacina:
An Application of Automated Equational Reasoning to Many-valued Logic.
CTRS 1990: 156-161 |
3 | | Siva Anantharaman,
Nirina Andrianarivelo:
Heuristical Criteria in Refutational Theorem Proving.
DISCO 1990: 184-193 |
2 | | Siva Anantharaman,
Jieh Hsiang:
Automated Proofs of the Moufang Identities in Alternative Rings.
J. Autom. Reasoning 6(1): 79-109 (1990) |
1989 |
1 | | Siva Anantharaman,
Jieh Hsiang,
Jalel Mzali:
SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion.
RTA 1989: 533-537 |