Combining answer set programming with description logics for the semantic web

DOI10.1016/J.ARTINT.2008.04.002zbMath1183.68595OpenAlexW2100983017MaRDI QIDQ2389666

Giovambattista Ianni, Thomas Lukasiewicz, Thomas Eiter, Hans Tompits, Roman Schindlauer

Publication date: 17 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2008.04.002

zbMATH Keywords

rulescomputational complexitydefault logicdescription logicsanswer set programmingontologiessemantic webclosed-world reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17) Internet topics (68M11)

Related Items (68)

Supportedly stable answer sets for logic programs with generalized atoms ⋮ Evaluating epistemic negation in answer set programming ⋮ Combining event calculus and description logic reasoning via logic programming ⋮ Linking Open-World Knowledge Bases Using Nonmonotonic Rules ⋮ Simulating Production Rules Using ACTHEX ⋮ Stepwise Debugging of Description-Logic Programs ⋮ Well-Supported Semantics for Logic Programs with Generalized Rules ⋮ Expressiveness of communication in answer set programming ⋮ Reasoning with Forest Logic Programs and f-hybrid knowledge bases ⋮ Data repair of inconsistent nonmonotonic description logic programs ⋮ Conceptual logic programs ⋮ Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin ⋮ Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) ⋮ Cautious reasoning in ASP via minimal models and unsatisfiable cores ⋮ A framework for modular ERDF ontologies ⋮ Anytime Computation of Cautious Consequences in Answer Set Programming ⋮ FO(ID) as an extension of DL with rules ⋮ Open answer set programming for the semantic web ⋮ On the relation between SPARQL1.1 and Answer Set Programming ⋮ Integrity constraints in OWL ontologies based on grounded circumscription ⋮ Reasoning on with Defeasibility in ASP ⋮ Rewriting recursive aggregates in answer set programming: back to monotonicity ⋮ Complexity and compilation of GZ-aggregates in answer set programming ⋮ Modular action language ⋮ A model building framework for answer set programming with external computations ⋮ ASP for minimal entailment in a rational extension of SROEL ⋮ Beyond NP: Quantifying over Answer Sets ⋮ Abstract Solvers for Computing Cautious Consequences of ASP programs ⋮ On combining ontologies and rules ⋮ Extended RDF: computability and complexity issues ⋮ Tightly integrated probabilistic description logic programs for representing ontology mappings ⋮ Towards provenance in heterogeneous knowledge bases ⋮ Description Logic Programs Under Probabilistic Uncertainty and Fuzzy Vagueness ⋮ Local closed world reasoning with description logics under the well-founded semantics ⋮ An ASP approach for reasoning in a concept-aware multipreferential lightweight DL ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Adding Metalogic Features to Knowledge Representation Languages* ⋮ Reactive multi-context systems: heterogeneous reasoning in dynamic environments ⋮ Reasoning on the Web with Assumption-Based Argumentation ⋮ Enhancing context knowledge repositories with justifiable exceptions ⋮ Conflict-driven ASP solving with external sources ⋮ From description-logic programs to multi-context systems ⋮ Description logic programs under probabilistic uncertainty and fuzzy vagueness ⋮ The role of semantics in mining frequent patterns from knowledge bases in description logics with rules ⋮ Decidability of Circumscribed Description Logics Revisited ⋮ Loop-separable programs and their first-order definability ⋮ Loop formulas for description logic programs ⋮ Defeasible RDFS via rational closure ⋮ Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings ⋮ Probabilistic description logic programs ⋮ Determining inference semantics for disjunctive logic programs ⋮ Inlining External Sources in Answer Set Programs ⋮ Fixed point semantics for stream reasoning ⋮ Flexible Approximators for Approximating Fixpoint Theory ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ Realizing Default Logic over Description Logic Knowledge Bases ⋮ Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web ⋮ On Coherence and Consistence in Fuzzy Answer Set Semantics for Residuated Logic Programs ⋮ Answer Set Programming: A Primer ⋮ Exploiting conjunctive queries in description logic programs ⋮ The loop formula based semantics of description logic programs ⋮ A formal model of semantic computing ⋮ Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure ⋮ Combining Nonmonotonic Knowledge Bases with External Sources ⋮ Combining Description Logics, Description Graphs, and Rules ⋮ Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic ⋮ Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures ⋮ Domain expansion for ASP-programs with external sources

Uses Software

• Smodels
• Racer
• swrl
• Unnamed Item
• Unnamed Item
• Unnamed Item

Cites Work

• The strong exponential hierarchy collapses
• Computing functions with parallel queries to NP
• Probabilistic description logic programs
• Exploiting conjunctive queries in description logic programs
• A logical framework for default reasoning
• On the relationship between circumscription and negation as failure
• A logic for default reasoning
• Combining Horn rules and description logics in CARIN
• The complexity of propositional closed world reasoning and circumscription
• On the computational cost of disjunctive logic programming: Propositional case
• Reasoning on UML class diagrams
• Complexity of the two-variable fragment with counting quantifiers
• Complexity Results for Nonmonotonic Logics
• The well-founded semantics for general logic programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• The DLV system for knowledge representation and reasoning
• A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Logic for Programming, Artificial Intelligence, and Reasoning
• Description logics of minimal knowledge and negation as failure
• The classical decision problem.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combining answer set programming with description logics for the semantic web