Equivalent Transformation in an Extended Space for Solving Query-Answering Problems

Akama, Kiyoshi; Nantajeewarawat, Ekawit

doi:10.1007/978-3-319-05476-6_24

Cited by 7 publications

(8 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is a typical form of the definition of a built-in atom. Other examples of built-in atom definitions are (11): (11) where (i) iff 1 t and 2 t are numbers such that 12 tt  , and (ii) iff 1 t , 2 t , and 3 t are numbers such that 1 2 3 t t t .…”

Section: A the Meanings Of Basic Built-in Atomsmentioning

confidence: 99%

“…, () ( Next, the rule r 2 is applied. The application introduces a new variable *z and transforms C 10 into: [11], C 14 is transformed into:…”

Section: B Computation By Using Et Rulesmentioning

confidence: 99%

“…By elimination of subsumed clauses [11], C 17 and C 19 are removed. C 18 is no longer useful for forwarding [13] and is removed.…”

Section: B Computation By Using Et Rulesmentioning

confidence: 99%

“…Based on the equivalent transformation (ET) principle, we invented the solution method for QA problems [11], which can solve a far larger class of QA problems compared to definite-clause-based QA problems and description-logic-based QA Problems. Moreover, the ETbased method provides more flexible solution paths than resolution-based methods and tableau-based methods for description logics.…”

Section: Introductionmentioning

confidence: 99%

“…Further application of the rule r 1 to C 11 yields:By side change transformation[11] of the a not-atom, C 12 is transformed into the multi-head clause below. 13 is a conventional clause consisting of only simple atoms.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Constructing Knowledge Representation Systems with First-Order Formulas as Atoms

Akama¹,

Nantajeewarawat²,

Yoshida³

2014

JIII

Self Cite

View full text Add to dashboard Cite

This paper proposes a knowledge representation system by extension of the concept of atom. Not only conventional simple atoms, but also atoms representing first-order formulas, which are called formula atoms, are used. By this extension, predicates, logical connectives, and quantifiers may occur in atoms, and can be regarded as objects in the same class, allowing more natural translation from natural language sentences into extended formulas and more flexible computation for solving logical problems. 

show abstract

Section: A the Meanings Of Basic Built-in Atomsmentioning

confidence: 99%

“…, () ( Next, the rule r 2 is applied. The application introduces a new variable *z and transforms C 10 into: [11], C 14 is transformed into:…”

Section: B Computation By Using Et Rulesmentioning

confidence: 99%

“…By elimination of subsumed clauses [11], C 17 and C 19 are removed. C 18 is no longer useful for forwarding [13] and is removed.…”

Section: B Computation By Using Et Rulesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning