A modular reduction of regular logic to classical logic

Proceedings of The International Symposium on Multiple-Valued Logic

Volumn , Issue , 2001, Pages 221-225

  Béjar, Ramón ^a   Hähnle, Reiner ^b   Manyà, Felip ^c  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^c UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MANY VALUED LOGICS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING;

CLASSICAL LOGICS;

LOGIC DESIGN;

EID: 0034822262     PISSN: 0195623X     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISMVL.2001.924576     Document Type: Article

References (18)

1. A linear time algorithm for testing the truth of certain quantified boolean formulae
2. Transformations between signed and classical clause logic
3. The SAT problem of signed CNF formulas
4. A comparison of systematic and local search algorithms for regular CNF formulas
5. Phase transitions in the regular random 3-SAT problem
6. Solving combinatorial problems with regular local search algorithms
7. Recognition of q-Horn formulae in linear time
8. On 2-SAT and renamable Horn
9. Linear-time algorithms for testing the satisfiability of propositional Horn formula
10. The satisfiability problem for multiple-valued Horn formula
11. Chaining techniques for automated theorem proving in many-valued logics
12. Exploiting data dependencies in many-valued logics
13. The 2-SAT problem in signed CNF formulas
14. The satisfiability problem in regular CNF-formulas
15. Translation methods for non-classical logics - An overview
16. On translation of finitely-valued logics to classical first-order logic