Reducing query answering to satisfiability in nonmonotonic logics

被引:0
|
作者
Rosati, R [1 ]
机构
[1] Univ Rome La Sapienza, Dipartimento Informat & Sistemist, I-00198 Rome, Italy
来源
FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS | 1998年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose a unifying view of negation as failure, integrity constraints, and epistemic queries in nonmonotonic reasoning. Specifically, we study the relationship between satisfiability and logical implication in nonmonotonic logics, showing that, in many nonmonotonic formalisms, it is possible and easy to reduce logical implication to satisfiability. This result not only allows for establishing new complexity results for the satisfiability problem in nonmonotonic logics, but also establishes a clear relationship between the studies on epistemic queries and integrity constraints in monotonic knowledge bases with the work on negation by default in nonmonotonic reasoning and logic programming. From the perspective of the design of knowledge representation systems, such a reduction allows for defining both a simple method for answering epistemic queries in knowledge bases with nonmonotonic abilities, and a procedure for identifying integrity constraints in the knowledge base, which can be employed for optimizing reasoning in such systems.
引用
收藏
页码:853 / 858
页数:6
相关论文
共 50 条
  • [1] Satisfiability and Query Answering in Description Logics with Global and Local Cardinality Constraints
    Baader, Franz
    Bednarczyk, Bartosz
    Rudolph, Sebastian
    ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 616 - 623
  • [2] Query answering in distributed description logics
    Alkhateeb, Faisal
    Zimmermann, Antoine
    NEW TECHNOLOGIES, MOBILITY AND SECURITY, 2007, : 517 - 528
  • [3] Data Complexity of Query Answering in Description Logics
    Calvanese, D.
    De Giacomo, G.
    Lembo, D.
    Lenzerini, M.
    Rosati, R.
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 4163 - 4167
  • [4] Data complexity of query answering in description logics
    Calvanese, Diego
    De Giacomo, Giuseppe
    Lembo, Domenico
    Lenzerini, Maurizio
    Rosati, Riccardo
    ARTIFICIAL INTELLIGENCE, 2013, 195 : 335 - 360
  • [5] Query Answering in Description Logics with Transitive Roles
    Eiter, Thomas
    Lutz, Carsten
    Ortiz, Magdalena
    Simkus, Mantas
    21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 759 - 764
  • [6] Query Answering in Description Logics: The Knots Approach
    Eiter, Thomas
    Lutz, Carsten
    Ortiz, Magdalena
    Simkus, Mantas
    LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, 2009, 5514 : 26 - +
  • [7] Controlled query evaluation in description logics through consistent query answering
    Cima, Gianluca
    Lembo, Domenico
    Rosati, Riccardo
    Savo, Domenico Fabio
    ARTIFICIAL INTELLIGENCE, 2024, 334
  • [8] Revisiting the Hardness of Query Answering in Expressive Description Logics
    Ortiz, Magdalena
    Simkus, Mantas
    WEB REASONING AND RULE SYSTEMS, RR 2014, 2014, 8741 : 216 - 223
  • [9] The complexity of conjunctive query answering in expressive description logics
    Lutz, Carsten
    AUTOMATED REASONING, PROCEEDINGS, 2008, 5195 : 179 - 193
  • [10] Generalized query answering in disjunctive deductive databases: Procedural and nonmonotonic aspects
    Yahya, AH
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1997, 1265 : 324 - 340