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 条
  • [41] Boolean functions as models for quantified Boolean formulas
    Buening, Hans Kleine
    Subramani, K.
    Zhao, Xishun
    [J]. JOURNAL OF AUTOMATED REASONING, 2007, 39 (01) : 49 - 75
  • [42] Boolean Functions as Models for Quantified Boolean Formulas
    Hans Kleine Büning
    K. Subramani
    Xishun Zhao
    [J]. Journal of Automated Reasoning, 2007, 39 : 49 - 75
  • [43] Symmetries of Quantified Boolean Formulas
    Kauers, Manuel
    Seidl, Martina
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2018, 2018, 10929 : 199 - 216
  • [44] On models for quantified Boolean formulas
    Büning, HK
    Zhao, XS
    [J]. LOGIC VERSUS APPROXIMATION: ESSAYS DEDICATED TO MICHAEL M RICHTER ON THE OCCASION OF HIS 65TH BIRTHDAY, 2004, 3075 : 18 - 32
  • [45] INCONSISTENCIES HANDLING - NONMONOTONIC AND PARACONSISTENT REASONING
    SEFRANEK, J
    [J]. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 535 : 214 - 219
  • [46] Modeling and Reasoning with Paraconsistent Rough Sets
    Vitoria, Aida
    Maluszynski, Jan
    Szalas, Andrzej
    [J]. FUNDAMENTA INFORMATICAE, 2009, 97 (04) : 405 - 438
  • [47] Efficient Paraconsistent Reasoning with Ontologies and Rules
    Kaminski, Tobias
    Knorr, Matthias
    Leite, Joao
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 3098 - 3105
  • [48] Planning as Quantified Boolean Formula
    Cashmore, Michael
    Fox, Maria
    Giunchiglia, Enrico
    [J]. 20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 217 - +
  • [49] On the readability of monotone Boolean formulae
    Khaled Elbassioni
    Kazuhisa Makino
    Imran Rauf
    [J]. Journal of Combinatorial Optimization, 2011, 22 : 293 - 304
  • [50] Algorithms for quantified Boolean formulas
    Williams, R
    [J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 299 - 307
12345