Logic as energy:: A SAT-Based approach

被引:0
|
作者
Lima, Priscila M. V. [1 ]
Mariela, M.
Morveli-Espinoza, M. [2 ,3 ]
Franca, Felipe M. G. [1 ,3 ]
机构
[1] Univ Fed Rio de Janeiro, LAM Comp Architecture & Microelect Lab, BR-21941 Rio De Janeiro, Brazil
[2] Univ Autonoma Barcelona, Dept Informat, Barcelona, Spain
[3] Univ Fed Rio de Janeiro, COPPE, Syst Engn & Comp Sci Program, BR-21941 Rio De Janeiro, Brazil
关键词
ARQ-PROP II; higher-order neural networks; propositional reasoner; satisfiability; SATyrus;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the SATyrus platform. SATyrus' compiler takes as input the definition of a problem as a set of pseudo-Boolean constraints and produces, as output, the Energy function of a higher-order artificial neural network. This way, SATisfiability of a formula can be associated to global optima. In the case of ARQ-PROP II, global optima is associated to Resolution-based refutation, in such a way that allows for simplified abduction and prediction to be unified with deduction. Besides experimental results on deduction with ARQ-PROP II, this work also corrects the mapping of SATisfiability into Energy minima originally proposed by Gadi Pinkas.
引用
收藏
页码:458 / +
页数:2
相关论文
共 50 条
  • [41] Algorithms for Dynamic Argumentation Frameworks: An Incremental SAT-Based Approach
    Niskanen, Andreas
    Jarvisalo, Matti
    [J]. ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 849 - 856
  • [42] SigAttack: New High-level SAT-based Attack on Logic Encryptions
    Shen, Yuanqi
    Li, You
    Kong, Shuyu
    Rezaei, Amin
    Zhou, Hai
    [J]. 2019 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2019, : 940 - 943
  • [43] A Novel SAT-based ATPG Approach for Transition Delay Faults
    Zokaee, Farzaneh
    Sabaghian-Bidgoli, Hossein
    Janfaza, Vahid
    Behnam, Payman
    Navabi, Zainalabedin
    [J]. 2017 IEEE INTERNATIONAL HIGH LEVEL DESIGN VALIDATION AND TEST WORKSHOP (HLDVT), 2017, : 17 - 22
  • [44] Finding Optimal Solutions in HTN Planning - A SAT-based Approach
    Behnke, Gregor
    Hoeller, Daniel
    Biundo, Susanne
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 5500 - 5508
  • [45] SAT-based Redundancy Removal
    Debnath, Krishanu
    Murgai, Rajeev
    Jain, Mayank
    Olson, Janet
    [J]. PROCEEDINGS OF THE 2018 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2018, : 315 - 318
  • [46] Incremental SAT instance generation for SAT-based ATPG
    Tille, Daniel
    Drechsler, Rolf
    [J]. 2008 IEEE WORKSHOP ON DESIGN AND DIAGNOSTICS OF ELECTRONIC CIRCUITS AND SYSTEMS, PROCEEDINGS, 2008, : 68 - 73
  • [47] A SAT-based decision procedure for ALC
    Giunchiglia, F
    Sebastiani, R
    [J]. PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE (KR '96), 1996, : 304 - 314
  • [48] SAT-based cooperative planning: A proposal
    Benedetti, M
    Aiello, LC
    [J]. MECHANIZING MATHEMATICAL REASONING: ESSAYS IN HONOUR OF JORG H SIEKMANN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2005, 2605 : 494 - 513
  • [49] SAT-Based Minimization of Deterministic ω-Automata
    Baarir, Souheib
    Duret-Lutz, Alexandre
    [J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015), 2015, 9450 : 79 - 87
  • [50] SAT-Based verification of LTL formulas
    Zhang, Wenhui
    [J]. FORMAL METHODS: APPLICATIONS AND TECHNOLOGY, 2007, 4346 : 277 - 292