메뉴 건너뛰기




Volumn 3229, Issue , 2004, Pages 174-186

Equivalence of logic programs under updates

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; LOGIC PROGRAMMING;

EID: 22944478382     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_17     Document Type: Conference Paper
Times cited : (46)

References (22)
  • 1
    • 0031236548 scopus 로고    scopus 로고
    • Characterization of the disjunctive stable semantics by partial evaluation
    • S. Brass and J. Dix. Characterization of the disjunctive stable semantics by partial evaluation. Journal of Logic Programming, 32(3):207-228, 1997.
    • (1997) Journal of Logic Programming , vol.32 , Issue.3 , pp. 207-228
    • Brass, S.1    Dix, J.2
  • 2
    • 0348155880 scopus 로고    scopus 로고
    • Uniform equivalence of logic programs under the stable model semantics
    • Springer
    • T. Eiter and M. Fink. Uniform equivalence of logic programs under the stable model semantics. In: Proc. of ICLP 2003, LNCS 2916, pp. 224-238, Springer, 2003.
    • (2003) Proc. of ICLP 2003 , vol.2916 LNCS , pp. 224-238
    • Eiter, T.1    Fink, M.2
  • 3
    • 84937412309 scopus 로고    scopus 로고
    • Reasoning about evolving nonmonotonic knowledge bases
    • Springer
    • T. Eiter, M. Fink, G. Sabbatini, and H. Tompits. Reasoning about evolving nonmonotonic knowledge bases. In: Proc. of LPAR 2001, LNAI 2250, pp. 407-421, Springer, 2001.
    • (2001) Proc. of LPAR 2001 , vol.2250 LNAI , pp. 407-421
    • Eiter, T.1    Fink, M.2    Sabbatini, G.3    Tompits, H.4
  • 4
    • 9444296536 scopus 로고    scopus 로고
    • Simplifying logic programs under uniform and strong equivalence
    • Springer
    • T. Eiter, M. Fink, H. Tompits, and S. Woltran. Simplifying logic programs under uniform and strong equivalence. In: Proc. of LPNMR 2004, LNAI 2923, pp. 87-99, Springer, 2004.
    • (2004) Proc. of LPNMR 2004 , vol.2923 LNAI , pp. 87-99
    • Eiter, T.1    Fink, M.2    Tompits, H.3    Woltran, S.4
  • 5
    • 77951505493 scopus 로고
    • Classical negation in logic programs and disjunctive databases
    • M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
    • (1991) New Generation Computing , vol.9 , pp. 365-385
    • Gelfond, M.1    Lifschitz, V.2
  • 8
    • 84888222419 scopus 로고    scopus 로고
    • Disjunctive explanations
    • Springer
    • K. Inoue and C. Sakama. Disjunctive explanations. In: Proc. of ICLP 2002, LNCS 2401, pp. 317-332, Springer, 2002.
    • (2002) Proc. of ICLP 2002 , vol.2401 LNCS , pp. 317-332
    • Inoue, K.1    Sakama, C.2
  • 9
    • 0000699514 scopus 로고    scopus 로고
    • The role of abduction in logic programming
    • D. M. Gabbay, C. J. Hogger and J. A. Robinson eds., Oxford University Press
    • A. C. Kakas, R. A. Kowalski, and F. Toni. The role of abduction in logic programming. In: D. M. Gabbay, C. J. Hogger and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, pp. 235-324, Oxford University Press, 1998.
    • (1998) Handbook of Logic in Artificial Intelligence and Logic Programming , vol.5 , pp. 235-324
    • Kakas, A.C.1    Kowalski, R.A.2    Toni, F.3
  • 13
    • 0041061185 scopus 로고
    • Answer sets in general nonmonotonic reasoning (preliminary report)
    • Morgan Kaufmann
    • V. Lifschitz and T. Y. C. Woo. Answer sets in general nonmonotonic reasoning (preliminary report). In: Proc. of KR'92, pp. 603-614, Morgan Kaufmann, 1992.
    • (1992) Proc. of KR'92 , pp. 603-614
    • Lifschitz, V.1    Woo, T.Y.C.2
  • 14
    • 0345537156 scopus 로고    scopus 로고
    • Reducing strong equivalence of logic programs to entailment in classical propositional logic
    • Morgan Kaufmann
    • F. Lin. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proc. of KR 2002, pp. 170-176, Morgan Kaufmann, 2002.
    • (2002) Proc. of KR 2002 , pp. 170-176
    • Lin, F.1
  • 17
    • 84879489747 scopus 로고    scopus 로고
    • Equivalence in answer set programming
    • Springer
    • M. Osorio, J. A. Navarro, and J. Arrazola. Equivalence in answer set programming. In: Proc. of LOPSTR 2001, LNCS 2372, pp. 57-75, Springer, 2001.
    • (2001) Proc. of LOPSTR 2001 , vol.2372 LNCS , pp. 57-75
    • Osorio, M.1    Navarro, J.A.2    Arrazola, J.3
  • 18
    • 84860173301 scopus 로고    scopus 로고
    • Encodings for equilibrium logic and logic programs with nested expressions
    • Springer
    • D. Pearce, H. Tompits, and S. Woltran. Encodings for equilibrium logic and logic programs with nested expressions. In: Proc. of EPIA 2001, LNCS 2258, pp. 306-320, Springer, 2001.
    • (2001) Proc. of EPIA 2001 , vol.2258 LNCS , pp. 306-320
    • Pearce, D.1    Tompits, H.2    Woltran, S.3
  • 21
    • 0345393804 scopus 로고    scopus 로고
    • Strong equivalence made easy: Nested expressions and weight constraints
    • H. Turner. Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming, 3(4-5):609-622, 2003.
    • Theory and Practice of Logic Programming , vol.3 , Issue.4-5 , pp. 609-6222003
    • Turner, H.1
  • 22
    • 70349860461 scopus 로고    scopus 로고
    • Characterizations for relativized notions of equivalence in answer set programming
    • LNAI, this volume
    • S. Woltran. Characterizations for relativized notions of equivalence in answer set programming. In: Proc. of JELIA'04, LNAI, this volume, 2004.
    • (2004) Proc. of JELIA'04
    • Woltran, S.1


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