The loop formula based semantics of description logic programs

DOI10.1016/J.TCS.2011.10.026zbMATH Open1255.68149arXiv1007.4040OpenAlexW2104606980MaRDI QIDQ764312FDOQ764312

MingYi Zhang, Yisong Wang, Yi-Dong Shen, Li Yan Yuan, Jia-Huai You

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl-program can be precisely captured by the models of its completion and loop formulas. Furthermore, we propose a new, alternative semantics for dl-programs, called the {em canonical answer set semantics}, which is defined by the models of completion that satisfy what are called canonical loop formulas. A desirable property of canonical answer sets is that they are free of circular justifications. Some properties of canonical answer sets are also explored.

Full work available at URL: https://arxiv.org/abs/1007.4040

zbMATH Keywords

answer set programmingsemantic webdescription logic programsloop formulas

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lparse Programs Revisited: Semantics and Representation of Aggregates
• ASSAT: computing answer sets of a logic program by SAT solvers
• Combining answer set programming with description logics for the semantic web
• The well-founded semantics for general logic programs
• The DLV system for knowledge representation and reasoning
• Logic Programming and Nonmonotonic Reasoning
• The Description Logic Handbook
• Logic programs with stable model semantics as a constraint programming paradigm
• Reconciling description logics and rules
• Loop formulas for description logic programs
• Logics in Artificial Intelligence
• A Logical Semantics for Description Logic Programs
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
• Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
• Logic programs with propositional connectives and aggregates
• Web reasoning and rule systems. First international conference, RR 2007, Innsbruck, Austria, June 7--8, 2007. Proceedings

Cited In (3)

• A model building framework for answer set programming with external computations
• Automated Deduction – CADE-19
• Stepwise Debugging of Description-Logic Programs

Uses Software

• ASSAT
• Lparse

This page was built for publication: The loop formula based semantics of description logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764312)