Abstract
To ensure a close relation between the answer sets of a program and those of its ground version, some answer set solvers deal with variables by requiring a safety condition on program rules. If we go beyond the syntax of disjunctive programs, for instance by allowing rules with nested expressions, or perhaps even arbitrary first-order formulas, new definitions of safety are required. In this paper we consider a new concept of safety for formulas in quantified equilibrium logic where answer sets can be defined for arbitrary first-order formulas. The new concept captures and generalises two recently proposed safety definitions: that of Lee, Lifschitz and Palla (2008) as well as that of Bria, Faber and Leone (2008). We study the main metalogical properties of safe formulas.
This is a preview of subscription content, log in via an institution to check access.
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
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP, Cambridge (2002)
Bria, A., Faber, W., Leone, N.: Normal Form Nested Programs. In: Hölldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 76–88. Springer, Heidelberg (2008)
de Bruijn, J., Pearce, D., Polleres, A., Valverde, A.: Quantified Equilibrium Logic and Hybrid Rules. In: Marchiori, M., Pan, J.Z., Marie, C.d.S. (eds.) RR 2007. LNCS, vol. 4524, pp. 58–72. Springer, Heidelberg (2007)
Cabalar, P., Pearce, D., Valverde, A.: Reducing Propositional Theories in Equilibrium Logic to Logic Programs. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS (LNAI), vol. 3808, pp. 4–17. Springer, Heidelberg (2005)
Cabalar, P., Pearce, D., Valverde, A.: Safety Preserving Transformations for General Answer Set Programs. In: Logic-Based program Synthesis and Transformation. Proc. LOPSTR 2009 (2009)
van Dalen, D.: Logic and Structure. Springer, Heidelberg (2004)
Ferraris, P., Lee, J., Lifschitz, V.: A New Perspective on Stable Models. In: Veloso, M. (ed.) 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, pp. 372–379 (2007)
Heymans, S., van Nieuwenborgh, D., Vermeir, D.: Open Answer Set Programming with Guarded Programs. ACM Trans. Comp. Logic 9, Article 26 (2008)
Heymans, S., Predoiu, L., Feier, C., de Bruijn, J., van Nieuwenborgh, D.: G-hybrid Knowledge Bases. In: ALPSWS 2006, CEUR Workshop Proceedings, vol. 196 (2006)
Kleene, S.C.: On Notation for Ordinal Numbers. The J. of Symbolic Logic 3(4) (1938)
Lee, J., Lifschitz, V., Palla, R.: A Reductive Semantics for Counting and Choice in Answer Set Programming. In: Proceedings AAAI 2008, pp. 472–479 (2008)
Lee, J., Lifschitz, V., Palla, R.: Safe formulas in the general theory of stable models (Preliminary report). In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 672–676. Springer, Heidelberg (2008); longer version by personal communication (June 2008)
Lee, J., Meng, V.: On Loop Formulas with Variables. In: Proc. of AAAI 2008. AAAI, Menlo Park (2008)
Lee, J., Palla, R.: Yet Another Proof of the Strong Equivalence between Propositional Theories and Logic Programs. In: CENT 2007, Tempe, AZ, May 2007. CEUR Workshop Proceedings, vol. 265, CEUR-WS.org (2007)
Lifschitz, V., Pearce, D., Valverde, A.: A Characterization of Strong Equivalence for Logic Programs with Variables. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 188–200. Springer, Heidelberg (2007)
Lifschitz, V., Tang, L., Turner, H.: Nested Expressions in Logic Programs. Annals of Mathematics and Artificial Intelligence 25(3-4), 369–389 (1999)
Pearce, D., Valverde, A.: Towards a first order equilibrium logic for nonmonotonic reasoning. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 147–160. Springer, Heidelberg (2004)
Pearce, D., Valverde, A.: A First-Order Nonmonotonic Extension of Constructive Logic. Studia Logica 80, 321–346 (2005)
Pearce, D., Valverde, A.: Quantified Equilibrium Logic. Tech. report, Univ. Rey Juan Carlos (2006), http://www.matap.uma.es/investigacion/tr/ma06_02.pdf
Pearce, D., Valverde, A.: Quantified Equilibrium Logic and Foundations for Answer Set Programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 546–560. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cabalar, P., Pearce, D., Valverde, A. (2009). A Revised Concept of Safety for General Answer Set Programs. In: Erdem, E., Lin, F., Schaub, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2009. Lecture Notes in Computer Science(), vol 5753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04238-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-04238-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04237-9
Online ISBN: 978-3-642-04238-6
eBook Packages: Computer ScienceComputer Science (R0)