Approximate pattern matching is expressible in transitive closure logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2000, Pages 157-167

  Lemstrom, Kjell ^a   Hella, Lauri ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; PATTERN MATCHING; PROBLEM SOLVING; QUERY LANGUAGES;

DETERMINISTIC TRANSITIVE CLOSURE LOGIC; FIRST ORDER LOGIC; TRANSITIVE CLOSURE LOGIC;

FORMAL LOGIC;

EID: 0033681417     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)