메뉴 건너뛰기




Volumn 6341 LNAI, Issue , 2010, Pages 156-168

A logical semantics for description logic programs

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET SEMANTICS; DESCRIPTION LOGIC; DESCRIPTION LOGIC PROGRAMS; LOGIC PROGRAMS; LOGICAL RELATIONS; LOGICAL SEMANTICS; MONOTONIC RULES; REDUCTS;

EID: 78049391065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15675-5_15     Document Type: Conference Paper
Times cited : (12)

References (27)
  • 1
    • 77249122278 scopus 로고    scopus 로고
    • Combining answer set programming with description logics for the semantic web
    • AAAI Press, Menlo Park
    • Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. In: KR, pp. 141-151. AAAI Press, Menlo Park (2004)
    • (2004) KR , pp. 141-151
    • Eiter, T.1    Lukasiewicz, T.2    Schindlauer, R.3    Tompits, H.4
  • 2
    • 84860600786 scopus 로고    scopus 로고
    • Dl+log: Tight integration of description logics and disjunctive datalog
    • AAAI Press, Menlo Park
    • Rosati, R.: Dl+log: Tight integration of description logics and disjunctive datalog. In: KR, pp. 68-78. AAAI Press, Menlo Park (2006)
    • (2006) KR , pp. 68-78
    • Rosati, R.1
  • 3
    • 21244492715 scopus 로고    scopus 로고
    • On the decidability and complexity of integrating ontologies and rules
    • Rosati, R.: On the decidability and complexity of integrating ontologies and rules. J. Web Sem. 3(1), 61-73 (2005)
    • (2005) J. Web Sem. , vol.3 , Issue.1 , pp. 61-73
    • Rosati, R.1
  • 4
    • 33646205492 scopus 로고    scopus 로고
    • Semantic and computational advantages of the safe integration of ontologies and rules
    • Fages, F., Soliman, S. (eds.) PPSWR 2005. Springer, Heidelberg
    • Rosati, R.: Semantic and computational advantages of the safe integration of ontologies and rules. In: Fages, F., Soliman, S. (eds.) PPSWR 2005. LNCS, vol. 3703, pp. 50-64. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3703 , pp. 50-64
    • Rosati, R.1
  • 6
    • 84880721144 scopus 로고    scopus 로고
    • A uniform integration of higher-order reasoning and external evaluations in answer-set programming
    • Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In: IJCAI, pp. 90-96 (2005)
    • (2005) IJCAI , pp. 90-96
    • Eiter, T.1    Ianni, G.2    Schindlauer, R.3    Tompits, H.4
  • 7
    • 58549108075 scopus 로고    scopus 로고
    • Quantified equilibrium logic and foundations for answer set programs
    • Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. Springer, Heidelberg
    • Pearce, D., Valverde, A.: Quantified equilibrium logic and foundations for answer set programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 546-560. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5366 , pp. 546-560
    • Pearce, D.1    Valverde, A.2
  • 8
    • 33750039839 scopus 로고    scopus 로고
    • Equilibrium logic
    • Pearce, D.: Equilibrium logic. AMAI 47(1-2), 3-41 (2006)
    • (2006) AMAI , vol.47 , Issue.1-2 , pp. 3-41
    • Pearce, D.1
  • 9
    • 35148898808 scopus 로고    scopus 로고
    • Conservative extensions in the lightweight description logic EL
    • Pfenning, F. (ed.) CADE 2007. Springer, Heidelberg
    • Lutz, C., Wolter, F.: Conservative extensions in the lightweight description logic EL. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 84-99. Springer, Heidelberg (2007)
    • (2007) LNCS (LNAI) , vol.4603 , pp. 84-99
    • Lutz, C.1    Wolter, F.2
  • 10
    • 84880876708 scopus 로고    scopus 로고
    • Conservative extensions in expressive description logics
    • Lutz, C., Walther, D., Wolter, F.: Conservative extensions in expressive description logics. In: IJCAI, pp. 453-458 (2007)
    • (2007) IJCAI , pp. 453-458
    • Lutz, C.1    Walther, D.2    Wolter, F.3
  • 11
    • 84860544288 scopus 로고    scopus 로고
    • Can you tell the difference between dl-lite ontologies?
    • AAAI Press, Menlo Park
    • Kontchakov, R., Wolter, F., Zakharyaschev, M.: Can you tell the difference between dl-lite ontologies? In: KR, pp. 285-295. AAAI Press, Menlo Park (2008)
    • (2008) KR , pp. 285-295
    • Kontchakov, R.1    Wolter, F.2    Zakharyaschev, M.3
  • 12
    • 84945953994 scopus 로고    scopus 로고
    • Strongly equivalent logic programs
    • Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACMTOCL 2(4), 526-541 (2001)
    • (2001) ACMTOCL , vol.2 , Issue.4 , pp. 526-541
    • Lifschitz, V.1    Pearce, D.2    Valverde, A.3
  • 13
    • 78049412109 scopus 로고    scopus 로고
    • A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
    • forthcoming
    • Fink, M.: A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there. In: TPLP (2010) (forthcoming)
    • (2010) TPLP
    • Fink, M.1
  • 14
    • 58549111673 scopus 로고    scopus 로고
    • Equivalences in answer-set programming by countermodels in the logic of hereand- There
    • Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. Springer, Heidelberg
    • Fink, M.: Equivalences in answer-set programming by countermodels in the logic of hereand- there. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 99-113. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5366 , pp. 99-113
    • Fink, M.1
  • 15
    • 38049092028 scopus 로고    scopus 로고
    • A characterization of strong equivalence for logic programs with variables
    • Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. Springer, Heidelberg
    • Lifschitz, V., Pearce, D., Valverde, A.: A characterization of strong equivalence for logic programs with variables. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 188-200. Springer, Heidelberg (2007)
    • (2007) LNCS (LNAI) , vol.4483 , pp. 188-200
    • Lifschitz, V.1    Pearce, D.2    Valverde, A.3
  • 20
    • 51149116102 scopus 로고    scopus 로고
    • Open answer set programming with guarded programs
    • Heymans, S., Nieuwenborgh, D.V., Vermeir, D.: Open answer set programming with guarded programs. ACM TOCL 9(4) (2008)
    • (2008) ACM TOCL , vol.9 , pp. 4
    • Heymans, S.1    Nieuwenborgh, D.V.2    Vermeir, D.3
  • 21
    • 84880867448 scopus 로고    scopus 로고
    • A new perspective on stable models
    • Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: IJCAI, pp. 372-379 (2007)
    • (2007) IJCAI , pp. 372-379
    • Ferraris, P.1    Lee, J.2    Lifschitz, V.3
  • 22
    • 26444481976 scopus 로고    scopus 로고
    • A first order nonmonotonic extension of constructive logic
    • DOI 10.1007/s11225-005-8473-8
    • Pearce, D., Valverde, A.: A first order nonmonotonic extension of constructive logic. Studia Logica 80(2-3), 321-346 (2005) (Pubitemid 41433455)
    • (2005) Studia Logica , vol.80 , Issue.2-3 , pp. 321-346
    • Pearce, D.1    Valverde, A.2
  • 23
    • 46549089044 scopus 로고    scopus 로고
    • Combining answer set programming with description logics for the Semantic Web
    • Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the Semantic Web. AIJ 172(12-13), 1495-1539 (2008)
    • (2008) AIJ , vol.172 , Issue.12-13 , pp. 1495-1539
    • Eiter, T.1    Ianni, G.2    Lukasiewicz, T.3    Schindlauer, R.4    Tompits, H.5
  • 25
    • 70350708070 scopus 로고    scopus 로고
    • Deciding inseparability and conservative extensions in the description logic el
    • Lutz, C., Wolter, F.: Deciding inseparability and conservative extensions in the description logic el. J. Symb. Comput. 45(2), 194-228 (2010)
    • (2010) J. Symb. Comput. , vol.45 , Issue.2 , pp. 194-228
    • Lutz, C.1    Wolter, F.2


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