The loop formula based semantics of description logic programs
From MaRDI portal
Publication:764312
DOI10.1016/j.tcs.2011.10.026zbMath1255.68149arXiv1007.4040MaRDI QIDQ764312
Yi-Dong Shen, Yisong Wang, Jia-Huai You, Li Yan Yuan, Mingyi Zhang
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.4040
68T27: Logic in artificial intelligence
68T30: Knowledge representation
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68N17: Logic programming
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ASSAT: computing answer sets of a logic program by SAT solvers
- Web reasoning and rule systems. First international conference, RR 2007, Innsbruck, Austria, June 7--8, 2007. Proceedings
- Logic programs with stable model semantics as a constraint programming paradigm
- Combining answer set programming with description logics for the semantic web
- Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
- Logic programs with propositional connectives and aggregates
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
- Reconciling description logics and rules
- Loop formulas for description logic programs
- The well-founded semantics for general logic programs
- A Logical Semantics for Description Logic Programs
- The DLV system for knowledge representation and reasoning
- The Description Logic Handbook
- Logics in Artificial Intelligence
- Logic Programming and Nonmonotonic Reasoning
- Lparse Programs Revisited: Semantics and Representation of Aggregates