메뉴 건너뛰기




Volumn 6565 LNAI, Issue , 2011, Pages 74-90

Challenges in answer set solving

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; ANSWER SET SOLVING; INFORMATICS; KNOWLEDGE REPRESENTATION AND REASONING; DECLARATIVE PROBLEM SOLVING;

EID: 79956293119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20832-4_6     Document Type: Article
Times cited : (15)

References (41)
  • 1
    • 21344445698 scopus 로고    scopus 로고
    • General game playing: Overview of the AAAI competition
    • Genesereth, M., Love, N., Pell, B.: General game playing: Overview of the AAAI competition. AI Magazine 26 (2), 62-72 (2005) (Pubitemid 40902512)
    • (2005) AI Magazine , vol.26 , Issue.2 , pp. 62-72
    • Genesereth, M.1    Love, N.2    Pell, B.3
  • 4
    • 22444454304 scopus 로고    scopus 로고
    • Developing a declarative rule language for applications in product configuration
    • Gupta, G. ed., Springer, Heidelberg
    • Soininen, T., Niemelä, I.: Developing a declarative rule language for applications in product configuration. In: Gupta, G. (ed.) PADL 1999. LNCS, vol. 1551, pp. 305-319. Springer, Heidelberg (1999)
    • (1999) PADL 1999. LNCS , vol.1551 , pp. 305-319
    • Soininen, T.1    Niemelä, I.2
  • 5
    • 84949188702 scopus 로고    scopus 로고
    • An A-prolog decision support system for the space shuttle
    • Ramakrishnan, I. ed., Springer, Heidelberg
    • Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-prolog decision support system for the space shuttle. In: Ramakrishnan, I. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169-183. Springer, Heidelberg (2001)
    • (2001) PADL 2001. LNCS , vol.1990 , pp. 169-183
    • Nogueira, M.1    Balduccini, M.2    Gelfond, M.3    Watson, R.4    Barry, M.5
  • 7
    • 70349879123 scopus 로고    scopus 로고
    • Answer set vs integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs
    • Ishebabi, H., Mahr, P., Bobda, C., Gebser, M., Schaub, T.: Answer set vs integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs. Journal of Reconfigurable Computing (2009)
    • (2009) Journal of Reconfigurable Computing
    • Ishebabi, H.1    Mahr, P.2    Bobda, C.3    Gebser, M.4    Schaub, T.5
  • 9
    • 79960351364 scopus 로고    scopus 로고
    • Detecting inconsistencies in large biological networks with answer set programming
    • Gebser, M., Schaub, T., Thiele, S., Veber, P.: Detecting inconsistencies in large biological networks with answer set programming. Theory and Practice of Logic Programming 11 (2), 1-38 (2011)
    • (2011) Theory and Practice of Logic Programming , vol.11 , Issue.2 , pp. 1-38
    • Gebser, M.1    Schaub, T.2    Thiele, S.3    Veber, P.4
  • 10
    • 77749264945 scopus 로고    scopus 로고
    • An ASP-based system for team-building in the gioia-tauro seaport
    • Carro, M., Peña, R. eds., Springer, Heidelberg
    • Grasso, G., Iiritano, S., Leone, N., Lio, V., Ricca, F., Scalise, F.: An ASP-based system for team-building in the gioia-tauro seaport. In: Carro, M., Peña, R. (eds.) PADL 2010. LNCS, vol. 5937, pp. 40-42. Springer, Heidelberg (2010)
    • (2010) PADL 2010. LNCS , vol.5937 , pp. 40-42
    • Grasso, G.1    Iiritano, S.2    Leone, N.3    Lio, V.4    Ricca, F.5    Scalise, F.6
  • 11
    • 0010122418 scopus 로고    scopus 로고
    • Extending and implementing the stable model semantics
    • Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138 (1-2), 181-234 (2002)
    • (2002) Artificial Intelligence , vol.138 , Issue.1-2 , pp. 181-234
    • Simons, P.1    Niemelä, I.2    Soininen, T.3
  • 13
    • 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
  • 14
    • 9444283782 scopus 로고    scopus 로고
    • Cmodels-2: SAT-Based Answer Set Solver Enhanced to Non-tight Programs
    • Logic Programming and Nonmonotonic Reasoning
    • Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346-350. Springer, Heidelberg (2003) (Pubitemid 38050692)
    • (2004) LECTURE NOTES IN COMPUTER SCIENCE , Issue.2923 , pp. 346-350
    • Lierler, Y.1    Maratea, M.2
  • 25
    • 38049063033 scopus 로고    scopus 로고
    • Debugging ASP programs by means of ASP
    • Baral, C., Brewka, G., Schlipf, J. eds., Springer, Heidelberg
    • Brain, M., Gebser, M., Pührer, J., Schaub, T., Tompits, H., Woltran, S.: Debugging ASP programs by means of ASP. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 31-43. Springer, Heidelberg (2007)
    • (2007) LPNMR 2007. LNCS (LNAI) , vol.4483 , pp. 31-43
    • Brain, M.1    Gebser, M.2    Pührer, J.3    Schaub, T.4    Tompits, H.5    Woltran, S.6
  • 29
    • 79956308194 scopus 로고    scopus 로고
    • http://potassco.sourceforge.net/
  • 30
    • 70349852764 scopus 로고    scopus 로고
    • The second answer set programming competition
    • Erdem, E., Lin, F., Schaub, T. eds., Springer, Heidelberg
    • Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczyński, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637-654. Springer, Heidelberg (2009)
    • (2009) LPNMR 2009. LNCS , vol.5753 , pp. 637-654
    • Denecker, M.1    Vennekens, J.2    Bond, S.3    Gebser, M.4    Truszczyński, M.5
  • 32
    • 33845971483 scopus 로고    scopus 로고
    • Answer set programming based on propositional satisfiability
    • DOI 10.1007/s10817-006-9033-2, Empirically Successful Automated Reasoning: Systems Issue
    • Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36 (4), 345-377 (2006) (Pubitemid 46046675)
    • (2006) Journal of Automated Reasoning , vol.36 , Issue.4 , pp. 345-377
    • Giunchiglia, E.1    Lierler, Y.2    Maratea, M.3
  • 34
    • 26444549375 scopus 로고    scopus 로고
    • Effective preprocessing in SAT through variable and clause elimination
    • Theory and Applications of Satisfiability Testing: 8th International Conference, SAT 2005. Proceedings
    • Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61-75. Springer, Heidelberg (2005) (Pubitemid 41425497)
    • (2005) Lecture Notes in Computer Science , vol.3569 , pp. 61-75
    • Een, N.1    Biere, A.2
  • 35
    • 38049098489 scopus 로고    scopus 로고
    • A lightweight component caching scheme for satisfiability solvers
    • Marques-Silva, J., Sakallah, K. A. eds., Springer, Heidelberg
    • Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K. A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 294-299. Springer, Heidelberg (2007)
    • (2007) SAT 2007. LNCS , vol.4501 , pp. 294-299
    • Pipatsrisawat, K.1    Darwiche, A.2
  • 41


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