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
来源：
ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 2004年 / 110卷
关键词：
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 条
  • [21] Propositional PSPACE reasoning with boolean programs versus quantified Boolean formulas
    Skelley, A
    [J]. AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 1163 - 1175
  • [22] An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
    Marco Cadoli
    Marco Schaerf
    Andrea Giovanardi
    Massimo Giovanardi
    [J]. Journal of Automated Reasoning, 2002, 28 : 101 - 142
  • [23] Using stochastic local search to solve quantified Boolean formulae
    Gent, IP
    Hoos, HH
    Rowley, AGD
    Smyth, K
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 348 - 362
  • [24] An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
    Cadoli, Marco
    Schaerf, Marco
    Giovanardi, Andrea
    Giovanardi, Massimo
    [J]. 1600, Kluwer Academic Publishers (28):
  • [25] An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
    Cadoli, M
    Schaerf, M
    Giovanardi, A
    Giovanardi, M
    [J]. JOURNAL OF AUTOMATED REASONING, 2002, 28 (02) : 101 - 142
  • [26] Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
    Egly, Uwe
    Woltran, Stefan
    [J]. COMPUTATIONAL MODELS OF ARGUMENT, 2006, 144 : 133 - 144
  • [27] Equivalence Checking of Partial Designs Using Dependency Quantified Boolean Formulae
    Gitina, Karina
    Reimer, Sven
    Sauer, Matthias
    Wimmer, Ralf
    Scholl, Christoph
    Becker, Bernd
    [J]. 2013 IEEE 31ST INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD), 2013, : 396 - 403
  • [28] Solving advanced reasoning tasks using quantified Boolean formulas
    Egly, U
    Eiter, T
    Tompits, H
    Woltran, S
    [J]. SEVENTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-2001) / TWELFTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-2000), 2000, : 417 - 422
  • [29] Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas
    Diller, Martin
    Wallner, Johannes Peter
    Woltran, Stefan
    [J]. COMPUTATIONAL MODELS OF ARGUMENT, 2014, 266 : 241 - 252
  • [30] Reasoning in abstract dialectical frameworks using quantified Boolean formulas
    Diller, Martin
    Wallner, Johannes Peter
    Woltran, Stefan
    [J]. ARGUMENT & COMPUTATION, 2015, 6 (02) : 149 - 177
12345