Logic Programming with Graded Introspection

• Autorzy: Zhang Z. , Wang B. , Zhang S.

Identyfikatory

DOI

10.3233/FI-2016-1400

• Konferencja: ASPOCP 2015 : ASPOCP International Workshop on “Answer Set Programming and Other Computing Paradigms” (8: August 31, 2015: Cork, Ireland)
• Języki publikacji: EN

Abstrakty

EN

This paper develops a logic programming language, GI-log, that extends answer set programming language with a new graded modality K_ω where ω is an interval satisfying ω ⊆ [0; 1]. The modality is used to precede a literal in rules bodies, and thus allows for the representation of graded introspections in the presence of multiple belief sets: K_ωF intuitively means: it is known that the proportion of the belief sets where F is true is in the interval ω. We define the semantics of GI-log, study the relation to the languages of strong introspections, give an algorithm for computing solutions of GI-log programs, and investigate the use of GI-log for formalizing contextual reasoning, conformant planning with threshold, and modeling a graph problem.

Słowa kluczowe

EN

logic programming; epistemic specification; graded introspection

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2016
• Tom: Vol. 147, nr 1
• Strony: 133--158
• Opis fizyczny: Bibliogr. 25 poz., tab.

Twórcy

autor

Zhang Z.

• School of Computer Science and Engineering, Southeast University, 2#, Si Pai Lou, Nanjing, China

autor

Wang B.

• School of Computer Science and Engineering, Southeast University, 2#, Si Pai Lou, Nanjing, China

autor

Zhang S.

• School of Computer Science and Engineering, Southeast University, 2#, Si Pai Lou, Nanjing, China

Bibliografia

• [1] Baral C, Gelfond M, and Rushton JN. Probabilistic reasoning with answer Sets. Theory and Practice of Logic Programming, 9(1), 2009, 57–144. doi:10.1017/S1471068408003645.
• [2] Gelfond M, Kahl Y. Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach. Cambridge Unversity Press, 2014. ISBN:1107029562 9781107029569.
• [3] Faber W, Pfeifer G, Leone N, Dellarmi T, and Ielpa G. Design and implementation of aggregate functions in the dlv system. Theory and Practice of Logic Programming, 8(5–6), 2008, 545-580. doi:10.1017/S1471068408003323.
• [4] Gebser M, Kaufmann B, Schaub T. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence, (187-188), 2012, 52-89. doi:10.1016/j.artint.2012.04.001.
• [5] Lin F. Shoham Y. Epistemic semantics for fixed-points non-monotonic logics. Proc. the 3rd Conference on Theoretical Aspects of Reasoning About Knowledge, 1990, 111-120. Available from: http://dl.acm.org/citation.cfm?id=1027014.1027030.
• [6] Lifschitz V. Nonmonotonic databases and epistemic queries. Proc. the 20th International Joint Conference on Artificial Intelligence, 1991, 381-386. Available from: http://dl.acm.org/citation.cfm?id=1631171.1631228.
• [7] Lifschitz V, Pearce D, Valverde A. Strongly equivalent logic programs. ACM Transaction on Computational Logic, 2(4), 2001, 526-541. doi:10.1145/383779.383783.
• [8] Gelfond M. Strong introspection. Proc. the Ninth National conference on Artificial intelligence, 1991, 386-391. Available from: http://dl.acm.org/citation.cfm?id=1865675.1865735.
• [9] Gelfond M. Logic programming and reasoning with incomplete information. Annals of Mathematics and Artificial Intelligence, 12(1-2), 1994, 89-116. doi:10.1007/BF01530762.
• [10] Gomes AS, Alferes JJ, Swift T. Implementing query aswering for hybrid MKNF knowledge bases. Proc. Practical Aspects of Declarative Languages, LNCS 5937. 2010, 25-39. doi:10.1007/978-3-642-11503-5_4.
• [11] Kahl P, Watson R, Balai E, Gelfond M, Zhang Y. The language of epistemic specifications (refined) including a prototype solver. Journal of Logic and Computation, first published online September 10, 2015, doi:10.1093/logcom/exv065.
• [12] Truszczynski M. Revisiting epistemic specifications. Proc. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, LNCS 6565, 2011, 315-333. Available from: http://dl.acm.org/citation.cfm?id=2001078.2001099.
• [13] Motik B, Rosati R. Reconciling description logics and rules. Journal of the ACM 57(5), 2010. doi: 10.1145/1754399.1754403.
• [14] Zhang Y. Epistemic reasoning in logic programs. Proc. the 20th International Joint Conference on Artificial Intelligence, 2007, 647-653. Available from: http://dl.acm.org/citation.cfm?id=1625275.1625379.
• [15] Gelfond M. New semantics for epistemic specifications. Proc. Logic Programming and Nonmonotonic Reasoning, LNCS 6645, 2011, 260-265. Available from: http://dl.acm.org/citation.cfm?id=2010192.2010224.
• [16] Zhang Z, Zhao K. Esmodels: an epistemic specification inference. Proc. IEEE 25th International Conference on Tools with Artificial Intelligence. 2013, 769-774. doi:10.1109/ICTAI.2013.118.
• [17] Brewka G, Roelofsen F, and Serafini L. Contextual default reasoning, Proc. the 20th International Joint Conference on Artificial Intelligence, 2007, 268-273. Available from: http://dl.acm.org/citation.cfm?id=1625275.1625317.
• [18] Smith DE, and Weld DS. Conformant graphplan. Proc. the Fifteenth National Conference on Artificial Intelligence, 1998, 889-896. Available from: http://dl.acm.org/citation.cfm?id=295240.295918.
• [19] Kersting K, De Raedt L, and Kramer S. Interpreting bayesian logic programs. Proc. the AAAI-2000 workshop on learning statistical models from relational data, 2000, 29-35.
• [20] Dekhtyar A, and Dekhtyar MI. Possible worlds semantics for probabilistic logic programs. Proc. the 20th Conference on Logic Programming, 2004, 137-148. doi:10.1007/978-3-540-27775-0_10.
• [21] Baral C, Gelfond M, and Rushton JN. Probabilistic reasoning with answer sets. Theory and Practice of Logic Programming, 9(1), 2009, 57-144. doi:10.1017/S1471068408003645.
• [22] Lee J, Wang Y. A probabilistic extension of the stable model semantics. Proc. AAAI Spring Symposium on Logical Formalizations of Commonsense Reasoning, 2015, 96-102.
• [23] clingo-4.5.3-win64 guide, http://sourceforge.net/projects/potassco/files/guide/2.0/guide-2.0.pdf.
• [24] Eiter T, and Gottlob G. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15(3–4), 1995, 289-323. doi:10.1007/BF01536399.
• [25] Kifer M, and Subrahmanian VS. Theory of generalized annotated Logic programming and its applications, Journal of Logic Programming, 12(12), 1992, 335–367. doi:10.1016/0743-1066(92)90007-P.

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).