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 条
  • [1] Satisfiability testing for boolean formulas using Δ-trees
    Gutiérrez G.
    De Guzmán I.P.
    Martínez J.
    Ojeda-Aciego M.
    Valverde A.
    [J]. Studia Logica, 2002, 72 (1) : 85 - 112
  • [2] Reduction theorems for boolean formulas using Δ-trees
    Gutiérrez, G
    de Guzmán, IP
    Martínez, J
    Ojeda-Aciego, M
    Valverde, A
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, 2000, 1919 : 179 - 192
  • [3] RANDOM BOOLEAN-FORMULAS REPRESENTING ANY BOOLEAN FUNCTION WITH ASYMPTOTICALLY EQUAL PROBABILITY
    SAVICKY, P
    [J]. DISCRETE MATHEMATICS, 1990, 83 (01) : 95 - 103
  • [4] RANDOM BOOLEAN-FORMULAS REPRESENTING ANY BOOLEAN FUNCTION WITH ASYMPTOTICALLY EQUAL PROBABILITY
    SAVICKY, P
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 512 - 517
  • [5] AN INCREMENTAL METHOD FOR GENERATING PRIME IMPLICANTS IMPLICATES
    KEAN, A
    TSIKNIS, G
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1990, 9 (02) : 185 - 206
  • [6] Boolean functions with long prime implicants
    Cepek, Ondrej
    Kucera, Petr
    Kurik, Stanislav
    [J]. INFORMATION PROCESSING LETTERS, 2013, 113 (19-21) : 698 - 703
  • [7] Bases for closed sets of implicants and implicates in temporal logic
    Cordero, P
    Enciso, M
    de Guzmán, IP
    [J]. ACTA INFORMATICA, 2002, 38 (09) : 599 - 619
  • [8] Bases for closed sets of implicants and implicates in temporal logic
    P. Cordero
    M. Enciso
    I.P. de Guzmán
    [J]. Acta Informatica, 2002, 38 : 599 - 619
  • [9] METHOD FOR GENERATING PRIME IMPLICANTS OF A BOOLEAN EXPRESSION
    HWA, HR
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (06) : 637 - 641
  • [10] CNF and DNF considered harmful for computing prime implicants/implicates
    Ramesh, A
    Becker, G
    Murray, NV
    [J]. JOURNAL OF AUTOMATED REASONING, 1997, 18 (03) : 337 - 356
12345