QUERYING DATALOG PROGRAMS WITH TEMPORAL LOGIC

被引:0
|
作者
TUZHILIN, A
机构
[1] Department of Information Systems, Stern School of Business, New York University, New York, 10012-1126, NY, 44 West 4th Street
关键词
D O I
10.1007/BF01191723
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Temporal logic queries on Datalog and negated Datalog programs are studied, and their relationship to Datalog queries on these programs is explored. It is shown that, in general, temporal logic queries have more expressive power than Datalog queries on Datalog and negated Datalog programs. It is also shown that an existential domain-independent fragment of temporal logic queries has the same expressive power as Datalog queries on negated Datalog programs with inflationary semantics. This means that for finite structures this class of queries has the power of the fixpoint logic.
引用
收藏
页码:679 / 700
页数:22
相关论文
共 50 条
  • [1] On temporal logic versus datalog
    Guessarian, I
    Foustoucos, E
    Andronikos, T
    Afrati, F
    THEORETICAL COMPUTER SCIENCE, 2003, 303 (01) : 103 - 133
  • [2] Computing Datalog Rewritings for Disjunctive Datalog Programs and Description Logic Ontologies
    Kaminski, Mark
    Nenov, Yavor
    Grau, Bernardo Cuenca
    WEB REASONING AND RULE SYSTEMS, RR 2014, 2014, 8741 : 76 - 91
  • [3] Logic programs for querying inconsistent databases
    Barceló, P
    Bertossi, L
    PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, PROCEEDINGS, 2003, 2562 : 208 - 222
  • [4] Querying ATSQL databases with temporal logic
    Chomicki, J
    Toman, D
    Böhlen, MH
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2001, 26 (02): : 145 - 178
  • [5] Finite Materialisability of Datalog Programs with Metric Temporal Operators
    Walega, Przemyslaw Andrzej
    Zawidzki, Michal
    Grau, Bernardo Cuenca
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2023, 76 : 471 - 521
  • [6] Finite Materialisability of Datalog Programs with Metric Temporal Operators
    Wałȩga P.A.
    Zawidzki M.
    Grau B.C.
    Journal of Artificial Intelligence Research, 2023, 76 : 471 - 521
  • [7] Ontology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability
    Lutz, Carsten
    Sabellek, Leif
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1181 - 1187
  • [8] Querying Log Data with Metric Temporal Logic
    Brandt, Sebastian
    Kalayci, Elem Guzel
    Ryzhikov, Vladislav
    Xiao, Guohui
    Zakharyaschev, Michael
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2018, 62 : 829 - 877
  • [9] Ontology Querying: Datalog Strikes Back
    Cali, Andrea
    REASONING WEB: SEMANTIC INTEROPERABILITY ON THE WEB, 2017, 10370 : 64 - 67
  • [10] Beyond the Grounding Bottleneck: Datalog Techniques for Inference in Probabilistic Logic Programs
    Tsamoura, Efthymia
    Gutierrez-Basulto, Victor
    Kimmig, Angelika
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 10284 - 10291