On 2-SAT and Renamable Horn

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 279-284

  del Val, Alvaro ^a  

^a UNIVERSIDAD AUTÓNOMA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; FORMAL LOGIC; KNOWLEDGE REPRESENTATION; PROBLEM SOLVING;

GRAPH-BASED ALGORITHMS; HORN THEORY; LINEAR-TIME ALGORITHMS; PROPOSITIONAL THEORIES; SAT SOLVERS; SATISFIABILITY; UNIT RESOLUTIONS;

GRAPHIC METHODS;

EID: 85158161749     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Aspvall, B.; Plass, M. F.; and Tarjan, R. E. 1979. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8(3):121-123.
2. Aspvall, B. 1980. Recognizing disguised NR(1) instances of the satisfiability problem. Journal of Algorithms 1(1):97-103. Note.
3. Chandru, V.; Coullard, C.; Hammer, P.; Montañez, M.; and Sun, X. 1990. On renamable Horn and generalized Horn functions. Annals of Mathematics and Artificial Intelligence 1:33-48.
4. Dalal, M., and Etherington, D. W. 1992. A hierarchy of tractable satisfiability problems. Information Processing Letters 44:173-180.
5. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem proving. Communications of the ACM 5:394-397.
6. Dowling, W. F., and Gallier, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 3:267-284.
7. Even, S.; Itai, A.; and Shamir, A. 1976. On the complexity of timetable and multicommodity flow problems. SIAM Journal of Computing 5(4):691-703.
8. Forbus, K., and de Kleer, J. 1993. Building Problem Solvers. The MIT Press.
9. Henschen, L., and Wos, L. 1974. Unit refutations and Horn sets. Journal of the ACM 21:590-605.
10. Larrabee, T. 1992. Test pattern generation using boolean satisfiability. IEEE Transactions on Computer-Aided Design 4-15.
11. Lewis, H. R. 1978. Renaming a set of clauses as a Horn set. Journal of the ACM 25(1):134-135.
12. Pretolani, D. 1993. Satisfiability and Hypergraphs. Ph.D. Dissertation, Università di Pisa.
13. Pretolani, D. 1996. Hierarchies of polynomially solvable satisfiability problems. Annals of Mathematics and Artificial Intelligence 17:339-357.