Reverse Chaining for Answering Temporal Logical Queries | Zendy

Yannis Manolopoulos | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Reverse Chaining for Answering Temporal Logical Queries

Author(s) -

Yannis Manolopoulos

Publication year - 1992

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/35.6.666

Subject(s) - chaining , computer science , backward chaining , block (permutation group theory) , forward chaining , field (mathematics) , database , theoretical computer science , artificial intelligence , mathematics , combinatorics , psychology , expert system , pure mathematics , psychotherapist , inference engine

A possible structure for the past data of a partitoned temporal database is reverse field chaining. Under this technique field versions are chained by descending time. Exact analysis derives the expected number of block accesses when logical queries against a partitioned temporal database with reverse chaining are satisfied. Numerical results are given

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research