메뉴 건너뛰기




Volumn 141, Issue , 2006, Pages 412-416

Modular equivalence for normal logic programs

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING; SEMANTICS;

EID: 84885975974     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article
Times cited : (79)

References (25)
  • 2
    • 0028429157 scopus 로고
    • Modularity in logic programming
    • M. Bugliesi, E. Lamma, and P. Mello, 'Modularity in logic programming', J. Log. Program., 19/20, 443-502, (1994).
    • (1994) J. Log. Program. , vol.19-20 , pp. 443-502
    • Bugliesi, M.1    Lamma, E.2    Mello, P.3
  • 3
    • 0348155880 scopus 로고    scopus 로고
    • Uniform equivalence of logic programs under the stable model semantics
    • T. Eiter and M. Fink, 'Uniform equivalence of logic programs under the stable model semantics', in Proc. ICLP'03, pp. 224-238, (2003).
    • (2003) Proc. ICLP'03 , pp. 224-238
    • Eiter, T.1    Fink, M.2
  • 4
    • 9444296536 scopus 로고    scopus 로고
    • Simplifying logic programs under uniform and strong equivalence
    • LNAI 2923
    • T. Eiter, M. Fink, H. Tompits, and S. Woltran, 'Simplifying logic programs under uniform and strong equivalence', in Proc. LPNMR'04, pp. 87-99, (2004). LNAI 2923.
    • (2004) Proc. LPNMR'04 , pp. 87-99
    • Eiter, T.1    Fink, M.2    Tompits, H.3    Woltran, S.4
  • 6
    • 0345506733 scopus 로고    scopus 로고
    • Modular logic programming and generalized quantifiers
    • T. Eiter, G. Gottlob, and H. Veith, 'Modular logic programming and generalized quantifiers', in Proc. LPNMR'97, pp. 290-309, (1997).
    • (1997) Proc. LPNMR'97 , pp. 290-309
    • Eiter, T.1    Gottlob, G.2    Veith, H.3
  • 7
    • 84880748819 scopus 로고    scopus 로고
    • On solution correspondences in answer-set programming
    • T. Eiter, H. Tompits, and S. Woltran, 'On solution correspondences in answer-set programming.', in Proc. IJCAI'05, pp. 97-102, (2005).
    • (2005) Proc. IJCAI'05 , pp. 97-102
    • Eiter, T.1    Tompits, H.2    Woltran, S.3
  • 8
    • 0030257457 scopus 로고    scopus 로고
    • Transformations of CLP modules
    • S. Etalle and M. Gabbrielli, 'Transformations of CLP modules', Theor. Comput. Sci., 166(1-2), 101-146, (1996).
    • (1996) Theor. Comput. Sci. , vol.166 , Issue.1-2 , pp. 101-146
    • Etalle, S.1    Gabbrielli, M.2
  • 9
    • 77049088991 scopus 로고    scopus 로고
    • Magic sets and their application to data integration
    • LNCS 3363
    • W. Faber, G. Greco, and N. Leone, 'Magic sets and their application to data integration.', in Proc. ICDT'05, pp. 306-320, (2005). LNCS 3363.
    • (2005) Proc. ICDT'05 , pp. 306-320
    • Faber, W.1    Greco, G.2    Leone, N.3
  • 10
    • 0024860819 scopus 로고
    • Fully abstract compositional semantics for logic programs
    • H. Gaifman and E. Shapiro, 'Fully abstract compositional semantics for logic programs', in Proc. POPL'89, pp. 134-142, (1989).
    • (1989) Proc. POPL'89 , pp. 134-142
    • Gaifman, H.1    Shapiro, E.2
  • 11
    • 1642314661 scopus 로고    scopus 로고
    • Logic programming and knowledge representation-The A-Prolog perspective
    • M. Gelfond and N. Leone, 'Logic programming and knowledge representation-the A-Prolog perspective', Artif. Intell., 138, 3-38, (2002).
    • (2002) Artif. Intell. , vol.138 , pp. 3-38
    • Gelfond, M.1    Leone, N.2
  • 12
    • 0001119421 scopus 로고
    • The stable model semantics for logic programming
    • M. Gelfond and V. Lifschitz, 'The stable model semantics for logic programming', in Proc. ICLP'88, pp. 1070-1080, (1988).
    • (1988) Proc. ICLP'88 , pp. 1070-1080
    • Gelfond, M.1    Lifschitz, V.2
  • 13
    • 84885974043 scopus 로고    scopus 로고
    • Translatability and intranslatability results for certain classes of logic programs
    • Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland
    • T. Janhunen, 'Translatability and intranslatability results for certain classes of logic programs', Research report A82, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, (2003).
    • (2003) Research Report A82
    • Janhunen, T.1
  • 14
    • 85099425894 scopus 로고    scopus 로고
    • Testing the equivalence of logic programs under stable model semantics
    • LNAI 2424
    • T. Janhunen and E. Oikarinen, 'Testing the equivalence of logic programs under stable model semantics', in Proc. JELIA'02, pp. 493-504, (2002). LNAI 2424.
    • (2002) Proc. JELIA'02 , pp. 493-504
    • Janhunen, T.1    Oikarinen, E.2
  • 15
    • 38049033704 scopus 로고    scopus 로고
    • Automated verification of weak equivalence within the SMODELS system
    • Submitted to
    • T. Janhunen and E. Oikarinen, 'Automated verification of weak equivalence within the SMODELS system', (2005). Submitted to TPLP.
    • (2005) TPLP
    • Janhunen, T.1    Oikarinen, E.2
  • 17
    • 0002380358 scopus 로고
    • Splitting a logic program
    • V. Lifschitz and H. Turner, 'Splitting a logic program', in Proc. ICLP'94, pp. 23-37, (1994).
    • (1994) Proc. ICLP'94 , pp. 23-37
    • Lifschitz, V.1    Turner, H.2
  • 18
    • 0027561159 scopus 로고
    • A transformation system for deductive database modules with perfect model semantics
    • M. J. Maher, 'A transformation system for deductive database modules with perfect model semantics', Theor. Comput. Sci., 110(2), 377-403, (1993).
    • (1993) Theor. Comput. Sci. , vol.110 , Issue.2 , pp. 377-403
    • Maher, M.J.1
  • 20
    • 0033260715 scopus 로고    scopus 로고
    • Logic programming with stable model semantics as a constraint programming paradigm
    • I. Niemelä, 'Logic programming with stable model semantics as a constraint programming paradigm', Ann. Math. Artif. Intell., 25(3-4), 241-273, (1999).
    • (1999) Ann. Math. Artif. Intell. , vol.25 , Issue.3-4 , pp. 241-273
    • Niemelä, I.1
  • 21
    • 9444236180 scopus 로고    scopus 로고
    • Verifying the equivalence of logic programs in the disjunctive case
    • LNAI 2923
    • E. Oikarinen and T. Janhunen, 'Verifying the equivalence of logic programs in the disjunctive case', in Proc. LPNMR'04, pp. 180-193, (2004). LNAI 2923.
    • (2004) Proc. LPNMR'04 , pp. 180-193
    • Oikarinen, E.1    Janhunen, T.2
  • 22
    • 0023535527 scopus 로고
    • Optimizing datalog programs
    • Y. Sagiv, 'Optimizing datalog programs', in Proc. PODS'87, pp. 349-362, (1987).
    • (1987) Proc. PODS'87 , pp. 349-362
    • Sagiv, Y.1
  • 23
    • 0345393804 scopus 로고    scopus 로고
    • Strong equivalence made easy: Nested expressions and weight constraints
    • H. Turner, 'Strong equivalence made easy: nested expressions and weight constraints.', TPLP, 3(4-5), 609-622, (2003).
    • (2003) TPLP , vol.3 , Issue.4-5 , pp. 609-622
    • Turner, H.1
  • 24
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • L. G. Valiant, 'The complexity of enumeration and reliability problems', SIAM J. Comput., 8(3), 410-421, (1979).
    • (1979) SIAM J. Comput. , vol.8 , Issue.3 , pp. 410-421
    • Valiant, L.G.1
  • 25
    • 22944481869 scopus 로고    scopus 로고
    • Characterizations for relativized notions of equivalence in answer set programming
    • S. Woltran, 'Characterizations for relativized notions of equivalence in answer set programming', in Proc. JELIA'04, pp. 161-173, (2004).
    • (2004) Proc. JELIA'04 , pp. 161-173
    • Woltran, S.1


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