Abstract
hex-programs extend ASP by external sources. In this paper, we present domain-specific existential quantifiers on top of hex-programs, i.e., ASP programs with external access which may introduce new values that also show up in the answer sets. Pure logical existential quantification corresponds to a specific instance of our approach. Programs with existential quantifiers may have infinite groundings in general, but for specific reasoning tasks a finite subset of the grounding can suffice. We introduce a generalized grounding algorithm for such problems, which exploits domain-specific termination criteria in order to generate a finite grounding for bounded model generation. As an application we consider query answering over existential rules. In contrast to other approaches, several extensions can be naturally integrated into our approach. We further show how terms with function symbols can be handled by hex-programs, which in fact can be seen as a specific form of existential quantification.
This research has been supported by the Austrian Science Fund (FWF) project P20840, P20841, P24090, and by the Vienna Science and Technology Fund (WWTF) project ICT08-020.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In general, \(\psi (\mathbf{Z},\mathbf{Y})\) might be a conjunction of atoms but this may be normalized.
- 2.
For space reasons we refer to [17] for the definition of Shy-programs.
- 3.
\( CG (\varPi )\) is the least fixed point \(G_{\varPi }^{\infty }(\emptyset )\) of a monotone operator on programs \(\varPi '\) [6].
References
Aavani, A., Wu, X.N., Ternovska, E., Mitchell, D.: Grounding formulas with complex terms. In: Butz, C., Lingras, P. (eds.) Canadian AI 2011. LNCS, vol. 6657, pp. 13–25. Springer, Heidelberg (2011)
Alviano, M., Faber, W., Leone, N., Manna, M.: Disjunctive datalog with existential quantifiers: semantics, decidability, and complexity issues. TPLP 12(4–5), 701–718 (2012)
Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)
Calimeri, F., Cozza, S., Ianni, G.: External sources of knowledge and value invention in logic programming. Ann. Math. Artif. Intell. 50(3–4), 333–361 (2007)
Eiter, T., Fink, M., Krennwallner, T., Redl, C.: Grounding HEX-programs with expanding domains. In: Workshop on Grounding and Transformations for Theories with Variables (GTTV’13), pp. 3–15 (2013)
Eiter, T., Fink, M., Krennwallner, T., Redl, C.: Liberal safety for answer set programs with external sources. In: AAAI’13, pp. 267–275. AAAI Press (2013)
Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In: IJCAI, pp. 90–96 (2005)
Eiter, T., Simkus, M.: FDNC: decidable nonmonotonic disjunctive logic programs with function symbols. ACM Trans. Comput. Log. 11(2), 14:1–14:50 (2010)
Faber, W., Leone, N., Pfeifer, G.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278–298 (2011)
Fagin, R., Kolaitis, P., Miller, R., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)
Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52–89 (2012)
Gebser, M., Sabuncu, O., Schaub, T.: An incremental answer set programming based system for finite model computation. AI Commun. 24(2), 195–212 (2011)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3–4), 365–386 (1991)
Grau, B.C., Horrocks, I., Krötzsch, M., Kupke, C., Magka, D., Motik, B., Wang, Z.: Acyclicity conditions and their application to query answering in description logics. In: KR’12, pp. 243–253. AAAI Press (2012)
Hernich, A., Kupke, C., Lukasiewicz, T., Gottlob, G.: Well-founded semantics for extended datalog and ontological reasoning. In: PODS’13, pp. 225–236. ACM (2013)
Heymans, S., Nieuwenborgh, D.V., Vermeir, D.: Open answer set programming with guarded programs. ACM Trans. Comput. Logic 9(4), 26:1–26:53 (2008)
Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable datalog\(^{\exists }\) programs. In: KR’12, pp. 13–23. AAAI Press (2012)
Magka, D., Krötzsch, M., Horrocks, I.: Computing stable models for nonmonotonic existential rules. In: IJCAI’13, pp. 1031–1038. AAAI Press (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix: Term Bounding Function \(b_{ synsem }\)
Appendix: Term Bounding Function \(b_{ synsem }\)
The TBF \(b_{ synsem }\) [6] builds on the positive attribute dependency graph \(G_A(\varPi )\), whose nodes are the attributes of \(\varPi \) and whose edges model the information flow between them. E.g., if for rule \(r\) we have \(p(\mathbf{X}) \,{\in }\, H(r)\) and \(q(\mathbf{Y}) \,{\in }\, B^{+}(r)\) such that \(X_i \,{=}\, Y_j\) for some \(X_i\,{\in }\, \mathbf{X}\) and \(Y_j\,{\in }\, \mathbf{Y}\), then we have a flow from \(q{\upharpoonright }_{}j\) to \(p{\upharpoonright }_{}i\). A cycle \(K\) in \(G_A(\varPi )\) is benign wrt. a set of safe attributes \(S\), if there exists a well-ordering \(\le _{\mathcal {C}}\) of \(\mathcal {C}\), such that for every \(\&{g}[\mathbf{X}]_r{\upharpoonright }_{\textsc {o}}j \not \in S\) in the cycle, \( f_{\text { } \& g}(\mathbf {A},x_1, \ldots , x_m,t_1, \ldots t_n) = 0\) whenever
-
some \(x_i\) for \(1 \,{\le }\, i \,{\le }\, m\) is a predicate parameter, \(\&{g}[\mathbf{X}]_r{\upharpoonright }_{\textsc {i}}i\,{\not \in }\,S\) is in \(K\), and we have \((s_1, \ldots , s_{ ar (x_i)})\,{\in }\, ext (\mathbf {A}, x_i)\), and \(t_j \not \le _{\mathcal {C}} s_k\) for some \(1 \le k \le ar (x_i)\); or
-
for some \(1\le i\le m\), \( type (\&{g},i)=\mathtt {const}\), \(\&{g}[\mathbf{X}]_r{\upharpoonright }_{\textsc {i}}i \not \in S\) is in \(K\), and \(t_j \not \le _{\mathcal {C}} x_i\).
A cycle in \(G_A(\varPi )\) is called malign wrt. \(S\) if it is not benign. Then \(b_{ synsem }\) is as follows.
Definition 5
(Syntactic and Semantic Term Bounding Function). We define the TBF \(b_{ synsem }(\varPi , r, S, B)\) such that \(t \in b_{ synsem }(\varPi , r, S, B)\) iff
-
(i)
\(t\) is a constant in \(r\); or
-
(ii)
there is an ordinary atom \(q(s_1, \ldots , s_{ ar (q)}) \in B^{+}(r)\) such that \(t = s_j\), for some \(1 \le j \le ar (q)\) and \(q{\upharpoonright }_{}j \in S\); or
-
(iii)
for some external atom \(\&{g}[\mathbf{X}](\mathbf{Y}) \in B^{+}(r)\), we have that \(t = Y_i\) for some \(Y_i\in \mathbf{Y}\), and for each \(X_i \in \mathbf{X}\), \(X_i \in B\), if \(\tau (\&{g}, i) = \mathbf {const},\) and \(X_i{\upharpoonright }_{}1, \ldots , X_i{\upharpoonright }_{} ar (X_i) \in S\) if \(\tau (\&{g}, i) = \mathbf {pred}\); or
-
(iv)
\(t\) is captured by some attribute \(\alpha \) in \(B^{+}(r)\) that is not reachable from malign cycles in \(G_A(\varPi )\) wrt. \(S\), i.e., if \(\alpha \,{=}\,p{\upharpoonright }_{}i\) then \(t\,{=}t_i\) for some \(p(t_1,\ldots ,t_\ell ) \,{\in }\, B^{+}(r)\), and if \(\alpha \,{=}\, \&{g}[\mathbf{X}]_r{\upharpoonright }_{T}i\) then \(t \,{=}\,X^T_i\) for some \(\&{g}[\mathbf{X}^{\textsc {i}}](\mathbf{X}^{\textsc {o}})\) \({\in }\, B^{+}(r)\) where the input and output vectors are \(\mathbf{X}^T{=}X_1^T,\ldots ,X^T_{ ar _{}(\&{g})}\); or
-
(v)
\(t \,{=}\, Y_i\) for some \(\&{g}[\mathbf{X}](\mathbf{Y})\,{\in }\, B^{+}(r)\), where \(\{y_i \mid \mathbf{x} \in (\mathcal {P} \cup \mathcal {C})^{ ar _{\textsc {i}}(\&{g})}, \mathbf{y} \in \mathcal {C}^{ ar _{\textsc {o}}(\&{g})},\) \( f_{\text { } \& g}(\mathbf {A},\mathbf{x},\mathbf{y})\,{=}\, 1\}\) is finite for all assignments \(\mathbf {A}\).
-
(vi)
\(t \,{\in }\, \mathbf{X}\) for some \(\&{g}[\mathbf{X}](\mathbf{Y}) \,{\in }\, B^{+}(r)\), where \(U \,{\in }\, B\) for every \(U\,{\in }\, \mathbf{Y}\) and \(\{\mathbf{x} \mid \mathbf{x} \,{\in }\, (\mathcal {P} {\cup }\mathcal {C})^{ ar _{\textsc {i}}(\&{g})},\) \( f_{\text { } \& g}(\mathbf {A},\mathbf{x},\mathbf{y}) = 1\}\) is finite for every \(\mathbf {A}\) and \(\mathbf{y} \in \mathcal {C}^{ ar _{\textsc {o}}(\&{g})}\).
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Eiter, T., Fink, M., Krennwallner, T., Redl, C. (2014). hex-Programs with Existential Quantification. In: Hanus, M., Rocha, R. (eds) Declarative Programming and Knowledge Management. INAP WLP WFLP 2013 2013 2013. Lecture Notes in Computer Science(), vol 8439. Springer, Cham. https://doi.org/10.1007/978-3-319-08909-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-08909-6_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08908-9
Online ISBN: 978-3-319-08909-6
eBook Packages: Computer ScienceComputer Science (R0)