Combining answer set programming with description logics for the Semantic Web
We propose a combination of logic programming under the answer set semantics with the description logics SHIF ( D ) and SHOIN ( D ) , which underly the Web ontology languages OWL Lite and OWL DL, respectively. To this end, we introduce description logic programs (or dl-programs), which consist of a...
Uloženo v:
| Vydáno v: | Artificial intelligence Ročník 172; číslo 12; s. 1495 - 1539 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Oxford
Elsevier B.V
01.08.2008
Elsevier |
| Témata: | |
| ISSN: | 0004-3702, 1872-7921 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We propose a combination of logic programming under the answer set semantics with the description logics
SHIF
(
D
)
and
SHOIN
(
D
)
, which underly the Web ontology languages OWL Lite and OWL DL, respectively. To this end, we introduce
description logic programs (or
dl-programs), which consist of a description logic knowledge base
L and a finite set
P of
description logic rules (or
dl-rules). Such rules are similar to usual rules in nonmonotonic logic programs, but they may also contain
queries to L, possibly under default negation, in their bodies. They allow for building rules on top of ontologies but also, to a limited extent, building ontologies on top of rules. We define a suite of semantics for various classes of dl-programs, which conservatively extend the standard semantics of the respective classes and coincide with it in absence of a description logic knowledge base. More concretely, we generalize positive, stratified, and arbitrary normal logic programs to dl-programs, and define a Herbrand model semantics for them. We show that they have similar properties as ordinary logic programs, and also provide fixpoint characterizations in terms of (iterated) consequence operators. For arbitrary dl-programs, we define answer sets by generalizing Gelfond and Lifschitz's notion of a transform, leading to a
strong and a
weak answer set semantics, which are based on reductions to the semantics of positive dl-programs and ordinary positive logic programs, respectively. We also show how the weak answer sets can be computed utilizing answer sets of ordinary normal logic programs. Furthermore, we show how some advanced reasoning tasks for the Semantic Web, including different forms of closed-world reasoning and default reasoning, as well as DL-safe rules, can be realized on top of dl-programs. Finally, we give a precise picture of the computational complexity of dl-programs, and we describe efficient algorithms and a prototype implementation of dl-programs which is available on the Web. |
|---|---|
| AbstractList | We propose a combination of logic programming under the answer set semantics with the description logics
SHIF
(
D
)
and
SHOIN
(
D
)
, which underly the Web ontology languages OWL Lite and OWL DL, respectively. To this end, we introduce
description logic programs (or
dl-programs), which consist of a description logic knowledge base
L and a finite set
P of
description logic rules (or
dl-rules). Such rules are similar to usual rules in nonmonotonic logic programs, but they may also contain
queries to L, possibly under default negation, in their bodies. They allow for building rules on top of ontologies but also, to a limited extent, building ontologies on top of rules. We define a suite of semantics for various classes of dl-programs, which conservatively extend the standard semantics of the respective classes and coincide with it in absence of a description logic knowledge base. More concretely, we generalize positive, stratified, and arbitrary normal logic programs to dl-programs, and define a Herbrand model semantics for them. We show that they have similar properties as ordinary logic programs, and also provide fixpoint characterizations in terms of (iterated) consequence operators. For arbitrary dl-programs, we define answer sets by generalizing Gelfond and Lifschitz's notion of a transform, leading to a
strong and a
weak answer set semantics, which are based on reductions to the semantics of positive dl-programs and ordinary positive logic programs, respectively. We also show how the weak answer sets can be computed utilizing answer sets of ordinary normal logic programs. Furthermore, we show how some advanced reasoning tasks for the Semantic Web, including different forms of closed-world reasoning and default reasoning, as well as DL-safe rules, can be realized on top of dl-programs. Finally, we give a precise picture of the computational complexity of dl-programs, and we describe efficient algorithms and a prototype implementation of dl-programs which is available on the Web. |
| Author | Tompits, Hans Eiter, Thomas Lukasiewicz, Thomas Schindlauer, Roman Ianni, Giovambattista |
| Author_xml | – sequence: 1 givenname: Thomas surname: Eiter fullname: Eiter, Thomas email: eiter@kr.tuwien.ac.at organization: Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria – sequence: 2 givenname: Giovambattista surname: Ianni fullname: Ianni, Giovambattista email: ianni@kr.tuwien.ac.at organization: Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria – sequence: 3 givenname: Thomas surname: Lukasiewicz fullname: Lukasiewicz, Thomas email: lukasiewicz@kr.tuwien.ac.at organization: Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria – sequence: 4 givenname: Roman surname: Schindlauer fullname: Schindlauer, Roman email: roman@kr.tuwien.ac.at organization: Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria – sequence: 5 givenname: Hans surname: Tompits fullname: Tompits, Hans email: tompits@kr.tuwien.ac.at organization: Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20513334$$DView record in Pascal Francis |
| BookMark | eNqFkE1LxDAQhoOs4O7qP_CQi8fWSZN-eRBk8QtWPKh4DNM03c3SpksSXPz3tlQ8eNDTMMP7vDDPgsxsbzUh5wxiBiy73MXogrEhTgCKGEQMkByROSvyJMrLhM3IHABExHNITsjC-92w8rJkc_K06rvKWGM3FK0_aEe9DnTv-o3DrhvPBxO2tNZeObMPpre07TdGedr0joatpi-6QxuMou-6OiXHDbZen33PJXm7u31dPUTr5_vH1c06UpxnIcIyV5grkeZMpyVUUDCepRWUSSWaGkssKwEMkeu64XXC06bAosAKc5GxvEK-JBdT7x69wrZxaJXxcu9Mh-5TJpAyzrkYcmLKKdd773TzE2EgR3VyJyd1clQnQchB3YBd_cKUCTg-Hxya9j_4eoL1IODDaCe9MtoqXRunVZB1b_4u-ALih4-y |
| CODEN | AINTBB |
| CitedBy_id | crossref_primary_10_3233_DS_170006 crossref_primary_10_1017_S1471068420000381 crossref_primary_10_1145_1877714_1877717 crossref_primary_10_1186_2041_1480_2_2 crossref_primary_10_1007_s10506_018_9220_6 crossref_primary_10_3233_SW_140156 crossref_primary_10_1016_j_artint_2019_103220 crossref_primary_10_1017_S1471068419000164 crossref_primary_10_1007_s13218_020_00686_3 crossref_primary_10_1016_j_jlamp_2017_01_005 crossref_primary_10_1016_j_artint_2017_11_007 crossref_primary_10_1016_j_artint_2010_12_001 crossref_primary_10_1017_S1471068424000073 crossref_primary_10_1016_j_ins_2022_11_165 crossref_primary_10_3390_e21090903 crossref_primary_10_1109_TCDS_2017_2749978 crossref_primary_10_1007_s10472_013_9350_1 crossref_primary_10_1109_TKDE_2010_111 crossref_primary_10_1007_s10472_017_9563_9 crossref_primary_10_1017_S1471068410000268 crossref_primary_10_1145_3447508 crossref_primary_10_1016_j_websem_2012_03_001 crossref_primary_10_1017_S147106841500023X crossref_primary_10_1017_S1471068411000597 crossref_primary_10_1080_10494820_2012_745430 crossref_primary_10_1017_S1471068411000561 crossref_primary_10_1111_cla_12201 crossref_primary_10_1017_S1471068412000233 crossref_primary_10_1016_j_artint_2014_12_010 crossref_primary_10_1017_S1471068410000098 crossref_primary_10_1016_j_artint_2016_01_003 crossref_primary_10_1016_j_datak_2011_04_001 crossref_primary_10_1017_S1471068415000113 crossref_primary_10_1017_S1471068414000325 crossref_primary_10_1145_1929954_1929957 crossref_primary_10_1007_s00500_018_3502_5 crossref_primary_10_1017_S1471068421000132 crossref_primary_10_1017_S147106841800056X crossref_primary_10_1016_j_artint_2019_103165 crossref_primary_10_1007_s10472_012_9280_3 crossref_primary_10_1017_S1471068419000140 crossref_primary_10_1093_logcom_exae038 crossref_primary_10_1016_j_artint_2020_103370 crossref_primary_10_1145_1754399_1754403 crossref_primary_10_1007_s13218_020_00672_9 crossref_primary_10_1007_s10472_024_09925_x crossref_primary_10_1016_j_artint_2011_01_007 crossref_primary_10_1016_j_tcs_2011_10_026 crossref_primary_10_1145_2480759_2480768 crossref_primary_10_1080_13875868_2024_2324875 crossref_primary_10_1007_s10115_020_01516_6 crossref_primary_10_1017_S1471068416000399 crossref_primary_10_1017_S1471068415000228 crossref_primary_10_1016_j_artint_2016_06_003 crossref_primary_10_1017_S1471068418000145 crossref_primary_10_1093_logcom_exn043 crossref_primary_10_1017_S1471068421000284 crossref_primary_10_1007_s10472_016_9524_8 crossref_primary_10_1016_j_artint_2014_05_001 crossref_primary_10_1017_S1471068415000095 crossref_primary_10_1007_s13218_020_00650_1 crossref_primary_10_1016_j_artint_2025_104361 crossref_primary_10_1016_j_artint_2024_104099 crossref_primary_10_1016_j_artint_2017_12_005 crossref_primary_10_1007_s10472_009_9111_3 crossref_primary_10_1007_s10209_016_0465_0 crossref_primary_10_1007_s11704_013_2284_2 crossref_primary_10_1016_j_artint_2016_04_004 |
| Cites_doi | 10.1007/BF00883932 10.1016/j.websem.2005.05.002 10.1007/s10849-005-5791-1 10.1145/1149114.1149117 10.1007/BF01536399 10.1016/0304-3975(94)00080-3 10.1016/0004-3702(88)90077-X 10.1007/BF03037169 10.1016/j.websem.2003.07.001 10.1016/j.artint.2005.05.003 10.1016/j.websem.2005.05.003 10.1093/logcom/2.3.397 10.1145/116825.116838 10.1023/A:1008687430626 10.1038/scientificamerican0501-34 10.1016/0004-3702(89)90068-4 10.1016/S0004-3702(98)00048-4 10.1016/0022-0000(89)90025-1 10.1145/502807.502810 10.1016/0004-3702(80)90014-4 10.1145/505372.505373 10.1109/5254.920598 10.1016/S0022-0000(05)80004-2 10.1016/j.websem.2005.05.001 |
| ContentType | Journal Article |
| Copyright | 2008 Elsevier B.V. 2009 INIST-CNRS |
| Copyright_xml | – notice: 2008 Elsevier B.V. – notice: 2009 INIST-CNRS |
| DBID | 6I. AAFTH AAYXX CITATION IQODW |
| DOI | 10.1016/j.artint.2008.04.002 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1872-7921 |
| EndPage | 1539 |
| ExternalDocumentID | 20513334 10_1016_j_artint_2008_04_002 S0004370208000520 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 4.4 457 4G. 5GY 5VS 6I. 6J9 6TJ 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AAKPC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACWUS ACZNC ADBBV ADEZE ADMUD AEBSH AECPX AEFWE AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 E3Z EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE IXB J1W JJJVA KOM KQ8 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 TR2 TWZ UPT UQL VQA WH7 WUQ XFK XJE XJT XPP XSW ZMT ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH |
| ID | FETCH-LOGICAL-c336t-a97ca7c4571e590b081365b092b4fda9a9b401aa3edf3d235f8a88aba74617ba3 |
| ISICitedReferencesCount | 172 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258161300003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0004-3702 |
| IngestDate | Mon Jul 21 09:14:13 EDT 2025 Sat Nov 29 06:08:05 EST 2025 Tue Nov 18 22:33:17 EST 2025 Fri Feb 23 02:31:59 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 12 |
| Keywords | Semantic Web Closed-world reasoning Description logics Answer set programming Ontologies Rules Computational complexity Default logic Database query Ontology Knowledge representation Web service Knowledge base Logical programming Task analysis Modeling Circumscription Exact solution Semantic web Description logic Semantics World wide web Internet Artificial intelligence Program complexity |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c336t-a97ca7c4571e590b081365b092b4fda9a9b401aa3edf3d235f8a88aba74617ba3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.artint.2008.04.002 |
| PageCount | 45 |
| ParticipantIDs | pascalfrancis_primary_20513334 crossref_primary_10_1016_j_artint_2008_04_002 crossref_citationtrail_10_1016_j_artint_2008_04_002 elsevier_sciencedirect_doi_10_1016_j_artint_2008_04_002 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-08-01 |
| PublicationDateYYYYMMDD | 2008-08-01 |
| PublicationDate_xml | – month: 08 year: 2008 text: 2008-08-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford |
| PublicationTitle | Artificial intelligence |
| PublicationYear | 2008 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Lukasiewicz (bib071) 2006; 82 Polleres, Feier, Harth (bib085) 2006; vol. 4011 Eiter, Ianni, Schindlauer, Tompits (bib030) 2005 Eiter, Gottlob, Veith (bib025) 1997; vol. 1265 Rosati (bib092) 2005; vol. 3703 R. Schindlauer, Answer-set programming for the Semantic Web, PhD thesis, Vienna University of Technology, Austria, 2006. Available at Motik, Horrocks, Rosati, Sattler (bib075) 2006; vol. 4273 Berardi, Calvanese, De Giacomo (bib008) 2005; 168 Lenzerini (bib064) 2002 Horrocks, Patel-Schneider, Boley, Tabet, Grosof, Dean (bib057) Motik, Sattler, Studer (bib080) 2005; 3 Analyti, Antoniou, Damásio, Wagner (bib002) 2005; vol. 3729 Levy, Rousset (bib066) 1998; 104 Lukasiewicz (bib073) 2007; vol. 4772 bib102 bib101 G. Alsaç, C. Baral, Reasoning in description logics using declarative logic programming, Technical report, Department of Computer Science and Engineering, Arizona State University, 2001 Swift (bib097) 2004; vol. 2923 Wang, Antoniou, Topor, Sattar (bib103) 2005; vol. 3791 (bib036) 2002 Poole (bib086) 1988; 36 Motik, Sattler, Studer (bib079) 2004; vol. 3298 Papadimitriou (bib084) 1994 F. Yang, X. Chen, Z. Wang, p-dl-programs: Combining dl-programs with preference for Semantic Web. Unpublished manuscript, Aug. 2006 Eiter, Ianni, Schindlauer, Tompits (bib031) 2006; vol. 4011 Pratt-Hartmann (bib087) 2005; 14 Bonatti, Lutz, Wolter (bib012) 2006 I. Niemelä, P. Simons, T. Syrjänen, Smodels: A system for answer set programming, in: Proceedings NMR-2000, 2000 Börger, Grädel, Gurevich (bib013) 2001 Horrocks, Patel-Schneider (bib055) 2004 Lukasiewicz (bib070) 2005; vol. 3571 Horrocks, Patel-Schneider, Bechhofer, Tsarkov (bib056) 2005; 3 de Bruijn, Eiter, Polleres, Tompits (bib019) 2007 Glimm, Horrocks, Lutz, Sattler (bib042) 2007 Van Belleghem, Denecker, De Schreye (bib099) 1997 Motik, Sattler (bib078) 2006 Donini, Nardi, Rosati (bib022) 2002; 3 Reiter (bib088) 1978 Antoniou (bib004) 2002; vol. 2342 Gelfond, Przymusinska, Przymusinski (bib041) 1989; 38 Lifschitz, Turner (bib069) 1994 Angele, Boley, de Bruijn, Fensel, Hitzler, Kifer, Krummenacher, Lausen, Polleres, Studer (bib003) Eiter, Ianni, Schindlauer, Tompits (bib029) 2005; vol. 3452 Horrocks, Patel-Schneider, van Harmelen (bib058) 2003; 1 Grosof, Horrocks, Volz, Decker (bib044) 2003 Hendler, McGuinness (bib048) 2000; 15 T. Eiter, G. Ianni, R. Schindlauer, H. Tompits, Towards efficient evaluation of HEX programs, in: Proceedings NMR-2006, 2006, pp. 40–46 Berners-Lee (bib009) 1999 Eiter, Ianni, Polleres, Schindlauer, Tompits (bib027) 2006; vol. 4126 Gottlob (bib043) 1992; 2 de Bruijn, Pearce, Polleres, Valverde (bib020) 2006 Łukaszewicz (bib074) 1990 Cadoli, Lenzerini (bib014) 1994; 48 Gelfond, Lifschitz (bib039) 1991; 9 Fensel, van Harmelen, Horrocks, McGuinness, Patel-Schneider (bib035) 2001; 16 Ortiz de la Fuente, Calvanese, Eiter, Franconi (bib082) 2006 Motik, Rosati (bib076) 2007 Lifschitz (bib068) 1991 Calvanese, De Giacomo, Lembo, Lenzerini, Rosati (bib015) 2006 Berners-Lee, Hendler, Lassila (bib010) 2001; 284 Horrocks (bib053) 2002; vol. 2287 Hustadt, Motik, Sattler (bib061) 2004 Reiter (bib089) 1980; 13 Horty (bib060) 1994 Lukasiewicz (bib072) 2007; vol. 4519 Rosati (bib094) 2006 Dantsin, Eiter, Gottlob, Voronkov (bib017) 2001; 33 Baral (bib007) 2002 Calvanese, Lenzerini, Nardi (bib016) 2003 S. Woltran, Answer set programming: Model applications and proofs-of-concept, Technical Report WP5, Working Group on Answer Set Programming (WASP, IST-FET-2001-37004), July 2005. Available at Eiter, Lukasiewicz, Schindlauer, Tompits (bib033) 2004; vol. 3323 Leone, Pfeifer, Faber, Eiter, Gottlob, Perri, Scarcello (bib065) 2006; 7 G. Antoniou, C.V. Damásio, B. Grosof, I. Horrocks, M. Kifer, J. Maluszynski, P.F. Patel-Schneider, Combining rules and ontologies: A survey, Technical Report IST506779/Linköping/I3-D3/D/PU/a1, Linköping University, February 2005 T. Eiter, G. Ianni, T. Krennwallner, R. Schindlauer, Exploiting conjunctive queries in description logic programs, in: D. Calvanese, et al. (Eds.), Proceedings of the 20th International Workshop on Description Logics (DL-2007), CEUR Workshop Proceedings, vol. 250, CEUR-WS. org, 2007, pp. 259–266 H. Boley, S. Tabet, G. Wagner, Design rationale of RuleML: A markup language for semantic web rules, in: I.F. Cruz, S. Decker, J. Euzenat, D.L. McGuinness (Eds.), Proceedings First Semantic Web Working Symposium (SWWS-2001), Stanford University, 2001, pp. 381–401 Fitting (bib037) 1996 Donini, Lenzerini, Nardi, Schaerf (bib021) 1998; 10 van Gelder, Ross, Schlipf (bib100) 1991; 38 Horrocks (bib052) 2002; 25 Horrocks, Patel-Schneider (bib054) 2003; vol. 2870 Jenner, Toran (bib062) 1995; 141 de Bruijn, Eiter, Polleres, Tompits (bib018) 2006; vol. 4092 Eiter, Gottlob (bib024) 1995; 15 Horrocks, Sattler, Tobies (bib059) 1999; vol. 1705 S. Tobies, Complexity results and practical algorithms for logics in knowledge representation, PhD thesis, RWTH Aachen, Germany, 2001 S. Heymans, D. Vermeir, Integrating semantic web reasoning and answer set programming, in: M. de Vos, A. Provetti, (Eds.), Proceedings ASP-2003—Answer Set Programming: Advances in Theory and Implementation, CEUR Workshop Proceedings, vol. 78, CEUR-WS. org, 2003, pp. 194–208 Eiter, Faber, Leone, Pfeifer (bib023) 2000 Faber, Leone, Pfeifer (bib034) 2004; vol. 3229 Gelfond, Przymusinska, Przymusinski (bib040) 1986 Sintek, Decker (bib096) 2002; vol. 2342 Rosati (bib091) 2005; 3 Heflin, Munoz-Avila (bib046) 1998 Baader, Hollunder (bib006) 1995; 14 B. Motik, R. Rosati, A faithful integration of description logics with logic programming, in: Proceedings IJCAI-2007, pp. 477–482 J.Z. Pan, E. Franconi, S. Tessaris, G. Stamou, V. Tzouvaras, L. Serafini, I. Horrocks, B. Glimm, Specification of coordination of rule and ontology languages. Project Deliverable D2.5.1, KnowledgeWeb NoE, June 2004 Haarslev, Möller (bib045) 2001; vol. 2083 Heymans, Vermeir (bib050) 2003 Rosati (bib093) 2006; vol. 4126 Wang, Billington, Blee, Antoniou (bib104) 2004; vol. 3323 Gelfond, Lifschitz (bib038) 1988 Heymans, Nieuwenborgh, Vermeir (bib049) 2005; vol. 3532 Lifschitz (bib067) 1985 R. Rosati, Towards expressive KR systems integrating datalog and description logics: Preliminary report, in: Proceedings DL-1999, 1999, pp. 160–164 Johnson (bib063) 1990 T. Eiter, G. Ianni, R. Schindlauer, H. Tompits, NLP-DL: A KR system for coupling nonmonotonic logic programs with description logics, in: 4th International Semantic Web Conference (ISWC-2005), 2005. System poster Hemachandra (bib047) 1989; 39 Van Belleghem (10.1016/j.artint.2008.04.002_bib099) 1997 Eiter (10.1016/j.artint.2008.04.002_bib030) 2005 Motik (10.1016/j.artint.2008.04.002_bib075) 2006; vol. 4273 Berners-Lee (10.1016/j.artint.2008.04.002_bib009) 1999 Börger (10.1016/j.artint.2008.04.002_bib013) 2001 Rosati (10.1016/j.artint.2008.04.002_bib091) 2005; 3 Eiter (10.1016/j.artint.2008.04.002_bib023) 2000 Hemachandra (10.1016/j.artint.2008.04.002_bib047) 1989; 39 de Bruijn (10.1016/j.artint.2008.04.002_bib020) 2006 Eiter (10.1016/j.artint.2008.04.002_bib024) 1995; 15 Faber (10.1016/j.artint.2008.04.002_bib034) 2004; vol. 3229 Baader (10.1016/j.artint.2008.04.002_bib006) 1995; 14 Grosof (10.1016/j.artint.2008.04.002_bib044) 2003 Horrocks (10.1016/j.artint.2008.04.002_bib059) 1999; vol. 1705 Donini (10.1016/j.artint.2008.04.002_bib021) 1998; 10 Papadimitriou (10.1016/j.artint.2008.04.002_bib084) 1994 Lifschitz (10.1016/j.artint.2008.04.002_bib067) 1985 Calvanese (10.1016/j.artint.2008.04.002_bib015) 2006 Angele (10.1016/j.artint.2008.04.002_bib003) Heymans (10.1016/j.artint.2008.04.002_bib049) 2005; vol. 3532 Rosati (10.1016/j.artint.2008.04.002_bib092) 2005; vol. 3703 10.1016/j.artint.2008.04.002_bib032 Motik (10.1016/j.artint.2008.04.002_bib076) 2007 Eiter (10.1016/j.artint.2008.04.002_bib033) 2004; vol. 3323 Polleres (10.1016/j.artint.2008.04.002_bib085) 2006; vol. 4011 Heymans (10.1016/j.artint.2008.04.002_bib050) 2003 Antoniou (10.1016/j.artint.2008.04.002_bib004) 2002; vol. 2342 Eiter (10.1016/j.artint.2008.04.002_bib029) 2005; vol. 3452 (10.1016/j.artint.2008.04.002_bib036) 2002 Haarslev (10.1016/j.artint.2008.04.002_bib045) 2001; vol. 2083 Horrocks (10.1016/j.artint.2008.04.002_bib054) 2003; vol. 2870 Horrocks (10.1016/j.artint.2008.04.002_bib053) 2002; vol. 2287 10.1016/j.artint.2008.04.002_bib026 10.1016/j.artint.2008.04.002_bib028 Gelfond (10.1016/j.artint.2008.04.002_bib040) 1986 Lukasiewicz (10.1016/j.artint.2008.04.002_bib071) 2006 Reiter (10.1016/j.artint.2008.04.002_bib088) 1978 Horrocks (10.1016/j.artint.2008.04.002_bib057) Gelfond (10.1016/j.artint.2008.04.002_bib039) 1991; 9 Heflin (10.1016/j.artint.2008.04.002_bib046) 1998 Ortiz de la Fuente (10.1016/j.artint.2008.04.002_bib082) 2006 10.1016/j.artint.2008.04.002_bib095 de Bruijn (10.1016/j.artint.2008.04.002_bib018) 2006; vol. 4092 10.1016/j.artint.2008.04.002_bib098 10.1016/j.artint.2008.04.002_bib011 Rosati (10.1016/j.artint.2008.04.002_bib093) 2006; vol. 4126 Eiter (10.1016/j.artint.2008.04.002_bib031) 2006; vol. 4011 Motik (10.1016/j.artint.2008.04.002_bib078) 2006 Lukasiewicz (10.1016/j.artint.2008.04.002_bib073) 2007; vol. 4772 10.1016/j.artint.2008.04.002_bib090 Levy (10.1016/j.artint.2008.04.002_bib066) 1998; 104 Calvanese (10.1016/j.artint.2008.04.002_bib016) 2003 Hendler (10.1016/j.artint.2008.04.002_bib048) 2000; 15 Wang (10.1016/j.artint.2008.04.002_bib104) 2004; vol. 3323 10.1016/j.artint.2008.04.002_bib005 Baral (10.1016/j.artint.2008.04.002_bib007) 2002 van Gelder (10.1016/j.artint.2008.04.002_bib100) 1991; 38 10.1016/j.artint.2008.04.002_bib083 Gelfond (10.1016/j.artint.2008.04.002_bib038) 1988 Wang (10.1016/j.artint.2008.04.002_bib103) 2005; vol. 3791 10.1016/j.artint.2008.04.002_bib001 Fitting (10.1016/j.artint.2008.04.002_bib037) 1996 Donini (10.1016/j.artint.2008.04.002_bib022) 2002; 3 Horty (10.1016/j.artint.2008.04.002_bib060) 1994 10.1016/j.artint.2008.04.002_bib081 Lukasiewicz (10.1016/j.artint.2008.04.002_bib070) 2005; vol. 3571 Fensel (10.1016/j.artint.2008.04.002_bib035) 2001; 16 Lenzerini (10.1016/j.artint.2008.04.002_bib064) 2002 Leone (10.1016/j.artint.2008.04.002_bib065) 2006; 7 Dantsin (10.1016/j.artint.2008.04.002_bib017) 2001; 33 Łukaszewicz (10.1016/j.artint.2008.04.002_bib074) 1990 Cadoli (10.1016/j.artint.2008.04.002_bib014) 1994; 48 Gelfond (10.1016/j.artint.2008.04.002_bib041) 1989; 38 Motik (10.1016/j.artint.2008.04.002_bib079) 2004; vol. 3298 Horrocks (10.1016/j.artint.2008.04.002_bib052) 2002; 25 Sintek (10.1016/j.artint.2008.04.002_bib096) 2002; vol. 2342 10.1016/j.artint.2008.04.002_bib077 Lifschitz (10.1016/j.artint.2008.04.002_bib069) 1994 Gottlob (10.1016/j.artint.2008.04.002_bib043) 1992; 2 Horrocks (10.1016/j.artint.2008.04.002_bib058) 2003; 1 de Bruijn (10.1016/j.artint.2008.04.002_bib019) 2007 Berardi (10.1016/j.artint.2008.04.002_bib008) 2005; 168 Analyti (10.1016/j.artint.2008.04.002_bib002) 2005; vol. 3729 Horrocks (10.1016/j.artint.2008.04.002_bib055) 2004 10.1016/j.artint.2008.04.002_bib105 Berners-Lee (10.1016/j.artint.2008.04.002_bib010) 2001; 284 10.1016/j.artint.2008.04.002_bib106 Hustadt (10.1016/j.artint.2008.04.002_bib061) 2004 Horrocks (10.1016/j.artint.2008.04.002_bib056) 2005; 3 Johnson (10.1016/j.artint.2008.04.002_bib063) 1990 Poole (10.1016/j.artint.2008.04.002_bib086) 1988; 36 Glimm (10.1016/j.artint.2008.04.002_bib042) 2007 Lukasiewicz (10.1016/j.artint.2008.04.002_bib072) 2007; vol. 4519 Motik (10.1016/j.artint.2008.04.002_bib080) 2005; 3 Eiter (10.1016/j.artint.2008.04.002_bib025) 1997; vol. 1265 Eiter (10.1016/j.artint.2008.04.002_bib027) 2006; vol. 4126 Lifschitz (10.1016/j.artint.2008.04.002_bib068) 1991 Rosati (10.1016/j.artint.2008.04.002_bib094) 2006 Swift (10.1016/j.artint.2008.04.002_bib097) 2004; vol. 2923 Bonatti (10.1016/j.artint.2008.04.002_bib012) 2006 Jenner (10.1016/j.artint.2008.04.002_bib062) 1995; 141 Pratt-Hartmann (10.1016/j.artint.2008.04.002_bib087) 2005; 14 Reiter (10.1016/j.artint.2008.04.002_bib089) 1980; 13 10.1016/j.artint.2008.04.002_bib051 |
| References_xml | – volume: 48 start-page: 255 year: 1994 end-page: 310 ident: bib014 article-title: The complexity of propositional closed world reasoning and circumscription publication-title: J. Comput. Syst. Sci. – volume: vol. 4092 start-page: 1 year: 2006 end-page: 22 ident: bib018 article-title: On representational issues about combinations of classical theories with nonmonotonic rules publication-title: Proceedings KSEM-2006 – start-page: 304 year: 2007 end-page: 309 ident: bib019 article-title: Embedding non-ground logic programs into autoepistemic logic for knowledge base combination publication-title: Proceedings IJCAI-2007 – reference: S. Tobies, Complexity results and practical algorithms for logics in knowledge representation, PhD thesis, RWTH Aachen, Germany, 2001 – start-page: 477 year: 2007 end-page: 482 ident: bib076 article-title: A faithful integration of description logics with logic programming publication-title: Proceedings IJCAI-2007 – reference: F. Yang, X. Chen, Z. Wang, p-dl-programs: Combining dl-programs with preference for Semantic Web. Unpublished manuscript, Aug. 2006 – volume: vol. 3703 start-page: 50 year: 2005 end-page: 64 ident: bib092 article-title: Semantic and computational advantages of the safe integration of ontologies and rules publication-title: Proceedings PPSWR-2005 – start-page: 723 year: 2004 end-page: 731 ident: bib055 article-title: A proposal for an OWL rules language publication-title: Proceedings WWW-2004 – volume: vol. 3323 start-page: 170 year: 2004 end-page: 181 ident: bib104 article-title: Combining description logic and defeasible logic for the Semantic Web publication-title: Proceedings RuleML-2004 – reference: T. Eiter, G. Ianni, R. Schindlauer, H. Tompits, Towards efficient evaluation of HEX programs, in: Proceedings NMR-2006, 2006, pp. 40–46 – reference: G. Alsaç, C. Baral, Reasoning in description logics using declarative logic programming, Technical report, Department of Computer Science and Engineering, Arizona State University, 2001 – volume: vol. 4519 start-page: 384 year: 2007 end-page: 398 ident: bib072 article-title: A novel combination of answer set programming with description logics for the Semantic Web publication-title: Proceedings ESWC-2007 – start-page: 346 year: 1997 end-page: 360 ident: bib099 article-title: A strong correspondence between description logics and open logic programming publication-title: Proceedings ICLP-1997 – volume: 3 start-page: 177 year: 2002 end-page: 225 ident: bib022 article-title: Description logics of minimal knowledge and negation as failure publication-title: ACM Trans. Comput. Log. – start-page: 79 year: 2000 end-page: 103 ident: bib023 article-title: Declarative problem-solving using the DLV system publication-title: Logic-Based Artificial Intelligence – volume: vol. 4126 start-page: 93 year: 2006 end-page: 127 ident: bib027 article-title: Reasoning with rules and ontologies publication-title: Reasoning Web, Second International Summer School 2006, Tutorial Lectures – volume: 39 start-page: 299 year: 1989 end-page: 322 ident: bib047 article-title: The strong exponential hierarchy collapses publication-title: J. Comput. Syst. Sci. – volume: 7 start-page: 499 year: 2006 end-page: 562 ident: bib065 article-title: The DLV system for knowledge representation and reasoning publication-title: ACM Trans. Comput. Log. – volume: 14 start-page: 149 year: 1995 end-page: 180 ident: bib006 article-title: Embedding defaults into terminological knowledge representation formalisms publication-title: J. Autom. Reasoning – year: 1990 ident: bib074 article-title: Non-Monotonic Reasoning: Formalizations of Commonsense Reasoning – year: 1994 ident: bib084 article-title: Computational Complexity – volume: 1 start-page: 7 year: 2003 end-page: 26 ident: bib058 article-title: From publication-title: J. Web Sem. – volume: 14 start-page: 369 year: 2005 end-page: 395 ident: bib087 article-title: Complexity of the two-variable fragment with counting quantifiers publication-title: J. Logic Language Inform. – start-page: 152 year: 2004 end-page: 162 ident: bib061 article-title: Reducing SHIQ-description logic to disjunctive datalog programs publication-title: Proceedings KR-2004 – volume: vol. 3229 start-page: 200 year: 2004 end-page: 212 ident: bib034 article-title: Recursive aggregates in disjunctive logic programs: Semantics and complexity publication-title: Proceedings JELIA-2004 – volume: vol. 3532 start-page: 392 year: 2005 end-page: 407 ident: bib049 article-title: Non-monotonic ontological and rule-based reasoning with extended conceptual logic programs publication-title: Proceedings ESWC-2005 – year: 2006 ident: bib078 article-title: A comparison of reasoning techniques for querying large description logic ABoxes publication-title: Proceedings LPAR-2006 – start-page: 67 year: 1990 end-page: 161 ident: bib063 article-title: A catalog of complexity classes publication-title: Handbook of Theoretical Computer Science, vol. A – start-page: 55 year: 1978 end-page: 76 ident: bib088 article-title: On closed world data bases publication-title: Logic and Data Bases – volume: vol. 2287 start-page: 2 year: 2002 end-page: 13 ident: bib053 article-title: DAML publication-title: Proceedings EDBT-2002 – year: 2002 ident: bib007 article-title: Knowledge Representation, Reasoning, and Declarative Problem Solving – start-page: 400 year: 2006 end-page: 410 ident: bib012 article-title: Description logics with circumscription publication-title: Proceedings KR-2006 – volume: 33 start-page: 374 year: 2001 end-page: 425 ident: bib017 article-title: Complexity and expressive power of logic programming publication-title: ACM Comput. Surv. – ident: bib057 article-title: SWRL: A Semantic Web rule language combining OWL and RuleML – ident: bib102 – volume: 3 start-page: 23 year: 2005 end-page: 40 ident: bib056 article-title: OWL rules: A proposal and prototype implementation publication-title: J. Web Sem. – reference: S. Heymans, D. Vermeir, Integrating semantic web reasoning and answer set programming, in: M. de Vos, A. Provetti, (Eds.), Proceedings ASP-2003—Answer Set Programming: Advances in Theory and Implementation, CEUR Workshop Proceedings, vol. 78, CEUR-WS. org, 2003, pp. 194–208 – year: 1996 ident: bib037 article-title: First-Order Logic and Automated Theorem Proving – volume: 15 start-page: 67 year: 2000 end-page: 73 ident: bib048 article-title: The DARPA agent markup language publication-title: IEEE Intelligent Syst. – volume: 3 start-page: 61 year: 2005 end-page: 73 ident: bib091 article-title: On the decidability and complexity of integrating ontologies and rules publication-title: J. Web Sem. – volume: vol. 2083 start-page: 701 year: 2001 end-page: 705 ident: bib045 article-title: RACER system description publication-title: Proceedings IJCAR-2001 – start-page: 48 year: 2003 end-page: 57 ident: bib044 article-title: Description logic programs: Combining logic programs with description logics publication-title: Proceedings WWW-2003 – volume: vol. 4126 start-page: 128 year: 2006 end-page: 151 ident: bib093 article-title: Integrating ontologies and rules: Semantic and computational issues publication-title: Reasoning Web – year: 2001 ident: bib013 article-title: The Classical Decision Problem – volume: vol. 1265 start-page: 290 year: 1997 end-page: 309 ident: bib025 article-title: Modular logic programming and generalized quantifiers publication-title: Proceedings LPNMR-1997 – volume: 168 start-page: 70 year: 2005 end-page: 118 ident: bib008 article-title: Reasoning on UML class diagrams publication-title: Artificial Intelligence – start-page: 90 year: 2005 end-page: 96 ident: bib030 article-title: A uniform integration of higher-order reasoning and external evaluations in answer-set programming publication-title: Proceedings IJCAI-2005 – volume: vol. 3791 start-page: 160 year: 2005 end-page: 171 ident: bib103 article-title: Merging and aligning ontologies in dl-programs publication-title: Proceedings RuleML-2005 – start-page: 63 year: 1998 end-page: 70 ident: bib046 article-title: LCW-based agent planning for the Semantic Web publication-title: Ontologies and the Semantic Web. Papers from the 2002 AAAI Workshop WS-02-11 – start-page: 233 year: 2002 end-page: 246 ident: bib064 article-title: Data integration: A theoretical perspective publication-title: Proceedings PODS-2002 – volume: vol. 2923 start-page: 275 year: 2004 end-page: 288 ident: bib097 article-title: Deduction in ontologies via ASP publication-title: Proceedings LPNMR-2004 – reference: R. Rosati, Towards expressive KR systems integrating datalog and description logics: Preliminary report, in: Proceedings DL-1999, 1999, pp. 160–164 – volume: vol. 4011 start-page: 332 year: 2006 end-page: 347 ident: bib085 article-title: Rules with contextually scoped negation publication-title: Proceedings ESWC-2006 – start-page: 260 year: 2006 end-page: 270 ident: bib015 article-title: Data complexity of query answering in description logics publication-title: Proceedings KR-2006 – volume: vol. 3323 start-page: 81 year: 2004 end-page: 97 ident: bib033 article-title: Well-founded semantics for description logic programs in the Semantic Web publication-title: Proceedings RuleML-2004 – start-page: 121 year: 1985 end-page: 127 ident: bib067 article-title: Computing circumscription publication-title: Proceedings IJCAI-1985 – volume: 13 start-page: 81 year: 1980 end-page: 132 ident: bib089 article-title: A logic for default reasoning publication-title: Artificial Intelligence – year: 1999 ident: bib009 article-title: Weaving the Web – volume: 25 start-page: 4 year: 2002 end-page: 9 ident: bib052 article-title: DAML publication-title: IEEE Bull. Technical Committee Data Engrg. – start-page: 23 year: 1994 end-page: 38 ident: bib069 article-title: Splitting a logic program publication-title: Proceedings ICLP-1994 – volume: 36 start-page: 27 year: 1988 end-page: 47 ident: bib086 article-title: A logical framework for default reasoning publication-title: Artificial Intelligence – reference: S. Woltran, Answer set programming: Model applications and proofs-of-concept, Technical Report WP5, Working Group on Answer Set Programming (WASP, IST-FET-2001-37004), July 2005. Available at – volume: vol. 3729 start-page: 21 year: 2005 end-page: 36 ident: bib002 article-title: Stable model theory for extended RDF ontologies publication-title: Proceedings ISWC-2005 – volume: vol. 3571 start-page: 737 year: 2005 end-page: 749 ident: bib070 article-title: Probabilistic description logic programs publication-title: Proceedings ECSQARU-2005 – year: 2002 ident: bib036 publication-title: Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential – volume: vol. 2342 start-page: 364 year: 2002 end-page: 378 ident: bib096 article-title: TRIPLE—A query, inference, and transformation language for the Semantic Web publication-title: Proceedings ISWC-2002 – volume: 38 start-page: 620 year: 1991 end-page: 650 ident: bib100 article-title: The well-founded semantics for general logic programs publication-title: Journal of the ACM – year: 2006 ident: bib020 article-title: A logic for hybrid rules publication-title: Proceedings RuleML-2006 – volume: 3 start-page: 41 year: 2005 end-page: 60 ident: bib080 article-title: Query answering for OWL-DL with rules publication-title: J. Web Sem. – start-page: 68 year: 2006 end-page: 78 ident: bib094 publication-title: Proceedings KR-2006 – start-page: 133 year: 1986 end-page: 139 ident: bib040 article-title: The extended closed world assumption and its relationship to parallel circumscription publication-title: Proceedings PODS-1986 – reference: B. Motik, R. Rosati, A faithful integration of description logics with logic programming, in: Proceedings IJCAI-2007, pp. 477–482 – volume: vol. 3298 start-page: 549 year: 2004 end-page: 563 ident: bib079 article-title: Query answering for OWL-DL with rules publication-title: Proceedings ISWC-2004 – volume: vol. 1705 start-page: 161 year: 1999 end-page: 180 ident: bib059 article-title: Practical reasoning for expressive description logics publication-title: Proceedings LPAR-1999 – volume: 38 start-page: 75 year: 1989 end-page: 94 ident: bib041 article-title: On the relationship between circumscription and negation as failure publication-title: Artificial Intelligence – volume: vol. 2342 start-page: 394 year: 2002 end-page: 398 ident: bib004 article-title: Non-monotonic rule systems on top of ontology layers publication-title: Proceedings ISWC-2002 – reference: H. Boley, S. Tabet, G. Wagner, Design rationale of RuleML: A markup language for semantic web rules, in: I.F. Cruz, S. Decker, J. Euzenat, D.L. McGuinness (Eds.), Proceedings First Semantic Web Working Symposium (SWWS-2001), Stanford University, 2001, pp. 381–401 – volume: 82 start-page: 89 year: 2006 end-page: 96 ident: bib071 article-title: Fuzzy description logic programs under the answer set semantics for the Semantic Web publication-title: Proceedings RuleML-2006 – volume: 141 start-page: 175 year: 1995 end-page: 193 ident: bib062 article-title: Computing functions with parallel queries to NP publication-title: Theor. Comput. Sci. – start-page: 229 year: 2003 end-page: 263 ident: bib016 article-title: Description logics for conceptual data modeling publication-title: Logics for Emerging Applications of Databases – reference: G. Antoniou, C.V. Damásio, B. Grosof, I. Horrocks, M. Kifer, J. Maluszynski, P.F. Patel-Schneider, Combining rules and ontologies: A survey, Technical Report IST506779/Linköping/I3-D3/D/PU/a1, Linköping University, February 2005 – start-page: 381 year: 1991 end-page: 386 ident: bib068 article-title: Non-monotonic databases and epistemic queries publication-title: Proceedings IJCAI-91 – reference: J.Z. Pan, E. Franconi, S. Tessaris, G. Stamou, V. Tzouvaras, L. Serafini, I. Horrocks, B. Glimm, Specification of coordination of rule and ontology languages. Project Deliverable D2.5.1, KnowledgeWeb NoE, June 2004 – volume: 9 start-page: 365 year: 1991 end-page: 385 ident: bib039 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Gen. Comput. – volume: vol. 4273 start-page: 501 year: 2006 end-page: 514 ident: bib075 article-title: Can OWL and logic programming live together happily ever after? publication-title: Proceedings ISWC-2006 – volume: vol. 4772 start-page: 143 year: 2007 end-page: 156 ident: bib073 article-title: Tractable probabilistic description logic programs publication-title: Proceedings SUM-2007 – start-page: 584 year: 2003 end-page: 588 ident: bib050 article-title: Integrating ontology languages and answer set programming publication-title: Proceedings DEXA Workshops 2003 – volume: vol. 4011 start-page: 273 year: 2006 end-page: 287 ident: bib031 article-title: Effective integration of declarative rules with external evaluations for Semantic Web reasoning publication-title: Proceedings ESWC-2006 – reference: I. Niemelä, P. Simons, T. Syrjänen, Smodels: A system for answer set programming, in: Proceedings NMR-2000, 2000 – volume: 2 start-page: 397 year: 1992 end-page: 425 ident: bib043 article-title: Complexity results for nonmonotonic logics publication-title: J. Logic Comput. – start-page: 1070 year: 1988 end-page: 1080 ident: bib038 article-title: The stable model semantics for logic programming publication-title: Proceedings ICLP/SLP-1988 – start-page: 111 year: 1994 end-page: 187 ident: bib060 article-title: Some direct theories of nonmonotonic inheritance publication-title: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. III: Non-monotonic Reasoning and Uncertain Reasoning – volume: vol. 2870 start-page: 17 year: 2003 end-page: 29 ident: bib054 article-title: Reducing OWL entailment to description logic satisfiability publication-title: Proceedings ISWC-2003 – volume: 104 start-page: 165 year: 1998 end-page: 209 ident: bib066 article-title: Combining Horn rules and description logics in CARIN publication-title: Artificial Intelligence – reference: T. Eiter, G. Ianni, R. Schindlauer, H. Tompits, NLP-DL: A KR system for coupling nonmonotonic logic programs with description logics, in: 4th International Semantic Web Conference (ISWC-2005), 2005. System poster – volume: 15 start-page: 289 year: 1995 end-page: 323 ident: bib024 article-title: On the computational cost of disjunctive logic programming: Propositional case publication-title: Ann. Math. Artif. Intell. – volume: 284 start-page: 34 year: 2001 end-page: 43 ident: bib010 article-title: The Semantic Web publication-title: Scientific American – ident: bib003 – start-page: 399 year: 2007 end-page: 404 ident: bib042 article-title: Conjunctive query answering for the description logic publication-title: Proceedings IJCAI-2007 – reference: T. Eiter, G. Ianni, T. Krennwallner, R. Schindlauer, Exploiting conjunctive queries in description logic programs, in: D. Calvanese, et al. (Eds.), Proceedings of the 20th International Workshop on Description Logics (DL-2007), CEUR Workshop Proceedings, vol. 250, CEUR-WS. org, 2007, pp. 259–266 – volume: vol. 3452 start-page: 511 year: 2005 end-page: 517 ident: bib029 article-title: Non-monotonic description logic programs: Implementation and experiments publication-title: Proceedings LPAR-2004 – volume: 10 start-page: 227 year: 1998 end-page: 252 ident: bib021 publication-title: J. Intell. Inf. Syst. – reference: R. Schindlauer, Answer-set programming for the Semantic Web, PhD thesis, Vienna University of Technology, Austria, 2006. Available at – year: 2006 ident: bib082 article-title: Characterizing data complexity for conjunctive query answering in expressive description logics publication-title: Proceedings AAAI-2006 – ident: bib101 – volume: 16 start-page: 38 year: 2001 end-page: 45 ident: bib035 article-title: OIL: An ontology infrastructure for the Semantic Web publication-title: IEEE Intelligent Syst. – volume: vol. 2342 start-page: 394 year: 2002 ident: 10.1016/j.artint.2008.04.002_bib004 article-title: Non-monotonic rule systems on top of ontology layers – volume: 14 start-page: 149 issue: 1 year: 1995 ident: 10.1016/j.artint.2008.04.002_bib006 article-title: Embedding defaults into terminological knowledge representation formalisms publication-title: J. Autom. Reasoning doi: 10.1007/BF00883932 – volume: 3 start-page: 61 issue: 1 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib091 article-title: On the decidability and complexity of integrating ontologies and rules publication-title: J. Web Sem. doi: 10.1016/j.websem.2005.05.002 – volume: 14 start-page: 369 issue: 3 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib087 article-title: Complexity of the two-variable fragment with counting quantifiers publication-title: J. Logic Language Inform. doi: 10.1007/s10849-005-5791-1 – volume: 7 start-page: 499 issue: 3 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib065 article-title: The DLV system for knowledge representation and reasoning publication-title: ACM Trans. Comput. Log. doi: 10.1145/1149114.1149117 – year: 1999 ident: 10.1016/j.artint.2008.04.002_bib009 – volume: 15 start-page: 289 issue: 3/4 year: 1995 ident: 10.1016/j.artint.2008.04.002_bib024 article-title: On the computational cost of disjunctive logic programming: Propositional case publication-title: Ann. Math. Artif. Intell. doi: 10.1007/BF01536399 – volume: vol. 3323 start-page: 81 year: 2004 ident: 10.1016/j.artint.2008.04.002_bib033 article-title: Well-founded semantics for description logic programs in the Semantic Web – volume: vol. 3571 start-page: 737 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib070 article-title: Probabilistic description logic programs – volume: vol. 2923 start-page: 275 year: 2004 ident: 10.1016/j.artint.2008.04.002_bib097 article-title: Deduction in ontologies via ASP – start-page: 23 year: 1994 ident: 10.1016/j.artint.2008.04.002_bib069 article-title: Splitting a logic program – volume: 141 start-page: 175 year: 1995 ident: 10.1016/j.artint.2008.04.002_bib062 article-title: Computing functions with parallel queries to NP publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(94)00080-3 – start-page: 68 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib094 article-title: DL+log: Tight integration of description logics and disjunctive datalog – year: 2006 ident: 10.1016/j.artint.2008.04.002_bib020 article-title: A logic for hybrid rules – ident: 10.1016/j.artint.2008.04.002_bib051 – volume: vol. 4519 start-page: 384 year: 2007 ident: 10.1016/j.artint.2008.04.002_bib072 article-title: A novel combination of answer set programming with description logics for the Semantic Web – start-page: 55 year: 1978 ident: 10.1016/j.artint.2008.04.002_bib088 article-title: On closed world data bases – volume: 36 start-page: 27 issue: 1 year: 1988 ident: 10.1016/j.artint.2008.04.002_bib086 article-title: A logical framework for default reasoning publication-title: Artificial Intelligence doi: 10.1016/0004-3702(88)90077-X – volume: 9 start-page: 365 year: 1991 ident: 10.1016/j.artint.2008.04.002_bib039 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Gen. Comput. doi: 10.1007/BF03037169 – start-page: 381 year: 1991 ident: 10.1016/j.artint.2008.04.002_bib068 article-title: Non-monotonic databases and epistemic queries – volume: vol. 1265 start-page: 290 year: 1997 ident: 10.1016/j.artint.2008.04.002_bib025 article-title: Modular logic programming and generalized quantifiers – ident: 10.1016/j.artint.2008.04.002_bib083 – volume: 1 start-page: 7 issue: 1 year: 2003 ident: 10.1016/j.artint.2008.04.002_bib058 article-title: From SHIQ and RDF to OWL: The making of a Web ontology language publication-title: J. Web Sem. doi: 10.1016/j.websem.2003.07.001 – volume: vol. 4273 start-page: 501 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib075 article-title: Can OWL and logic programming live together happily ever after? – volume: 168 start-page: 70 issue: 1–2 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib008 article-title: Reasoning on UML class diagrams publication-title: Artificial Intelligence doi: 10.1016/j.artint.2005.05.003 – year: 1996 ident: 10.1016/j.artint.2008.04.002_bib037 – volume: vol. 3298 start-page: 549 year: 2004 ident: 10.1016/j.artint.2008.04.002_bib079 article-title: Query answering for OWL-DL with rules – year: 2001 ident: 10.1016/j.artint.2008.04.002_bib013 – volume: vol. 2287 start-page: 2 year: 2002 ident: 10.1016/j.artint.2008.04.002_bib053 article-title: DAML+OIL: A reason-able Web ontology language – ident: 10.1016/j.artint.2008.04.002_bib105 – start-page: 111 year: 1994 ident: 10.1016/j.artint.2008.04.002_bib060 article-title: Some direct theories of nonmonotonic inheritance – volume: 3 start-page: 23 issue: 1 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib056 article-title: OWL rules: A proposal and prototype implementation publication-title: J. Web Sem. doi: 10.1016/j.websem.2005.05.003 – volume: 15 start-page: 67 issue: 6 year: 2000 ident: 10.1016/j.artint.2008.04.002_bib048 article-title: The DARPA agent markup language publication-title: IEEE Intelligent Syst. – start-page: 229 year: 2003 ident: 10.1016/j.artint.2008.04.002_bib016 article-title: Description logics for conceptual data modeling – year: 2002 ident: 10.1016/j.artint.2008.04.002_bib036 – ident: 10.1016/j.artint.2008.04.002_bib077 – volume: vol. 3532 start-page: 392 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib049 article-title: Non-monotonic ontological and rule-based reasoning with extended conceptual logic programs – ident: 10.1016/j.artint.2008.04.002_bib001 – volume: vol. 1705 start-page: 161 year: 1999 ident: 10.1016/j.artint.2008.04.002_bib059 article-title: Practical reasoning for expressive description logics – volume: 2 start-page: 397 issue: 3 year: 1992 ident: 10.1016/j.artint.2008.04.002_bib043 article-title: Complexity results for nonmonotonic logics publication-title: J. Logic Comput. doi: 10.1093/logcom/2.3.397 – ident: 10.1016/j.artint.2008.04.002_bib026 – volume: vol. 4092 start-page: 1 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib018 article-title: On representational issues about combinations of classical theories with nonmonotonic rules – start-page: 133 year: 1986 ident: 10.1016/j.artint.2008.04.002_bib040 article-title: The extended closed world assumption and its relationship to parallel circumscription – volume: 38 start-page: 620 issue: 3 year: 1991 ident: 10.1016/j.artint.2008.04.002_bib100 article-title: The well-founded semantics for general logic programs publication-title: Journal of the ACM doi: 10.1145/116825.116838 – ident: 10.1016/j.artint.2008.04.002_bib032 – year: 2006 ident: 10.1016/j.artint.2008.04.002_bib082 article-title: Characterizing data complexity for conjunctive query answering in expressive description logics – volume: 10 start-page: 227 issue: 3 year: 1998 ident: 10.1016/j.artint.2008.04.002_bib021 article-title: AL-log: Integrating datalog and description logics publication-title: J. Intell. Inf. Syst. doi: 10.1023/A:1008687430626 – start-page: 152 year: 2004 ident: 10.1016/j.artint.2008.04.002_bib061 article-title: Reducing SHIQ-description logic to disjunctive datalog programs – start-page: 67 year: 1990 ident: 10.1016/j.artint.2008.04.002_bib063 article-title: A catalog of complexity classes – start-page: 584 year: 2003 ident: 10.1016/j.artint.2008.04.002_bib050 article-title: Integrating ontology languages and answer set programming – volume: vol. 3729 start-page: 21 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib002 article-title: Stable model theory for extended RDF ontologies – ident: 10.1016/j.artint.2008.04.002_bib098 – start-page: 399 year: 2007 ident: 10.1016/j.artint.2008.04.002_bib042 article-title: Conjunctive query answering for the description logic SHIQ – volume: vol. 3229 start-page: 200 year: 2004 ident: 10.1016/j.artint.2008.04.002_bib034 article-title: Recursive aggregates in disjunctive logic programs: Semantics and complexity – year: 1994 ident: 10.1016/j.artint.2008.04.002_bib084 – year: 1990 ident: 10.1016/j.artint.2008.04.002_bib074 – volume: 284 start-page: 34 issue: 5 year: 2001 ident: 10.1016/j.artint.2008.04.002_bib010 article-title: The Semantic Web publication-title: Scientific American doi: 10.1038/scientificamerican0501-34 – start-page: 1070 year: 1988 ident: 10.1016/j.artint.2008.04.002_bib038 article-title: The stable model semantics for logic programming – start-page: 63 year: 1998 ident: 10.1016/j.artint.2008.04.002_bib046 article-title: LCW-based agent planning for the Semantic Web – volume: 38 start-page: 75 year: 1989 ident: 10.1016/j.artint.2008.04.002_bib041 article-title: On the relationship between circumscription and negation as failure publication-title: Artificial Intelligence doi: 10.1016/0004-3702(89)90068-4 – volume: 104 start-page: 165 issue: 1–2 year: 1998 ident: 10.1016/j.artint.2008.04.002_bib066 article-title: Combining Horn rules and description logics in CARIN publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(98)00048-4 – volume: 39 start-page: 299 issue: 3 year: 1989 ident: 10.1016/j.artint.2008.04.002_bib047 article-title: The strong exponential hierarchy collapses publication-title: J. Comput. Syst. Sci. doi: 10.1016/0022-0000(89)90025-1 – volume: vol. 2342 start-page: 364 year: 2002 ident: 10.1016/j.artint.2008.04.002_bib096 article-title: TRIPLE—A query, inference, and transformation language for the Semantic Web – ident: 10.1016/j.artint.2008.04.002_bib090 – volume: vol. 4772 start-page: 143 year: 2007 ident: 10.1016/j.artint.2008.04.002_bib073 article-title: Tractable probabilistic description logic programs – volume: vol. 3791 start-page: 160 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib103 article-title: Merging and aligning ontologies in dl-programs – year: 2002 ident: 10.1016/j.artint.2008.04.002_bib007 – volume: vol. 2083 start-page: 701 year: 2001 ident: 10.1016/j.artint.2008.04.002_bib045 article-title: RACER system description – volume: vol. 4126 start-page: 128 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib093 article-title: Integrating ontologies and rules: Semantic and computational issues – volume: 33 start-page: 374 issue: 3 year: 2001 ident: 10.1016/j.artint.2008.04.002_bib017 article-title: Complexity and expressive power of logic programming publication-title: ACM Comput. Surv. doi: 10.1145/502807.502810 – ident: 10.1016/j.artint.2008.04.002_bib028 – volume: vol. 3452 start-page: 511 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib029 article-title: Non-monotonic description logic programs: Implementation and experiments – volume: 13 start-page: 81 year: 1980 ident: 10.1016/j.artint.2008.04.002_bib089 article-title: A logic for default reasoning publication-title: Artificial Intelligence doi: 10.1016/0004-3702(80)90014-4 – volume: vol. 3703 start-page: 50 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib092 article-title: Semantic and computational advantages of the safe integration of ontologies and rules – volume: 25 start-page: 4 issue: 1 year: 2002 ident: 10.1016/j.artint.2008.04.002_bib052 article-title: DAML+OIL: A description logic for the Semantic Web publication-title: IEEE Bull. Technical Committee Data Engrg. – ident: 10.1016/j.artint.2008.04.002_bib106 – ident: 10.1016/j.artint.2008.04.002_bib003 – start-page: 90 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib030 article-title: A uniform integration of higher-order reasoning and external evaluations in answer-set programming – volume: vol. 4011 start-page: 273 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib031 article-title: Effective integration of declarative rules with external evaluations for Semantic Web reasoning – volume: vol. 2870 start-page: 17 year: 2003 ident: 10.1016/j.artint.2008.04.002_bib054 article-title: Reducing OWL entailment to description logic satisfiability – start-page: 260 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib015 article-title: Data complexity of query answering in description logics – volume: 3 start-page: 177 issue: 2 year: 2002 ident: 10.1016/j.artint.2008.04.002_bib022 article-title: Description logics of minimal knowledge and negation as failure publication-title: ACM Trans. Comput. Log. doi: 10.1145/505372.505373 – volume: vol. 4011 start-page: 332 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib085 article-title: Rules with contextually scoped negation – ident: 10.1016/j.artint.2008.04.002_bib057 – start-page: 48 year: 2003 ident: 10.1016/j.artint.2008.04.002_bib044 article-title: Description logic programs: Combining logic programs with description logics – volume: vol. 4126 start-page: 93 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib027 article-title: Reasoning with rules and ontologies – volume: 16 start-page: 38 issue: 2 year: 2001 ident: 10.1016/j.artint.2008.04.002_bib035 article-title: OIL: An ontology infrastructure for the Semantic Web publication-title: IEEE Intelligent Syst. doi: 10.1109/5254.920598 – volume: vol. 3323 start-page: 170 year: 2004 ident: 10.1016/j.artint.2008.04.002_bib104 article-title: Combining description logic and defeasible logic for the Semantic Web – volume: 48 start-page: 255 issue: 2 year: 1994 ident: 10.1016/j.artint.2008.04.002_bib014 article-title: The complexity of propositional closed world reasoning and circumscription publication-title: J. Comput. Syst. Sci. doi: 10.1016/S0022-0000(05)80004-2 – start-page: 121 year: 1985 ident: 10.1016/j.artint.2008.04.002_bib067 article-title: Computing circumscription – volume: 3 start-page: 41 issue: 1 year: 2005 ident: 10.1016/j.artint.2008.04.002_bib080 article-title: Query answering for OWL-DL with rules publication-title: J. Web Sem. doi: 10.1016/j.websem.2005.05.001 – start-page: 233 year: 2002 ident: 10.1016/j.artint.2008.04.002_bib064 article-title: Data integration: A theoretical perspective – start-page: 304 year: 2007 ident: 10.1016/j.artint.2008.04.002_bib019 article-title: Embedding non-ground logic programs into autoepistemic logic for knowledge base combination – ident: 10.1016/j.artint.2008.04.002_bib095 – start-page: 477 year: 2007 ident: 10.1016/j.artint.2008.04.002_bib076 article-title: A faithful integration of description logics with logic programming – start-page: 723 year: 2004 ident: 10.1016/j.artint.2008.04.002_bib055 article-title: A proposal for an OWL rules language – start-page: 79 year: 2000 ident: 10.1016/j.artint.2008.04.002_bib023 article-title: Declarative problem-solving using the DLV system – year: 2006 ident: 10.1016/j.artint.2008.04.002_bib078 article-title: A comparison of reasoning techniques for querying large description logic ABoxes – ident: 10.1016/j.artint.2008.04.002_bib011 – start-page: 89 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib071 article-title: Fuzzy description logic programs under the answer set semantics for the Semantic Web – ident: 10.1016/j.artint.2008.04.002_bib081 – start-page: 400 year: 2006 ident: 10.1016/j.artint.2008.04.002_bib012 article-title: Description logics with circumscription – ident: 10.1016/j.artint.2008.04.002_bib005 – start-page: 346 year: 1997 ident: 10.1016/j.artint.2008.04.002_bib099 article-title: A strong correspondence between description logics and open logic programming |
| SSID | ssj0003991 |
| Score | 2.4155028 |
| Snippet | We propose a combination of logic programming under the answer set semantics with the description logics
SHIF
(
D
)
and
SHOIN
(
D
)
, which underly the Web... |
| SourceID | pascalfrancis crossref elsevier |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 1495 |
| SubjectTerms | Answer set programming Applied sciences Artificial intelligence Closed-world reasoning Computational complexity Computer science; control theory; systems Computer systems and distributed systems. User interface Default logic Description logics Exact sciences and technology Information systems. Data bases Language theory and syntactical analysis Memory organisation. Data processing Ontologies Rules Semantic Web Software Speech and sound recognition and synthesis. Linguistics Theoretical computing |
| Title | Combining answer set programming with description logics for the Semantic Web |
| URI | https://dx.doi.org/10.1016/j.artint.2008.04.002 |
| Volume | 172 |
| WOSCitedRecordID | wos000258161300003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7921 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0003991 issn: 0004-3702 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLbKxgMS4o4Yl8kPvE1Bqe3E8WNUilYYEaKrVvESObEjbVpD1YZpf4V_y3Fiu-kGKjzwElVu3Kg-n88tn89B6G0c61CBoAMd8jJgFYkCGXIeyKFiCkKiYSRbSZ_wLEvmc_FlMPjpzsJcXfK6Tq6vxfK_ihrGQNjm6Ow_iNv_KAzAZxA6XEHscP0rwcMOL9quD0dghQwFfq0bR8Na-NSr0ht90aq_tSccTvUClvu8PDrTRd93TVctr6jt8tEr5Ol9clCCX29wjgzm0iybtNl3Q3tdFLJpjMvqiUCzT-l0Mj6bjL7dnjsdHU-y9yfpzNI14Lt6K02ReJKczZ1ZQ7-lixmot3BbF3PSBx0JhrSnXU0017PUoKzFb61Al5C4eNcWYnCEWVMlnWysnnvTf8MYeooiCU3nG8ruoH3CIwE6fz-djOcfvZkHz862Y-z-hjuX2ZIHbz_5T37P_aVcw26sujYqPd_m9BF6YIMSnHZgeowGun6CHtoABVv1v4Yh1wPEjT1Fnz3ccAc3DHDDPbhhAzfcgxvu4IYBbhjghh3cMMDtGZp9GJ-OjgPboiMoKY2bQApeSl6yiA91JMICHEwaR0UoSMEqJYUUBQTwUlKtKqoIjapEJoksJGfgOheSPkd79fdav0C4EoVIVKhZTBRjKpZhSRQvE5ZUkhAVHyDqFjAvbf1600blMndExYu8W3bbWpXlsOwHKPCzll39lh33cyeb3PqgnW-ZA7h2zDzcEqV_nEPSy103vEL3NjvnNdprVj_0G3S3vIJ9uTq0-PsFc-exSQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Combining+answer+set+programming+with+description+logics+for+the+Semantic+Web&rft.jtitle=Artificial+intelligence&rft.au=EITER%2C+Thomas&rft.au=IANNI%2C+Giovambattista&rft.au=LUKASIEWICZ%2C+Thomas&rft.au=SCHINDLAUER%2C+Roman&rft.date=2008-08-01&rft.pub=Elsevier&rft.issn=0004-3702&rft.volume=172&rft.issue=12-13&rft.spage=1495&rft.epage=1539&rft_id=info:doi/10.1016%2Fj.artint.2008.04.002&rft.externalDBID=n%2Fa&rft.externalDocID=20513334 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0004-3702&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0004-3702&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0004-3702&client=summon |