Nonmonotonic reasoning with quantified Boolean constraints

被引:0
|
作者
Pollett, C [1 ]
Remmel, JB [1 ]
机构
[1] Univ Calif San Diego, Dept Math, La Jolla, CA 92903 USA
来源
LOGIC PROGRAMMING AND NONMONOTONIC REASONING | 1997年 / 1265卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we define and investigate the complexity of several nonmonotonic logics with quantified Boolean formulas as constraints. We give quantified constraint versions of the constraint programming formalism of Marek, Nerode, and Remmel [15] and of the natural extension of their theory to default logic. We also introduce a new formalism which adds constraints to circumscription. We show that standard complexity results for each of these formalisms generalize in the quantified constraint case. Gogic, Kautz, Papadimitriou, and Selman [8] have introduced a new method for measuring the strengths of reasoning formalisms based on succinctness of model representation. We show a natural hierarchy based on this measure exists between our versions of logic programming, circumscription, and default logic. Finally, we discuss some results about the relative succinctness of our reasoning formalisms versus any formalism for which model checking can be done somewhere in the polynomial time hierarchy.
引用
收藏
页码:18 / 39
页数:22
相关论文
共 50 条
  • [21] NONMONOTONIC REASONING AND CAUSATION
    SHOHAM, Y
    COGNITIVE SCIENCE, 1990, 14 (02) : 213 - 252
  • [22] Preferences and Nonmonotonic Reasoning
    Brewka, Gerhard
    Niemela, Ikka
    Truszczynski, Miroslaw
    AI MAGAZINE, 2008, 29 (04) : 69 - 78
  • [23] Nonmonotonic reasoning in FLORID
    Kandzia, PT
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1997, 1265 : 399 - 409
  • [24] The Nature of Nonmonotonic Reasoning
    Charles G. Morgan
    Minds and Machines, 2000, 10 : 321 - 360
  • [25] Nonmonotonic reasoning - Preface
    Kaminski, Michael
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2006, 48 (3-4) : 107 - 107
  • [26] The nature of nonmonotonic reasoning
    Morgan, CG
    MINDS AND MACHINES, 2000, 10 (03) : 321 - 360
  • [27] Encoding quantified CSPs as quantified Boolean formulae
    Gent, IP
    Nightingale, P
    Rowley, A
    ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 176 - 180
  • [28] On Boolean models for Quantified Boolean Horn formulas
    Büning, HK
    Subramani, K
    Zhao, XS
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 93 - 104
  • [29] Boolean Functions as Models for Quantified Boolean Formulas
    Hans Kleine Büning
    K. Subramani
    Xishun Zhao
    Journal of Automated Reasoning, 2007, 39 : 49 - 75
  • [30] Boolean functions as models for quantified Boolean formulas
    Buening, Hans Kleine
    Subramani, K.
    Zhao, Xishun
    JOURNAL OF AUTOMATED REASONING, 2007, 39 (01) : 49 - 75