Loop formulas for description logic programs

Authors:
Yisong Wang;Jia-huai You;Li yan Yuan;Yi-dong Shen
Affiliations:
Department of computer science, guizhou university, guiyang, china and department of computing science, university of alberta, canada;Department of computing science, university of alberta, canada;Department of computing science, university of alberta, canada;State key laboratory of computer science institute of software, chinese academy of sciences, china
Venue:
Theory and Practice of Logic Programming
Year:
2010

Citing 12
Cited 5

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
A proposal for an owl rules language

Proceedings of the 13th international conference on World Wide Web
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
The Description Logic Handbook

The Description Logic Handbook
Combining answer set programming with description logics for the Semantic Web

Artificial Intelligence
Equilibria in heterogeneous nonmonotonic multi-context systems

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Embedding non-ground logic programs into autoepistemic logic for knowledge-base combination

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Declarative and computational properties of logic programs with aggregates

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the decidability and complexity of integrating ontologies and rules

Web Semantics: Science, Services and Agents on the World Wide Web
Reconciling description logics and rules

Journal of the ACM (JACM)
Quantified equilibrium logic and hybrid rules

RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems

The loop formula based semantics of description logic programs

Theoretical Computer Science
Uniform evaluation of nonmonotonic DL-Programs

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Well-supported semantics for description logic programs

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Semantic independence in DL-programs

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Data repair of inconsistent DL-programs

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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 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.