Reduction theorems for boolean formulas using δ-trees

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1919, Issue , 2000, Pages 179-192

  Gutierrez, Gloria ^a   De Guzman, Inma P ^a   Martinez, Javier ^a   Ojeda Aciego, Manuel ^a   Valverde, Agustin ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; FORMAL LOGIC;

BOOLEAN FORMULAE; COMPACT REPRESENTATION; PROPOSITIONAL FORMULAS; QUADRATIC COSTS; REDUCTION STRATEGY; SAT PROBLEMS; SATISFIABILITY; SEARCH SPACES;

BOOLEAN ALGEBRA;

EID: 23044524094     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-40006-0_13     Document Type: Conference Paper

References (9)

1. G.Aguilera, I.P.de Guzmán, and M.Ojeda-Aciego.Increasing the efficiency of automated theorem proving.Journal of Applied Non-Classical Logics, 5(1):9-29, 1995.
2. G.Aguilera, I.P.de Guzmán, M.Ojeda-Aciego, and A.Valverde.Reductions for non-clausal theorem proving.Theoretical Computer Science, 2000.To appear.Available at http://www.ctima.uma.es/aciego/TR/TAS-tcs.pdf.
3. L.J.Claesen, editor.Formal VLSI correctness verification-VLSI design methods, volume 2.Elsevier, 1990.
4. I.P.de Guzmán, M.Ojeda-Aciego, and A.Valverde.Implicates and reduction techniques for temporal logics.Ann.Math.Artificial Intelligence 27:3-23, 1999.
5. I.P.de Guzmán, M.Ojeda-Aciego, and A.Valverde.Multiple-valued tableaux with ?-reductions.In Proc.of the Intl.Conf.on Artificial Intelligence, ICAI'99, pages 177-183.C.S.R.E.A., 1999.
6. J.H.Gallier.Logic for Computer Science: Foundations for Automatic Theorem Proving.Wiley & Sons, 1987.
7. F.Massacci.Simplification: A general constraint propagation technique for propositional and modal tableaux.In Proceedings of Tableaux'98, pages 217-231.Lect.Notes in Artificial Intelligence 1397, 1998.
8. L.C.Paulson.Isabelle: A Generic Theorem Prover.Springer, 1994.LNCS 828.
9. P.W.Purdom, Jr.Average time for the full pure literal rule.Information Sciences, 78:269-291, 1994.