Representing Boolean formulas by using trees of implicants and implicates

被引：0
|
作者：
Gutiérrez, G [1 ]
de Guzmán, IP [1 ]
Martínez, J [1 ]
Ojeda-Aciego, M [1 ]
Valverde, A [1 ]
机构：
[1] Univ Malaga, Dept Matemat Aplicada, E-29080 Malaga, Spain
来源：
PROCEEDINGS OF THE FIFTH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1 AND 2 | 2000年
关键词：
automated deduction; propositional formula representation; implicates/implicants;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A new tree-based representation for propositional formulas is introduced. This representation, the A-trees, allows a compact representation for well-formed formulas as well as a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula.
引用
收藏
页码：551 / 554
页数：4
相关论文
共 50 条
  • [21] Sensitivity of Boolean formulas
    Creignou, Nadia
    Daude, Herve
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (05) : 793 - 805
  • [22] BOOLEAN ALGEBRA OF FORMULAS
    FAUST, D
    HANF, W
    MYERS, D
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1977, 42 (01) : 145 - 145
  • [23] Explainable Artificial Intelligence Using Expressive Boolean Formulas
    Rosenberg, Gili
    Brubaker, John Kyle
    Schuetz, Martin J. A.
    Salton, Grant
    Zhu, Zhihuai
    Zhu, Elton Yechao
    Kadioglu, Serdar
    Borujeni, Sima E.
    Katzgraber, Helmut G.
    [J]. MACHINE LEARNING AND KNOWLEDGE EXTRACTION, 2023, 5 (04): : 1760 - 1795
  • [24] Learning Boolean formulas
    [J]. Kearns, Michael, 1600, ACM, New York, NY, United States (41):
  • [25] Pictures as Boolean Formulas
    Alevizos, Panagiotis D.
    [J]. JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2013, 46 (01) : 74 - 102
  • [26] Boolean formulas and circuits
    不详
    [J]. COMPUTATIONAL COMPLEXITY OF EQUIVALENCE AND ISOMORPHISM PROBLEMS, 2000, 1852 : 23 - 63
  • [27] Connected Boolean Functions with a Locally Extremal Number of Prime Implicants
    Chukhrov I.P.
    [J]. Journal of Applied and Industrial Mathematics, 2021, 15 (01) : 17 - 38
  • [28] Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
    Egly, Uwe
    Woltran, Stefan
    [J]. COMPUTATIONAL MODELS OF ARGUMENT, 2006, 144 : 133 - 144
  • [29] Transforming Quantified Boolean Formulas Using Biclique Covers
    Kullmann, Oliver
    Shukla, Ankit
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2023, 2023, 13994 : 372 - 390
  • [30] Improved SAT-Based Boolean Matching Using Implicants for LUT-Based FPGAs
    Cong, Jason
    Minkovich, Kirill
    [J]. FPGA 2007: FIFTEENTH ACM/SIGDA INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE GATE ARRAYS, 2007, : 139 - 147
12345