Abstract
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to transform an arbitrary set of propositional formulas into an equivalent logic program and what are the complexity constraints on this process. We want the transformed program to be equivalent in a strong sense so that theory parts can be transformed independent of the wider context in which they might be embedded. It was only recently established [1] that propositional theories are indeed equivalent (in a strong sense) to logic programs. Here this result is extended with the following contributions. (i) We show how to effectively obtain an equivalent program starting from an arbitrary theory. (ii) We show that in general there is no polynomial time transformation if we require the resulting program to share precisely the vocabulary or signature of the initial theory. (iii) Extending previous work we show how polynomial transformations can be achieved if one allows the resulting program to contain new atoms. The program obtained is still in a strong sense equivalent to the original theory, and the answer sets of the theory can be retrieved from it.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cabalar, P., Ferraris, P.: Propositional Theories are Strongly Equivalent to Logic Programs. Unpublished draft (2005), available at http://www.dc.fi.udc.es/cabalar/pt2lp.pdf
van Dalen, D.: Intuitionistic logic. In: Handbook of Philosophical Logic. Alternatives in Classical Logic, vol. III. Kluwer, Dordrecht (1986)
Dung, P.M.: Declarative Semantics of Hypothetical Logic Programing with Negation as Failure. In: Proceedings ELP 1992, vol. 99, pp. 45–58 (1992)
Faber, W., Leone, N., Pfeifer, G.: Recursive Aggregates in Disjunctive Logic Programs: semantics and Complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200–212. Springer, Heidelberg (2004)
Ferraris, P.: Answer Sets for Propositional Theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 119–131. Springer, Heidelberg (2005)
Ferraris, P., Lifschitz, V.: Weight Constraints as Nested Expressions. In: Theory and Practice of Logic Programming (to appear)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Giordano, L., Olivetti, N.: Combining Negation-as-Failure and Embedded Implications in Logic Programs. Journal of Logic Programming 36, 91–147 (1998)
Hähnle, R.: Complexity of Many-Valued Logics. In: Proc. 31st International Symposium on Multiple-Valued Logics, pp. 137–146. IEEE CS Press, Los Alamitos (2001)
Janhunen, T., Niemelä, I., Simons, P., You, J.-H.: Unfolding Partiality and Disjunctions in Stable Model Semantics. In: Cohn, A.G., Giunchiglia, F., Selman, B. (eds.) Principles of Knowledge Representation and Reasoning (KR 2000), pp. 411–424. Morgan Kaufmann, San Francisco (2000)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv System for Knowledge Representation and Reasoning. CoRR: cs.AI/0211004 (September 2003)
Lifschitz, V., Tang, L.R., Turner, H.: Nested Expressions in Logic Programs. Annals of Mathematics and Artificial Intelligence 25, 369–389 (1999)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)
Mints, G.: Resolution Strategies for the Intuitionistic Logic. In: Mayoh, B., Tyugu, E., Penjaam, J. (eds.) Constraint Programming. NATO ASI Series, pp. 282–304. Springer, Heidelberg (1994)
Osorio, M., Navarro Pérez, J.A., Arrazola, J.: Safe Beliefs for Propositional Theories. Ann. Pure & Applied Logic (in press)
Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., Woltran, S.: Polynomial Translations of Nested Logic Programs into Disjunctive Logic Programs. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 405–420. Springer, Heidelberg (2002)
Pearce, D.: A New Logical Characterisation of Stable Models and Answer Sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol. 1216, pp. 57–70. Springer, Heidelberg (1997)
Pearce, D.: From Here to There: stable negation in logic programming. In: Gabbay, D., Wansing, H. (eds.) What is Negation?, pp. 161–181. Kluwer Academic Pub., Dordrecht (1999)
Pearce, D., de Guzmán, I.P., Valverde, A.: A Tableau Calculus for Equilibrium Entailment. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS (LNAI), vol. 1847, pp. 352–367. Springer, Heidelberg (2000)
Pearce, D., de Guzmán, I.P., Valverde, A.: Computing Equilibrium Models using Signed Formulas. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 688–703. Springer, Heidelberg (2000)
Pearce, D., Valverde, A.: Synonymous Theories in Answer Set Programming and Equilibrium Logic. In: López de Mántaras, R., Saitta, L. (eds.) Proceedings ECAI 2004, pp. 388–392. IOS Press, Amsterdam (2004)
Sarsakov, V., Schaub, T., Tompits, H., Woltran, S.: nlp: A Compiler for Nested Logic Programming. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 361–364. Springer, Heidelberg (2003)
Seipel, D.: Using Clausal Deductive Databases for Defining Semantics in Disjunctive Deductive Databases. Annals of Mathematics and Artificial Intelligence 33, 347–378 (2001)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1–2), 181–234 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cabalar, P., Pearce, D., Valverde, A. (2005). Reducing Propositional Theories in Equilibrium Logic to Logic Programs. In: Bento, C., Cardoso, A., Dias, G. (eds) Progress in Artificial Intelligence. EPIA 2005. Lecture Notes in Computer Science(), vol 3808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11595014_2
Download citation
DOI: https://doi.org/10.1007/11595014_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30737-2
Online ISBN: 978-3-540-31646-6
eBook Packages: Computer ScienceComputer Science (R0)