메뉴 건너뛰기




Volumn 5785 LNAI, Issue , 2009, Pages 240-254

Finite satisfiability in infinite-valued łukasiewicz logic

Author keywords

[No Author keywords available]

Indexed keywords

INFINITE-VALUED LOGIC; PRACTICAL METHOD; SATISFIABILITY; TRUTH DEGREE; UPPER BOUND;

EID: 70350447968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04388-8_19     Document Type: Conference Paper
Times cited : (4)

References (22)
  • 1
    • 33746330730 scopus 로고    scopus 로고
    • An asymptotically tight bound on countermodels for łukasiewicz logic
    • Aguzzoli, S.: An asymptotically tight bound on countermodels for łukasiewicz logic. International Journal of Approximate Reasoning 43, 76-89 (2006)
    • (2006) International Journal of Approximate Reasoning , vol.43 , pp. 76-89
    • Aguzzoli, S.1
  • 3
    • 0036016137 scopus 로고    scopus 로고
    • Finite-valued reductions of infinite-valued logics
    • Aguzzoli, S., Gerla, B.: Finite-valued reductions of infinite-valued logics. Archive for Mathematical Logic 41, 361-399 (2002)
    • (2002) Archive for Mathematical Logic , vol.41 , pp. 361-399
    • Aguzzoli, S.1    Gerla, B.2
  • 4
    • 70350575240 scopus 로고    scopus 로고
    • Bobillo, F., Straccia, U.: Fuzzy description logics with general t-norms and datatypes. Fuzzy Sets and Systems (in press) doi:doi:10.1016/j.fss.2009.03. 006
    • Bobillo, F., Straccia, U.: Fuzzy description logics with general t-norms and datatypes. Fuzzy Sets and Systems (in press) doi:doi:10.1016/j.fss.2009.03. 006
  • 6
    • 84880695707 scopus 로고    scopus 로고
    • Automatic SAT-compilation of planning problems
    • International Joint Conference on Artificial Intelligence, pp
    • Ernst, M., Millstein, T., Weld, D.: Automatic SAT-compilation of planning problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 1169-1176 (1997)
    • (1997) Proceedings of the 15th , pp. 1169-1176
    • Ernst, M.1    Millstein, T.2    Weld, D.3
  • 7
    • 85029586265 scopus 로고
    • Börger, E, Kleine Büning, H, Richter, M, Schönfeld,W, eds, Selected Papers from Computer Science Logic, pp, Springer, Heidelberg
    • Hähnle, R.: Towards an efficient tableau proof procedure for multiple-valued logics. In: Börger, E., Kleine Büning, H., Richter, M., Schönfeld,W. (eds.) Selected Papers from Computer Science Logic, pp. 248-260. Springer, Heidelberg (1991)
    • (1991) Towards an efficient tableau proof procedure for multiple-valued logics , pp. 248-260
    • Hähnle, R.1
  • 12
    • 2942667864 scopus 로고    scopus 로고
    • ASSAT: Computing answer sets of a logic program by SAT solvers
    • Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2), 115-137 (2004)
    • (2004) Artificial Intelligence , vol.157 , Issue.1-2 , pp. 115-137
    • Lin, F.1    Zhao, Y.2
  • 13
    • 0002141730 scopus 로고
    • A theorem about infinite-valued sentential logic
    • McNaughton, R.: A theorem about infinite-valued sentential logic. Journal of Symbolic Logic 16, 1-13 (1951)
    • (1951) Journal of Symbolic Logic , vol.16 , pp. 1-13
    • McNaughton, R.1
  • 14
    • 0023537271 scopus 로고
    • Satisfiability in many-valued sentential logic is NP-complete
    • Mundici, D.: Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science 52, 145-153 (1987)
    • (1987) Theoretical Computer Science , vol.52 , pp. 145-153
    • Mundici, D.1
  • 15
    • 0000366861 scopus 로고    scopus 로고
    • Resolution and model building in the infinite-valued calculus of Łukasiewicz
    • Mundici, D., Olivetti, N.: Resolution and model building in the infinite-valued calculus of Łukasiewicz. Theoretical Computer Science 200, 335-366 (1998)
    • (1998) Theoretical Computer Science , vol.200 , pp. 335-366
    • Mundici, D.1    Olivetti, N.2
  • 16
    • 23244436734 scopus 로고    scopus 로고
    • Tableaux for Łukasiewicz infinite-valued logic
    • Olivetti, N.: Tableaux for Łukasiewicz infinite-valued logic. Studia Logica 73(1), 81-111 (2003)
    • (2003) Studia Logica , vol.73 , Issue.1 , pp. 81-111
    • Olivetti, N.1
  • 17
    • 50649125567 scopus 로고    scopus 로고
    • Modelling and solving temporal reasoning as propositional satisfiability
    • Pham, D., Thornton, J., Sattar, A.: Modelling and solving temporal reasoning as propositional satisfiability. Artificial Intelligence 172(15), 1752-1782 (2008)
    • (2008) Artificial Intelligence , vol.172 , Issue.15 , pp. 1752-1782
    • Pham, D.1    Thornton, J.2    Sattar, A.3
  • 18
    • 57749089437 scopus 로고    scopus 로고
    • Spatial reasoning in a fuzzy region connection calculus
    • Schockaert, S., De Cock, M., Kerre, E.: Spatial reasoning in a fuzzy region connection calculus. Artificial Intelligence 173, 258-298 (2009)
    • (2009) Artificial Intelligence , vol.173 , pp. 258-298
    • Schockaert, S.1    De Cock, M.2    Kerre, E.3
  • 19
    • 55249124846 scopus 로고    scopus 로고
    • Mixed integer programming, general concept inclusions and fuzzy description logics
    • Straccia, U., Bobillo, F.: Mixed integer programming, general concept inclusions and fuzzy description logics. Mathware & Soft Computing 14(3), 247-259 (2007)
    • (2007) Mathware & Soft Computing , vol.14 , Issue.3 , pp. 247-259
    • Straccia, U.1    Bobillo, F.2
  • 20
    • 33750377029 scopus 로고    scopus 로고
    • Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, 4204, pp. 590-603. Springer, Heidelberg (2006)
    • Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 590-603. Springer, Heidelberg (2006)
  • 22
    • 70350495494 scopus 로고    scopus 로고
    • Zhang, L., Malik, S.: The quest for efficient boolean satisfiability solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, 2404, pp. 641-653. Springer, Heidelberg (2002)
    • Zhang, L., Malik, S.: The quest for efficient boolean satisfiability solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 641-653. Springer, Heidelberg (2002)


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