메뉴 건너뛰기




Volumn 4079 LNCS, Issue , 2006, Pages 196-210

Justifications for logic programs under answer set semantics

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA STRUCTURES; GRAPH THEORY; SEMANTICS; SET THEORY;

EID: 33749332737     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11799573_16     Document Type: Conference Paper
Times cited : (21)

References (20)
  • 1
    • 84941162306 scopus 로고    scopus 로고
    • The nomore++ approach to answer set solving
    • Springer
    • C. Anger et al. The nomore++ Approach to Answer Set Solving. LPAR, Springer, 2005.
    • (2005) LPAR
    • Anger, C.1
  • 2
    • 0028425519 scopus 로고
    • Logic programming and negation: A survey
    • K. Apt, R. Bol. Logic Programming and Negation: A Survey. J. Log. Program. 19/20, 1994.
    • (1994) J. Log. Program. , vol.19-20
    • Apt, K.1    Bol, R.2
  • 3
    • 84941157305 scopus 로고    scopus 로고
    • Assertion checker for the C programming language
    • M. Auguston. Assertion Checker for the C Programming Language. AADEBUG, 2000.
    • (2000) AADEBUG
    • Auguston, M.1
  • 5
    • 0000772277 scopus 로고    scopus 로고
    • Transformation-based bottom-up computation of the well-founded model
    • S. Brass et al. Transformation-based bottom-up computation of the well-founded model. TPLP, 1(5):497-538, 2001.
    • (2001) TPLP , vol.1 , Issue.5 , pp. 497-538
    • Brass, S.1
  • 6
    • 0037121493 scopus 로고    scopus 로고
    • On the equivalence and range of applicability of graph-based representations of logic programs
    • S. Costantini et al. On the Equivalence and Range of Applicability of Graph-based Representations of Logic Programs. Information Processing Letters, 84(5):241-249, 2002.
    • (2002) Information Processing Letters , vol.84 , Issue.5 , pp. 241-249
    • Costantini, S.1
  • 7
    • 0032676385 scopus 로고    scopus 로고
    • Opium: An extendable trace analyzer for prolog
    • M. Ducassé. Opium: an Extendable Trace Analyzer for Prolog. J. Logic Progr., 39, 1999.
    • (1999) J. Logic Progr. , pp. 39
    • Ducassé, M.1
  • 8
    • 29844447174 scopus 로고    scopus 로고
    • A system for reasoning about ASP in prolog
    • Springer
    • O. Elkhatib et al. A System for Reasoning about ASP in Prolog. PADL, Springer, 2004.
    • (2004) PADL
    • Elkhatib, O.1
  • 9
    • 0001119421 scopus 로고
    • The stable model semantics for logic programs
    • M. Gelfond, V. Lifschitz. The Stable Model Semantics for Logic Programs. ILPS, 1988.
    • (1988) ILPS
    • Gelfond, M.1    Lifschitz, V.2
  • 10
    • 27144532406 scopus 로고    scopus 로고
    • On the relation between answer set and SAT procedures
    • Springer Verlag
    • E. Giunchiglia and M. Maratea. On the Relation between Answer Set and SAT Procedures. In ICLP, Springer Verlag, 2005.
    • (2005) ICLP
    • Giunchiglia, E.1    Maratea, M.2
  • 11
    • 22944463475 scopus 로고    scopus 로고
    • The DLV system
    • Springer Verlag
    • N. Leone et al. The DLV System. In JELIA, Springer Verlag, 2002.
    • (2002) JELIA
    • Leone, N.1
  • 12
    • 33749345102 scopus 로고    scopus 로고
    • Generating deductive database explanations
    • MIT
    • S. Mallet, M. Ducasse. Generating Deductive Database Explanations. ICLP, MIT, 1999.
    • (1999) ICLP
    • Mallet, S.1    Ducasse, M.2
  • 13
    • 0001775594 scopus 로고    scopus 로고
    • Stable models and an alternative logic programming paradigm
    • Springer Verlag
    • V.W. Marek and M. Truszczyński. Stable Models and an Alternative Logic Programming Paradigm. The Logic Programming Paradigm, Springer Verlag, 1999.
    • (1999) The Logic Programming Paradigm
    • Marek, V.W.1    Truszczyński, M.2
  • 14
    • 38049012177 scopus 로고    scopus 로고
    • Online justification for tabled logic programs
    • G. Pemmasani et al. Online Justification for Tabled Logic Programs. FLOPS, 2004.
    • (2004) FLOPS
    • Pemmasani, G.1
  • 16
    • 0037544944 scopus 로고    scopus 로고
    • A framework for assertion-based debugging in constraint logic programming
    • Springer Verlag
    • G. Puebla, F. Bueno, M.V. Hermenegildo. A Framework for Assertion-based Debugging in Constraint Logic Programming. In LOPSTR, Springer Verlag, 1999.
    • (1999) LOPSTR
    • Puebla, G.1    Bueno, F.2    Hermenegildo, M.V.3
  • 17
    • 85086422180 scopus 로고    scopus 로고
    • Justifying proofs using memo tables
    • ACM Press
    • A. Roychoudhury et al. Justifying Proofs Using Memo Tables. PPDP, ACM Press, 2000.
    • (2000) PPDP
    • Roychoudhury, A.1
  • 18
    • 33644547201 scopus 로고
    • Algorithmic program diagnosis
    • ACM Press
    • E. Shapiro. Algorithmic Program Diagnosis. In POPL, ACM Press, 1982.
    • (1982) POPL
    • Shapiro, E.1
  • 19
    • 0010122418 scopus 로고    scopus 로고
    • Extending and implementing the stable model semantics
    • P. Simons et al. Extending and Implementing the Stable Model Semantics. Artif. Intell., 138(1-2), 2002.
    • (2002) Artif. Intell. , vol.138 , Issue.1-2
    • Simons, P.1
  • 20
    • 33749369380 scopus 로고
    • Generating explanation trees even for negation in deductive databases
    • Vancouver
    • G. Specht. Generating Explanation Trees even for Negation in Deductive Databases. Workshop on Logic Programming Environments, 8-13, Vancouver, 1993.
    • (1993) Workshop on Logic Programming Environments , pp. 8-13
    • Specht, G.1


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