메뉴 건너뛰기




Volumn 265, Issue , 2007, Pages 37-48

Relativised equivalence in equilibrium logic and its applications to prediction and explanation: Preliminary report

Author keywords

[No Author keywords available]

Indexed keywords

DISJUNCTIVE LOGIC PROGRAMS; EQUILIBRIUM LOGIC; ITS APPLICATIONS; LITERALS; NONMONOTONIC;

EID: 84886612705     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (19)
  • 1
    • 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. ICLP 2003, Vol. 2916 in LNCS, pg. 224-238. Springer, 2003.
    • (2003) Proc. ICLP 2003, Vol. 2916 in LNCS , pp. 224-238
    • Eiter, T.1    Fink, M.2
  • 2
    • 34547509865 scopus 로고    scopus 로고
    • Semantical characterizations and complexity of equivalences in stable logic programming
    • To appear
    • T. Eiter, M. Fink, and S. Woltran. Semantical characterizations and complexity of equivalences in stable logic programming. ACM Transactions on Computational Logic, 2007. To appear.
    • (2007) ACM Transactions on Computational Logic
    • Eiter, T.1    Fink, M.2    Woltran, S.3
  • 3
    • 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 2005, pg. 97-102, 2005.
    • (2005) Proc. IJCAI 2005 , pp. 97-102
    • Eiter, T.1    Tompits, H.2    Woltran, S.3
  • 5
    • 33646041309 scopus 로고    scopus 로고
    • Answer sets for propositional theories
    • Springer
    • P. Ferraris. Answer sets for propositional theories. In Proc. LPNMR 2005, Vol. 3662 in LNCS, pg. 119-131. Springer, 2005.
    • (2005) Proc. LPNMR 2005, Vol. 3662 in LNCS , pp. 119-131
    • Ferraris, P.1
  • 6
    • 9444257668 scopus 로고
    • Intuitionistic logic with strong negation
    • Y. Gurevich. Intuitionistic logic with strong negation. Studia Logica, 36(1-2): 49-59, 1977.
    • (1977) Studia Logica , vol.36 , Issue.1-2 , pp. 49-59
    • Gurevich, Y.1
  • 7
    • 22944478382 scopus 로고    scopus 로고
    • Equivalence of logic programs under updates
    • Springer
    • K. Inoue and C. Sakama. Equivalence of logic programs under updates. In Proc. JELIA 2004, Vol. 3229 of LNCS, pg. 174-186. Springer, 2004.
    • (2004) Proc. JELIA 2004, Vol. 3229 of LNCS , pp. 174-186
    • Inoue, K.1    Sakama, C.2
  • 8
    • 84880742309 scopus 로고    scopus 로고
    • Equivalence in abductive logic
    • K. Inoue and C. Sakama. Equivalence in abductive logic. In Proc. IJCAI 2005, pg. 472-477, 2005.
    • (2005) Proc. IJCAI 2005 , pp. 472-477
    • Inoue, K.1    Sakama, C.2
  • 10
    • 54649084682 scopus 로고    scopus 로고
    • On extensions of intermediate logics by strong negation
    • M. Kracht. On extensions of intermediate logics by strong negation. Journal of Philosophical Logic, 27(1): 49-73, 1998.
    • (1998) Journal of Philosophical Logic , vol.27 , Issue.1 , pp. 49-73
    • Kracht, M.1
  • 14
    • 9444288708 scopus 로고    scopus 로고
    • Uniform equivalence for equilibrium logic and logic programs
    • Springer
    • D. Pearce and A. Valverde. Uniform equivalence for equilibrium logic and logic programs. In Proc. LPNMR 2004, Vol. 2923 of LNCS, pg. 194-206. Springer, 2004.
    • (2004) Proc. LPNMR 2004, Vol. 2923 of LNCS , pp. 194-206
    • Pearce, D.1    Valverde, A.2
  • 15
    • 84864208682 scopus 로고    scopus 로고
    • Strong equivalence for logic programs and default theories (made easy)
    • Springer
    • H. Turner. Strong equivalence for logic programs and default theories (made easy). In Proc. LPNMR 2001, Vol. 2173 of LNCS, pg. 81-92. Springer, 2001.
    • (2001) Proc. LPNMR 2001, Vol. 2173 of LNCS , pp. 81-92
    • Turner, H.1
  • 17
    • 9444226043 scopus 로고
    • A constructive propositional calculus with strong negation (in Russian)
    • N. N. Vorob'ev. A constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85: 465-468, 1952.
    • (1952) Doklady Akademii Nauk SSR , vol.85 , pp. 465-468
    • Vorob'ev, N.N.1
  • 18
    • 9444232374 scopus 로고
    • The problem of deducibility in constructive propositional calculus with strong negation (in Russian)
    • N. N. Vorob'ev. The problem of deducibility in constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR, 85: 689-692, 1952.
    • (1952) Doklady Akademii Nauk SSR , vol.85 , pp. 689-692
    • Vorob'ev, N.N.1
  • 19
    • 22944481869 scopus 로고    scopus 로고
    • Characterizations for relativized notions of equivalence in answer set programming
    • Springer
    • S. Woltran. Characterizations for relativized notions of equivalence in answer set programming. In Proc. JELIA 2004, Vol. 3229 of LNCS, pg. 161-173. Springer, 2004.
    • (2004) Proc. JELIA 2004, Vol. 3229 of LNCS , pp. 161-173
    • Woltran, S.1


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