Abstract
We study an extension of disjunctive logic programs called set constraint disjunctive (SCD) programs where the clauses of the program are allowed to have a disjunction of monotone set constraints in their head and arbitrary monotone and antimonotone set constraints in their body. We introduce new class of models called selector stable models which represent all models which can be computed by an analogue the Gelfond-Lifschitz transform. We show that the stable models of disjunctive logic programs can be defined in terms of selector stable models and then extend this result to SCD logic programs. Finally we show that there is a natural proof theory associated with selector stable models.
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. Cambridge University Press (2003)
Brik, A., Remmel, J.B.: Computing Stable Models of Logic Programs Using Metropolis Type Algorithms. In: Proceedings of Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2011, paper no. 6, 15 pgs (2011)
Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Ann. Math. Artif. Intell. 15, 289–323 (1995)
Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative Problem-solving in DLV. In: Minker, J. (ed.) Logic-based Artificial Intelligence, pp. 79–103 (2000)
Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theor. Pract. Logic Prog. 5, 45–74 (2005)
Gelfond, M., Lifschitz, V.: The stable semantics for logic programs. In: Proceedings 5th Int’l. Symp. Logic Programming, pp. 1070–1080. MIT Press (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gen. Comput. 9, 365–385 (1991)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2, 526–541 (2001)
Liu, L., Truszczynski, M.: Properties and Applications of Programs with Monotone and Convex Constraints. J. Artif. Intell. Res. 27, 299–334 (2006)
Liu, L., Pontelli, E., Son, T.C., Truszczynski, M.: Logic Programs with Abstract Constraint Atoms – the Role of Computations. Artif. Intell. 174, 295–315 (2010)
Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. MIT Press (1992)
Marek, V.W.: Introduction to Mathematics of Satisfiability. CRC Press (2009)
Marek, V.W., Remmel, J.B.: Set Constraints in Logic Programming. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 167–179. Springer, Heidelberg (2003)
Marek, V.W., Remmel, J.B.: Effective Set Constraints (in preparation)
Marek, W., Nerode, A., Remmel, J.B.: Nonmonotonic rule systems I. Ann. Math. Artif. Intell. 1, 241–273 (1990)
Marek, W., Nerode, A., Remmel, J.B.: Logic Programs, Well-orderings, and Forward Chaining. Ann. Pure App. Logic 96, 231–276 (1999)
Minker, J.: Overview of Disjunctive Logic Programming. Ann. Math. Artif. Intell. 12, 1–24 (1994)
Niemelä, I., Simons, P., Soininen, T.: Stable Model Semantics of Weight Constraint Rules. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 317–331. Springer, Heidelberg (1999)
Son, T.C., Pontelli, E., Tu, P.H.: Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms. J. Artif. Intell. Res. 29, 353–389 (2007)
van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23, 733–742 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Marek, V.W., Remmel, J.B. (2012). Disjunctive Programs with Set Constraints. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds) Correct Reasoning. Lecture Notes in Computer Science, vol 7265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30743-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-30743-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30742-3
Online ISBN: 978-3-642-30743-0
eBook Packages: Computer ScienceComputer Science (R0)