메뉴 건너뛰기




Volumn 10, Issue 4-6, 2010, Pages 513-529

Catching the Ouroboros: On debugging non-ground answer-set programs

Author keywords

answer set programming; debugging; program analysis

Indexed keywords

ANSWER SET; ANSWER-SET PROGRAMMING; DEBUGGERS; DEBUGGING; INTEGER ARITHMETIC; META PROGRAMMING; PROGRAM ANALYSIS;

EID: 77957223042     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068410000256     Document Type: Conference Paper
Times cited : (62)

References (19)
  • 3
    • 57349132433 scopus 로고    scopus 로고
    • A theoretical framework for the declarative debugging of datalog programs
    • Nantes, France, March 29, 2008, K.-D. Schewe and B. Thalheim, Eds. Lecture Notes in Computer Science, Springer, Berlin
    • CABALLERO, R., GARCíA-RUIZ, Y., and SÁ ENZ-PÉREZ, F. 2008. A theoretical framework for the declarative debugging of datalog programs. In Revised Selected Papers of the 3rd International Workshop on Semantics in Data and Knowledge Bases (SDKB'08), Nantes, France, March 29, 2008, K.-D. Schewe and B. Thalheim, Eds. Lecture Notes in Computer Science, vol. 4925. Springer, Berlin, 143-159.
    • (2008) Revised Selected Papers of the 3rd International Workshop on Semantics in Data and Knowledge Bases (SDKB'08) , vol.4925 , pp. 143-159
    • Caballero, R.1    García-Ruiz, Y.2    Sáenz-Pérez, F.3
  • 6
    • 27144465667 scopus 로고    scopus 로고
    • Complexity of model checking and bounded predicate arities for non-ground answer set programming
    • Whistler, Canada, June 2-5, 2004, D. Dubois, C. A. Welty, and M.-A. Williams, Eds. AAAI Press, Menlo Park, CA
    • EITER, T., FABER, W., FINK, M., PFEIFER, G., and WOLTRAN, S. 2004. Complexity of model checking and bounded predicate arities for non-ground answer set programming. In Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR'04), Whistler, Canada, June 2-5, 2004, D. Dubois, C. A. Welty, and M.-A. Williams, Eds. AAAI Press, Menlo Park, CA, 377-387.
    • (2004) Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR'04) , pp. 377-387
    • Eiter, T.1    Faber, W.2    Fink, M.3    Pfeifer, G.4    Woltran, S.5
  • 8
    • 57749194179 scopus 로고    scopus 로고
    • A meta-programming technique for debugging answer-set programs
    • Chicago, IL, July 13-17, 2008, D. Fox and C. P. Gomes, Eds. AAAI Press, Menlo Park, CA
    • GEBSER, M., Pü HRER, J., SCHAUB, T., and TOMPITS, H. 2008. A meta-programming technique for debugging answer-set programs. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI'08), Chicago, IL, July 13-17, 2008, D. Fox and C. P. Gomes, Eds. AAAI Press, Menlo Park, CA, 448-453.
    • (2008) Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI'08) , pp. 448-453
    • Gebser, M.1    Hrer, P.J.2    Schaub, T.3    Tompits, H.4
  • 10
    • 77951505493 scopus 로고
    • Classical negation in logic programs and disjunctive databases
    • GELFOND, M. and LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3/4, 365-386.
    • (1991) New Generation Computing , vol.9 , Issue.3-4 , pp. 365-386
    • Gelfond, M.1    Lifschitz, V.2
  • 11
    • 84880760304 scopus 로고    scopus 로고
    • A model-theoretic counterpart of loop formulas
    • Edinburgh, Scotland, UK, July 30-August 5, 2005, L. P. Kaelbling and A. Saffiotti, Eds. Professional Book Center, Denver, CO
    • LEE, J. 2005. A model-theoretic counterpart of loop formulas. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI'05), Edinburgh, Scotland, UK, July 30-August 5, 2005, L. P. Kaelbling and A. Saffiotti, Eds. Professional Book Center, Denver, CO, 503-508.
    • (2005) Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI'05) , pp. 503-508
    • Lee, J.1
  • 13
    • 0002875208 scopus 로고    scopus 로고
    • Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
    • LEONE, N., RULLO, P., and SCARCELLO, F. 1997. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135, 2, 69-112. (Pubitemid 127452754)
    • (1997) Information and Computation , vol.135 , Issue.2 , pp. 69-112
    • Leone, N.1    Rullo, P.2    Scarcello, F.3
  • 14
    • 2942667864 scopus 로고    scopus 로고
    • ASSAT: Computing answer sets of a logic program with SAT solvers
    • LIN, F. and ZHAO, Y. 2004. ASSAT: Computing answer sets of a logic program with SAT solvers. Artificial Intelligence 157, 1-2, 115-137.
    • (2004) Artificial Intelligence , vol.157 , Issue.1-2 , pp. 115-137
    • Lin, F.1    Zhao, Y.2
  • 15
    • 57749173104 scopus 로고    scopus 로고
    • Towards debugging of answer-set programs in the language PSpb
    • Las Vegas, NV, June 25-28, 2007, H. R. Arabnia, M. Q. Yang, and J. Y. Yang, Eds. CSREA Press, Bogart, GA
    • MIKITIUK, A., MOSELEY, E., and TRUSZCZYNSKI, M. 2007. Towards debugging of answer-set programs in the language PSpb. In Proceedings of the 2007 International Conference on Artificial Intelligence (ICAI'07), vol. II, Las Vegas, NV, June 25-28, 2007, H. R. Arabnia, M. Q. Yang, and J. Y. Yang, Eds. CSREA Press, Bogart, GA, 635-640.
    • (2007) Proceedings of the 2007 International Conference on Artificial Intelligence (ICAI'07) , vol.2 , pp. 635-640
    • Mikitiuk, A.1    Moseley, E.2    Truszczynski, M.3
  • 16
    • 84880206852 scopus 로고    scopus 로고
    • Methods and methodologies for developing answer-set programs-Project description
    • M. Hermenegildo and T. Schaub, Eds. Leibniz International Proceedings in Informatics LIPIcs, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany
    • OETSCH, J., Pü HRER, J., and TOMPITS, H. 2010. Methods and methodologies for developing answer-set programs-Project description. In Technical Communications of the 26th International Conference on Logic Programming (ICLP'10), M. Hermenegildo and T. Schaub, Eds. Leibniz International Proceedings in Informatics (LIPIcs), vol. 7. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany.
    • (2010) Technical Communications of the 26th International Conference on Logic Programming (ICLP'10) , vol.7
    • Oetsch, J.1    Hrer, P.J.2    Tompits, H.3
  • 18
    • 38049029479 scopus 로고    scopus 로고
    • Debugging inconsistent answer set programs
    • Lake District, UK, May 30-June 1, 2006, J. Dix and A. Hunter, Eds. Institut für Informatik, Technische Universität Clausthal, Techical Report, Clausthal, Germany
    • SYRJä NEN, T. 2006. Debugging inconsistent answer set programs. In Proceedings of the 11th International Workshop on Non-Monotonic Reasoning (NMR'06), Lake District, UK, May 30-June 1, 2006, J. Dix and A. Hunter, Eds. Institut für Informatik, Technische Universität Clausthal, Techical Report, Clausthal, Germany, 77-83.
    • (2006) Proceedings of the 11th International Workshop on Non-Monotonic Reasoning (NMR'06) , pp. 77-83
    • Nen, S.T.1
  • 19
    • 69949129489 scopus 로고    scopus 로고
    • Debugging for model expansion
    • Pasadena, CA, USA, July 14-17, 2009, P. M. Hill and D. S. Warren, Eds. Lecture Notes in Computer Science, Springer, Berlin
    • WITTOCX, J., VLAEMINCK, H., and DENECKER, M. 2009. Debugging for model expansion. In Proceedings of the 25th International Conference on Logic Programming (ICLP'09), Pasadena, CA, USA, July 14-17, 2009, P. M. Hill and D. S. Warren, Eds. Lecture Notes in Computer Science, vol. 5649. Springer, Berlin, 296-311.
    • (2009) Proceedings of the 25th International Conference on Logic Programming (ICLP'09) , vol.5649 , pp. 296-311
    • Wittocx, J.1    Vlaeminck, H.2    Denecker, M.3


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