×

Normal form nested programs. (English) Zbl 1178.68131

Hölldobler, Steffen (ed.) et al., Logics in artificial intelligence. 11th European conference, JELIA 2008, Dresden, Germany, September 28–October 1, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87802-5/pbk). Lecture Notes in Computer Science 5293. Lecture Notes in Artificial Intelligence, 76-88 (2008).
Summary: Disjunctive logic programming under the answer set semantics (DLP, ASP) has been acknowledged as a versatile formalism for knowledge representation and reasoning during the last decade. Lifschitz, Tang, and Turner have introduced an extended language of DLP, called Nested Logic Programming (NLP), in [V. Lifschitz, L. R. Tang and H. Turner, “Nested expressions in logic programs”, Ann. Math. Artif. Intell. 25, No. 3–4, 369–389 (1999; Zbl 0940.68075)]. It often allows for more concise representations by permitting a richer syntax in rule heads and bodies. However, that language is propositional and thus does not allow for variables, one of the strengths of DLP.
In this paper, we introduce a language similar to NLP, called Normal Form Nested (NPN) programs, which does allow for variables, and present the syntax and semantics. With the presence of variables, domain independence is no longer guaranteed. We study this issue in depth and define the class of safe NPN programs, which are guaranteed to be domain independent. Moreover, we show that for NPN programs which are also NLPs, our semantics coincides with the one of [loc. cit.]; while keeping the standard meaning of answer sets on DLP programs with variables. Finally, we provide an algorithm which translates NPN programs into DLP programs, and does so in an efficient way, allowing for the effective implementation of the NPN language on top of existing DLP systems.
For the entire collection see [Zbl 1146.68009].

MSC:

68N17 Logic programming

Citations:

Zbl 0940.68075

Software:

GNT
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Lifschitz, V.; Tang, L. R.; Turner, H., Nested Expressions in Logic Programs, AMAI, 25, 3-4, 369-389 (1999) · Zbl 0940.68075
[2] Przymusinski, T. C., Stable Semantics for Disjunctive Programs, NGC, 9, 401-424 (1991) · Zbl 0796.68053
[3] Gelfond, M.; Lifschitz, V., Classical Negation in Logic Programs and Disjunctive Databases, NGC, 9, 365-385 (1991) · Zbl 0735.68012
[4] Baral, C., Knowledge Representation, Reasoning and Declarative Problem Solving (2003), Cambridge: Cambridge University Press, Cambridge · Zbl 1056.68139
[5] Pearce, D.; Sarsakov, V.; Schaub, T.; Tompits, H.; Woltran, S.; Stuckey, P. J., A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report, Logic Programming, 405-420 (2002), Heidelberg: Springer, Heidelberg · Zbl 1045.68519 · doi:10.1007/3-540-45619-8_28
[6] Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; Scarcello, F., The DLV System for Knowledge Representation and Reasoning, ACM TOCL, 7, 3, 499-562 (2006) · Zbl 1367.68308 · doi:10.1145/1149114.1149117
[7] Janhunen, T.; Niemelä, I.; Lifschitz, V.; Niemelä, I., Gnt - a solver for disjunctive logic programs, Logic Programming and Nonmonotonic Reasoning, 331-335 (2003), Heidelberg: Springer, Heidelberg · Zbl 1122.68372
[8] Lierler, Y.; Baral, C.; Greco, G.; Leone, N.; Terracina, G., Disjunctive Answer Set Programming via Satisfiability, Logic Programming and Nonmonotonic Reasoning, 447-451 (2005), Heidelberg: Springer, Heidelberg · doi:10.1007/11546207_44
[9] Bertossi, L. E., Consistent query answering in databases, SIGMOD Record, 35, 2, 68-76 (2006) · doi:10.1145/1147376.1147391
[10] Stewart, I. A., Complete problems involving boolean labelled structures and projection transactions, Journal of Logic and Computation, 1, 6, 861-882 (1991) · Zbl 0744.03040 · doi:10.1093/logcom/1.6.861
[11] Eiter, T.; Gottlob, G.; Mannila, H., Disjunctive Datalog, ACM TODS, 22, 3, 364-418 (1997) · doi:10.1145/261124.261126
[12] Faber, W.; Leone, N.; Pfeifer, G.; Alferes, J. J.; Leite, J. A., Recursive aggregates in disjunctive logic programs: Semantics and complexity, Logics in Artificial Intelligence, 200-212 (2004), Heidelberg: Springer, Heidelberg · Zbl 1111.68380
[13] Plaisted, D. A.; Greenbaum, S., A Structure-Preserving Clause Form Translation, Journal of Symbolic Computation, 2, 3, 293-304 (1986) · Zbl 0636.68119 · doi:10.1016/S0747-7171(86)80028-1
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.