Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming
暂无分享,去创建一个
Wolfgang Faber | Stefan Woltran | Gerald Pfeifer | Thomas Eiter | Michael Fink | Thomas Eiter | G. Pfeifer | Michael Fink | S. Woltran | Wolfgang Faber
[1] Rina Dechter,et al. Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.
[2] Piero A. Bonatti. Resolution for Skeptical Stable Model Semantics , 2004, Journal of Automated Reasoning.
[3] Georg Gottlob,et al. Complexity and expressive power of logic programming , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.
[4] Thomas Linke,et al. NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics , 2001, IJCAR.
[5] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..
[6] Theresa Swift,et al. Deduction in Ontologies via ASP , 2004, LPNMR.
[7] Luigi Palopoli,et al. Reasoning with Minimal Models: Efficient Algorithms and Applications. , 1994, KR 1994.
[8] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[9] Adnan H. Yahya,et al. Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases , 2004, Journal of Automated Reasoning.
[10] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[11] Thomas Linke,et al. NoMoRe : A System for Non-Monotonic Reasoning under Answer Set Semantics , 2001, LPNMR.
[12] Jack Minker. Foundations of deductive databases and logic programming , 1988 .
[13] Georg Gottlob,et al. Disjunctive datalog , 1997, TODS.
[14] Teodor C. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..
[15] Georg Gottlob,et al. On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.
[16] Wolfgang Faber,et al. The DLV system for knowledge representation and reasoning , 2002, TOCL.
[17] Sergio Greco,et al. Optimization of Disjunctive Queries , 1999, International Conference on Logic Programming.
[18] Francesco Buccafurri,et al. Enhancing Disjunctive Datalog by Constraints , 2000, IEEE Trans. Knowl. Data Eng..
[19] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[20] Moshe Y. Vardi. On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.
[21] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..
[22] Moshe Y. Vardi. On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.
[23] Fangzhen Lin,et al. ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..
[24] Thomas Eiter,et al. Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases , 1998, Theor. Comput. Sci..
[25] Jia-Huai You,et al. Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.
[26] Yuliya Lierler,et al. Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs , 2004, LPNMR.
[27] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[28] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[29] Frédéric Saubion,et al. Answer Set Programming by Ant Colony Optimization , 2002, JELIA.
[30] Georg Gottlob,et al. Succinctness as a Source of Complexity in Logical Formalisms , 1999, Ann. Pure Appl. Log..
[31] Sergio Greco,et al. Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries , 2003, IEEE Trans. Knowl. Data Eng..