Well-founded operators for normal hybrid MKNF knowledge bases
暂无分享,去创建一个
[1] Allen Van Gelder,et al. The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..
[2] Alex M. Andrew,et al. Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .
[3] Jia-Huai You,et al. A Generalization of Approximation Fixpoint Theory and Application , 2014, RR.
[4] Shang-Hua Teng,et al. Smoothed analysis: an attempt to explain the behavior of algorithms in practice , 2009, CACM.
[5] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..
[6] Victor W. Marek,et al. Ultimate approximation and its application in nonmonotonic knowledge representation systems , 2004, Inf. Comput..
[7] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[8] Peter F. Patel-Schneider,et al. OWL 2 Web Ontology Language Primer (Second Edition) , 2012 .
[9] Mario Alviano,et al. Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates , 2011, J. Artif. Intell. Res..
[10] Hai Wan,et al. Simplifying A Logic Program Using Its Consequences , 2015, IJCAI.
[11] Torsten Schaub,et al. What's Hot in the SAT and ASP Competitions , 2015, AAAI.
[12] Sharad Malik,et al. Boolean satisfiability from theoretical hardness to practical success , 2009, Commun. ACM.
[13] Cesare Tinelli,et al. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.
[14] Vladimir Lifschitz,et al. Nonmonotonic Databases and Epistemic Queries , 1991, IJCAI.
[15] Diego Calvanese,et al. The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.
[16] José Júlio Alferes,et al. Local closed world reasoning with description logics under the well-founded semantics , 2011, Artif. Intell..
[17] Antonius Weinzierl,et al. Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access , 2016, IJCAI.
[18] Maurice Bruynooghe,et al. FO(ID) as an extension of DL with rules , 2008, Annals of Mathematics and Artificial Intelligence.
[19] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .
[20] Boris Motik,et al. Reconciling description logics and rules , 2010, JACM.
[21] Martin Gebser,et al. Conflict-driven answer set solving: From theory to practice , 2012, Artif. Intell..
[22] Francesco Scarcello,et al. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..
[23] Sharad Malik,et al. The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.