Presentation 1996/11/22
A Logic Programming Language for Reasoning about Sequences
Hiroyuki Seki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A simple logic programming language for reasoning about sequences is defined and computational complexity of the basic problems for the language is investigated. The domain of a predicate is the set of finite sequences (strings) over an alphabet with concatenation as the only interpreted operator. A program in this language is a finite set of clauses. The paper mainly investigates decidability/complexity of the logical consequence problem. First, the problem is shown to be undecidable. Then, the paper introduces a subclass of programs, called simple productive systems (SPSs for short). The paper investigates how the complexity of the problem for SPS depends on syntactical restrictions such as right-linearity and non-erasingness.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) logic programming language / deductive database / computational complexity / sequence / string
Paper # COMP96-44
Date of Issue

Conference Information
Committee COMP
Conference Date 1996/11/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Logic Programming Language for Reasoning about Sequences
Sub Title (in English)
Keyword(1) logic programming language
Keyword(2) deductive database
Keyword(3) computational complexity
Keyword(4) sequence
Keyword(5) string
1st Author's Name Hiroyuki Seki
1st Author's Affiliation Graduate School of Information Science, Nara Institute of Science and Technology()
Date 1996/11/22
Paper # COMP96-44
Volume (vol) vol.96
Number (no) 389
Page pp.pp.-
#Pages 10
Date of Issue