A top-down query answering procedure for normal logic programs under the any-world assumption

被引：0
|
作者：
Straccia, Umberto [1 ]
机构：
[1] CNR, ISTI, I-56124 Pisa, Italy
来源：
SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDINGS | 2007年 / 4724卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The Any-World Assumption (AWA) has been introduced for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA). The AWA allows any assignment (i.e., interpretation), over a truth space (bilattice), to be a default assumption and, thus, the CWA and OWA are just special cases. To answer queries, we provide a novel and simple top-down procedure.
引用
收藏
页码：115 / 127
页数：13
相关论文
共 14 条
  • [1] Query answering in normal logic programs under uncertainty
    Straccia, U
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDINGS, 2005, 3571 : 687 - 700
  • [2] Uncertainty management in logic programming: Simple and effective top-down query answering
    Straccia, U
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS, 2005, 3682 : 753 - 760
  • [3] Layered Models Top-Down Querying of Normal Logic Programs
    Pereira, Luis Moniz
    Pinto, Alexandre Miguel
    PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, 2009, 5418 : 254 - 268
  • [4] A top-k query answering procedure for fuzzy logic programming
    Straccia, Umberto
    Madrid, Nicolas
    FUZZY SETS AND SYSTEMS, 2012, 205 : 1 - 29
  • [5] Top-down induction of logic programs from incomplete samples
    Inuzuka, N
    Kamo, M
    Ishii, N
    Seki, H
    Itoh, H
    INDUCTIVE LOGIC PROGRAMMING, 1997, 1314 : 265 - 282
  • [6] TOP-DOWN SEMANTICS OF FAIR COMPUTATIONS OF LOGIC PROGRAMS.
    Van Emden, M.H.
    Nait Abdallah, M.A.
    Journal of Logic Programming, 1985, 2 (01): : 67 - 75
  • [7] Top-down computation of the semantics of weighted fuzzy logic programs
    Chortaras, Alexandros
    Stamou, Giorgos
    Stafylopatis, Andreas
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2007, 4524 : 364 - +
  • [8] TOP-DOWN VERSUS BOTTOM-UP EXECUTION OF LOGIC PROGRAMS
    FIBY, R
    MOLNAR, S
    WEIGL, I
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1985, 4 (05): : 431 - 435
  • [9] On the finite controllability of conjunctive query answering in databases under open-world assumption
    Rosati, Riccardo
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2011, 77 (03) : 572 - 594
  • [10] Top-Down Query Processing in First-Order Deductive Databases under the DWFS
    C. A. Johnson
    Journal of Automated Reasoning, 2004, 32 : 167 - 184
12