AlvianoM., CalimeriF., FaberW., LeoneN. and PerriS.
2011. Unfounded sets and well-founded semantics of answer set programs with aggregates. Journal of Artificial Intelligence Research
BaaderF., McGuinnessD. L. and NardiD.
2003. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press.
2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
BiY., YouJ. and FengZ.
2014. A generalization of approximation fixpoint theory and application. In Proc. of the 8th International Conference on Web Reasoning and Rule Systems, 45–59.
DeneckerM., MarekV. W. and TruszczynskiM.
2004. Ultimate approximation and its application in nonmonotonic knowledge representation systems. Information and Computation
192, 1, 84–121.
EiterT., KaminskiT., RedlC. and WeinzierlA.
2016. Exploiting partial assignments for efficient evaluation of answer set programs with external source access. In Proc. of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York, NY, USA, 9–15 July 2016, 1058–1065.
GebserM., KaufmannB. and SchaubT.
2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence
1993. The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences
47, 1, 185–221.
HeuleM. and SchaubT.
2015. What's hot in the SAT and ASP competitions. In Proc. of the 29th AAAI Conference on Artificial Intelligence (AAAI-15), 4322–4323.
HitzlerP., KrötzschM., ParsiaB., Patel-SchneiderP. F. and RudolphS.
2009. Owl 2 web ontology language primer. W3C Recommendation
27, 1, 123.
JiJ., WanH., HuoZ. and YuanZ.
2015. Simplifying A logic program using its consequences. In Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), July 25–31, 2015, Buenos Aires, Argentina, 3069–3075.
KnorrM., AlferesJ. J. and HitzlerP.
2011. Local closed world reasoning with description logics under the well-founded semantics. Artificial Intelligence
175, 9, 1528–1554.
LeoneN., RulloP. and ScarcelloF.
1997. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation
135, 2, 69–112.
1991. Nonmonotonic databases and epistemic queries. In Proc. of the 12th International Joint Conference on Artificial Intelligence (IJCAI-91), 381–386.
MalikS. and ZhangL.
2009. Boolean satisfiability from theoretical hardness to practical success. Communications ACM
52, 8, 76–82.
MotikB. and RosatiR.
2010. Reconciling description logics and rules. Journal of the ACM
57, 5, 30.
NieuwenhuisR., OliverasA. and TinelliC.
2006. Solving SAT and SAT Modulo Theories: From an abstract davis-putnam-logemann-loveland procedure to DPLL(T). Journal of the ACM
53, 6, 937–977.
SimonsP., NiemeläI. and SoininenT.
2002. Extending and implementing the stable model semantics. Artificial Intelligence
138, 1–2, 181–234.
1955. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics
5, 2, 285–309.
Van GelderA., RossK. A. and SchlipfJ. S.
1991. The well-founded semantics for general logic programs. Journal of the ACM
38, 3, 619–649.
VennekensJ., DeneckerM. and BruynoogheM.
2010. FO(ID) as an extension of DL with rules. Annals of Mathematics and Artificial Intelligence
58, 1–2, 85–115.
ZhangL. and MalikS.
2002. The quest for efficient Boolean satisfiability solvers. In Proc. of the14th International Conference on Computer Aided Verification, (CAV 2002), July 27–31, 2002, Copenhagen, Denmark, 17–36.