Abstract
We study logic programs with arbitrary abstract constraint atoms, called c-atoms. As a theoretical means to analyze program properties, we investigate the possibility of unfolding these programs to logic programs composed of ordinary atoms. This approach reveals some structural properties of a program with c-atoms, and enables characterization of these properties based on the known properties of the transformed program. Furthermore, this approach leads to a straightforward definition of answer sets for disjunctive programs with c-atoms, where a c-atom may appear in the head of a rule as well as in the body. We also study the complexities for various classes of logic programs with c-atoms.
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
Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Annals of Math. and Artificial Intelligence 14, 53–87 (1994)
Calimeri, F., et al.: Declarative and computational properties of logic programs with aggregates. In: Proc. IJCAI’05, pp. 406–411 (2005)
Dell’Armi, T., et al.: Aggregate functions in disjunctive logic programming: semantics, complexity, and implementation in DLV. In: Proc. IJCAI’03, pp. 847–852 (2003)
Bruynooghe, M., Denecker, M., Pelov, N.: Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 212–226. Springer, Heidelberg (2001)
Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200–212. Springer, Heidelberg (2004)
Fages, F.: Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)
Gelfond, M.: Representing Knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, Springer, Heidelberg (2002)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. 5th ICLP, pp. 1070–1080. MIT Press, Cambridge (1988)
Gelfond, M., Lifschitz, V.: Classic negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Liu, L., Truszczyński, M.: Properties of programs with monotone and convex constraints. In: Proc. AAAI ’05, pp. 701–706 (2005)
Liu, L., Truszczyński, M.: Properties and applications of programs with monotone and convex constraints. Journal of Artificial Intelligence Research 7, 299–334 (2006)
Marek, V., Niemelä, I., Truszczyński, M.: Logic programs with monotone abstract constraint atoms. Theory and Practice of Logic Programming, To appear.
Marek, V., Truszczyński, M.: Logic programs with abstract constraint atoms. In: Proc. AAAI ’04, pp. 86–91 (2004)
Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: Proc. AAAI’90, pp. 25–32 (1990)
Pelov, N.: Semantics of Logic Programs with Aggregates. PhD thesis, Ketholieke Universiteit Leuven (2004)
Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming, To appear.
Pelov, N., Truszczyński, M.: Semantics of disjunctive programs with monotone aggregates an operator-based approach. In: Proc. NMR ’04, pp. 327–334 (2004)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2) (2002)
Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. Theory and Practice of Logic Programming, To appear.
Son, T.C., Pontelli, E., Elkabani, I.: A translational semantics for aggregates in logic programs. Technical Report CS-2005-006, New Mexico State University (2005)
Son, T.C., Pontelli, E., Tu, P.: Answer sets for logic programs with arbitrary abstract constraint atoms. In: Proc. AAAI’06, pp. 129–134 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
You, JH., Yuan, L.Y., Liu, G., Shen, YD. (2007). Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities. In: Baral, C., Brewka, G., Schlipf, J. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2007. Lecture Notes in Computer Science(), vol 4483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72200-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72199-4
Online ISBN: 978-3-540-72200-7
eBook Packages: Computer ScienceComputer Science (R0)