Combining answer set programming with description logics for the Semantic Web

, , , &
Artificial Intelligence 172 (12-13):1495-1539 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2008.04.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Semantic forgetting in answer set programming.Thomas Eiter & Kewen Wang - 2008 - Artificial Intelligence 172 (14):1644-1672.
Model-based recasting in answer-set programming.Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits & Stefan Woltran - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):75-104.
An overview of tableau algorithms for description logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
Author’s Response: Programming as a Playground for Computational Thinking Development.Jiří Vaníček - 2019 - Constructivist Foundations 14 (3):379-381.
General theory on the combination of logics.Alexandre Costa-Leite - unknown
On the relation between SPARQL1.1 and Answer Set Programming.Axel Polleres & Johannes Peter Wallner - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):159-212.
Combining Algebraizable Logics.Á E. Eiben, A. Jánossy & Á Kurucz - 1996 - Notre Dame Journal of Formal Logic 37 (2):366-380.
From fibring to cryptofibring. A solution to the collapsing problem.Carlos Caleiro & Jaime Ramos - 2007 - Logica Universalis 1 (1):71-92.
Using criticalities as a heuristic for answer set programming.Orkunt Sabuncu, Ferda N. Alpaslan & Varol Akman - 2003 - In Vladimir Lifschitz & Ilkka Niemela (eds.), Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence 2923 (7th International Conference, LPNMR 2004, Fort Lauderdale, FL, January 6-8, 2004 Proceedings). Berlin, Heidelberg: Springer. pp. 234-246.
Combining Algebraizable Logics.A. Jánossy, Á Kurucz & Á. E. Eiben - 1996 - Notre Dame Journal of Formal Logic 37 (2):366-380.
A reductive semantics for counting and choice in answer set programming.Vladimir Lifschitz - unknown
Synthesized substructural logics.Norihiro Kamide - 2007 - Mathematical Logic Quarterly 53 (3):219-225.
Evaluating epistemic negation in answer set programming.Yi-Dong Shen & Thomas Eiter - 2016 - Artificial Intelligence 237 (C):115-135.
A Description Logic of Typicality for Conceptual Combination.Antonio Lieto & Gian Luca Pozzato - 2018 - In Proceedings of ISMIS 18. Springer.
Combining probabilistic logic programming with the power of maximum entropy.Gabriele Kern-Isberner & Thomas Lukasiewicz - 2004 - Artificial Intelligence 157 (1-2):139-202.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,469,565)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

View all 15 citations / Add more citations

References found in this work

A logical framework for default reasoning.David Poole - 1988 - Artificial Intelligence 36 (1):27-47.
A logic for default reasoning.Ray Reiter - 1980 - Artificial Intelligence 13 (1-2):81-137.
Reasoning on UML class diagrams.Daniela Berardi, Diego Calvanese & Giuseppe De Giacomo - 2005 - Artificial Intelligence 168 (1-2):70-118.
Complexity of the two-variable fragment with counting quantifiers.Ian Pratt-Hartmann - 2005 - Journal of Logic, Language and Information 14 (3):369-395.

View all 6 references / Add more references