Algebraic reasoning for probabilistic action systems and while-loopsMEINICKE, Larissa; HAYES, Ian J.Acta informatica. 2008, Vol 45, Num 5, pp 321-382, issn 0001-5903, 62 p.Article

Structuring transformational developments: a case study based on earley's recognizerPARTSCH, H.Science of computer programming. 1984, Vol 4, Num 1, pp 17-44, issn 0167-6423Article

Implicit rule formation in symbolic computationBARNETT, M. P.Computers & mathematics with applications (1987). 1993, Vol 26, Num 10, pp 35-50, issn 0898-1221Article

A general framework for types in graph rewritingKÖNIG, Barbara.Acta informatica. 2005, Vol 42, Num 4-5, pp 349-388, issn 0001-5903, 40 p.Article

Automated and readable simplification of trigonometric expressionsHONGGUANG FU; XIUQIN ZHONG; ZHENBING ZENG et al.Mathematical and computer modelling. 2006, Vol 44, Num 11-12, pp 1169-1177, issn 0895-7177, 9 p.Article

An intermediate database language and its rule-based transformation to different database languagesPIATETSKY-SHAPIRO, G; JAKOBSON, G.Data & knowledge engineering. 1987, Vol 2, Num 1, pp 1-29, issn 0169-023XArticle

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUTGRAMM, Jens; HIRSCH, Edward A; NIEDERMEIER, Rolf et al.Discrete applied mathematics. 2003, Vol 130, Num 2, pp 139-155, issn 0166-218X, 17 p.Conference Paper

AC unification through order-sorted AC1 unificationDOMENJOUD, E.Journal of symbolic computation. 1992, Vol 14, Num 6, pp 537-556, issn 0747-7171Article

THE USE OF TRANSFORMATIONS TO IMPLEMENT AN ALGORITHMTOWNLEY JA.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 381-406; BIBL. 12 REF.Conference Paper

HOW TO FIND INVARIANTS FOR COLOURED PETRI NETSJENSEN K.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 327-338; BIBL. 6 REF.Conference Paper

Rules + strategies for transforming lazy functional logic programsALPUENTE, Maria; FALASCHI, Moreno; MORENO, Ginés et al.Theoretical computer science. 2004, Vol 311, Num 1-3, pp 479-525, issn 0304-3975, 47 p.Article

Equational formulae with membership constraintsCOMON, H; DELOR, C.Information and computation (Print). 1994, Vol 112, Num 2, pp 167-216, issn 0890-5401Article

Improving recursive functions by inverting the order of evaluationBOITEN, E. A.Science of computer programming. 1992, Vol 18, Num 2, pp 139-179, issn 0167-6423Article

Equivalence and transformation of extended algebraic operators in fuzzy relational databasesXIAOHUI TANG; GUOQING CHEN.Fuzzy sets and systems. 2006, Vol 157, Num 12, pp 1581-1596, issn 0165-0114, 16 p.Article

An introduction to boundary logic with the Losp Deductive EngineBRICKEN, W. M; GULLICHSEN, E.Future computing systems. 1990, Vol 2, Num 4, pp 299-375, 77 p.Article

A TRANSFORMATIONAL DERIVATION OF A PARSING ALGORITHM IN A HIGH-LEVEL LANGUAGEDEAK E.1981; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1981; VOL. 7; NO 1; PP. 23-31; BIBL. 16 REF.Article