메뉴 건너뛰기




Volumn 17, Issue 2, 1996, Pages 339-357

Hierarchies of polynomially solvable satisfiability problems

Author keywords

[No Author keywords available]

Indexed keywords


EID: 21444456926     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02127974     Document Type: Article
Times cited : (9)

References (12)
  • 1
    • 0009750756 scopus 로고
    • On line algorithms for polynomially solvable satisfiability problems
    • G. Ausiello and G.F. Italiano, On line algorithms for polynomially solvable satisfiability problems, J. Logic Programming 10 (1991) 69-90.
    • (1991) J. Logic Programming , vol.10 , pp. 69-90
    • Ausiello, G.1    Italiano, G.F.2
  • 2
    • 0001961654 scopus 로고
    • Polynomial time inference of all valid implications for Horn and related formulas
    • E. Boros, Y. Crama and P.L. Hammer, Polynomial time inference of all valid implications for Horn and related formulas, Ann. Math. Artificial Intelligence 1 (1990) 21-32.
    • (1990) Ann. Math. Artificial Intelligence , vol.1 , pp. 21-32
    • Boros, E.1    Crama, Y.2    Hammer, P.L.3
  • 3
    • 0027650038 scopus 로고
    • On generalized Horn formulas and k-resolution
    • H. Kleine Büning, On generalized Horn formulas and k-resolution, Theoret. Comput. Sci. 116(2) (1993) 405-413.
    • (1993) Theoret. Comput. Sci. , vol.116 , Issue.2 , pp. 405-413
    • Kleine Büning, H.1
  • 5
    • 0025750713 scopus 로고
    • Extended Horn sets in prepositional logic
    • V. Chandru and J.N. Hooker, Extended Horn sets in prepositional logic, J. Assoc. Comput. Mach. 38 (1991) 205-221.
    • (1991) J. Assoc. Comput. Mach. , vol.38 , pp. 205-221
    • Chandru, V.1    Hooker, J.N.2
  • 6
    • 0041019793 scopus 로고
    • A hierarchy of tractable satisfiability problems
    • M. Dalal and D.W. Etherington, A hierarchy of tractable satisfiability problems. Inform. Process. Lett. 44 (1992) 173-180.
    • (1992) Inform. Process. Lett. , vol.44 , pp. 173-180
    • Dalal, M.1    Etherington, D.W.2
  • 7
    • 0021509216 scopus 로고
    • Linear-time algorithms for testing the satisfiability of prepositional Horn formulae
    • W. Dowling and J. Gallier, Linear-time algorithms for testing the satisfiability of prepositional Horn formulae, J. Logic Programming 3 (1984) 267-284.
    • (1984) J. Logic Programming , vol.3 , pp. 267-284
    • Dowling, W.1    Gallier, J.2
  • 8
    • 0343153264 scopus 로고
    • Recognizing renamable generalized prepositional Horn formulas is NP-Complete
    • T. Eiter, P. Kilpelainen and H. Mannila, Recognizing renamable generalized prepositional Horn formulas is NP-Complete, Discrete Appi. Math. 59(2) (1995) 23-32.
    • (1995) Discrete Appi. Math. , vol.59 , Issue.2 , pp. 23-32
    • Eiter, T.1    Kilpelainen, P.2    Mannila, H.3
  • 9
    • 0024105029 scopus 로고
    • Polynomially solvable satisfiability problems
    • G. Gallo and M.G. Scutellà, Polynomially solvable satisfiability problems, Inform. Process. Lett. 29 (1988) 221-227.
    • (1988) Inform. Process. Lett. , vol.29 , pp. 221-227
    • Gallo, G.1    Scutellà, M.G.2
  • 11
    • 0040852699 scopus 로고
    • Ph.D. Thesis, Department of Computer Science, University of Pisa, Italy March, TD-12/93
    • D. Pretolani, Satisfiability and Hypergraphs, Ph.D. Thesis, Department of Computer Science, University of Pisa, Italy (March, 1993) TD-12/93.
    • (1993) Satisfiability and Hypergraphs
    • Pretolani, D.1
  • 12
    • 4043103857 scopus 로고
    • The satisfiability problem for a class consisting of Horn sentences and some non-Horn sentences in proportional logic
    • S. Yamasaki and S. Doshita, The satisfiability problem for a class consisting of Horn sentences and some non-Horn sentences in proportional logic, Inform. and Control 59 (1983) 1-12.
    • (1983) Inform. and Control , vol.59 , pp. 1-12
    • Yamasaki, S.1    Doshita, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.