Paraconsistent preferential reasoning by signed quantified Boolean formulae

被引:0
|
作者
Arieli, O [1 ]
机构
[1] Tel Aviv Acad Coll, Dept Comp Sci, IL-61161 Tel Aviv, Israel
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. This framework provides a useful platform for capturing, in a simple and natural way, a wide range of methods for preferential reasoning. Off-the-shelf QBF solvers may therefore be incorporated for simulating the corresponding consequence relations.
引用
收藏
页码:773 / 777
页数:5
相关论文
共 50 条
  • [1] Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
    Arieli, Ofer
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2007, 8 (03)
  • [2] Paraconsistent reasoning via quantified Boolean formulas, I: Axiomatising signed systems
    Besnard, P
    Schaub, T
    Tompits, H
    Woltran, S
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE 8TH, 2002, 2424 : 320 - 331
  • [3] Signed Systems for Paraconsistent Reasoning
    Ph. Besnard
    T. Schaub
    [J]. Journal of Automated Reasoning, 1998, 20 : 191 - 213
  • [4] Signed systems for paraconsistent reasoning
    Besnard, P
    Schaub, T
    [J]. JOURNAL OF AUTOMATED REASONING, 1998, 20 (1-2) : 191 - 213
  • [5] Paraconsistent reasoning via quantified Boolean formulas, II: Circumscribing inconsistent theories
    Besnard, P
    Schaub, T
    Tompits, H
    Woltran, S
    [J]. SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDING, 2003, 2711 : 528 - 539
  • [6] Encoding quantified CSPs as quantified Boolean formulae
    Gent, IP
    Nightingale, P
    Rowley, A
    [J]. ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 176 - 180
  • [7] A simple signed system for paraconsistent reasoning
    Besnard, P
    Schaub, T
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, 1996, 1126 : 404 - 416
  • [8] Boolean Propagation Based on Literals for Quantified Boolean Formulae
    Stephan, Igor
    [J]. ECAI 2006, PROCEEDINGS, 2006, 141 : 452 - +
  • [9] Symmetry Breaking in Quantified Boolean Formulae
    Audemard, Gilles
    Jabbour, Said
    Sais, Lakhdar
    [J]. 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 2262 - 2267
  • [10] A satisfiability procedure for quantified Boolean formulae
    Plaisted, DA
    Biere, A
    Zhu, YS
    [J]. DISCRETE APPLIED MATHEMATICS, 2003, 130 (02) : 291 - 328