Weight constraints as nested expressions

Theory and Practice of Logic Programming

Volumn 5, Issue 1-2, 2005, Pages 45-74

  Ferraris, Paolo ^a   Lifschitz, Vladimir ^a  

^a University of Texas at Austin   (United States)

Author keywords

Answer sets; Cardinality constraints; SMODELS; Stable models; Weight constraints

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; FAILURE ANALYSIS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SEMANTICS;

ANSWER SETS; CARDINALITY CONSTRAINTS; NESTED EXPRESSIONS; SMODELS; STABLE MODELS; WEIGHT CONSTRAINTS;

SET THEORY;

EID: 14544284052     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068403001923     Document Type: Article

References (16)

1. 9 Proceedings Eighth International Workshop on Non-Monotonie Reasoning.
2. BIBEL, W. AND EDER, E. 1993. A survey of logical calculi. In: D. M. Gabbay, C. J. Hogger and J. A. Robinson (eds) The Handbook of Logic in AI and Logic Programming, vol. 1, pp. 67-182. Oxford University Press.
3. CLARK, K. 1978. Negation as failure. In: H. Gallaire and J. Minker (eds) Logic and Data Bases, pp. 293-322. Plenum Press.
4. ERDEM, E. AND LIFSCHITZ, V. 2003. Tight logic programs. Theory and Practice of Logic Programming. To appear.
5. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In: R. Kowalski and K. Bowen (eds) Logic Programming: Proceedings Fifth International Conference and Symposium, pp. 1070-1080.
6. HEYTING, A. 1930. Die formalen Regeln der intuitionistischen Logik. Sitz. Berlin, pp. 42-56.
7. LIFSCHITZ, V. AND Woo, T. 1992. Answer sets in general nonmonotonic reasoning (preliminary report). In: B. Nebel, C. Rich and W. Swartout (eds) Proc. Third International Conference on Principles of Knowledge Representation and Reasoning, pp. 603-614.
8. LIFSCHITZ, V., TANG, L. R. AND TURNER, H. 1999. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25, 369-389.
9. LIFSCHITZ, V., PEARCE, D. AND VALVERDE, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2, 526-541.
10. LLOYD, J. AND TOPOR, R. 1984, Making Prolog more expressive, Journal of Logic Programming, 3, 225-240.
11. MAREK, V. AND REMMEL, J. 2002. On logic programs with cardinality constraints. Proceedings NMR-02.
12. NIEMELÄ, I. AND SIMONS, P. 2000. Extending the Smodels system with cardinality and weight constraints. In: J. Minker (ed) Logic-Based Artificial Intelligence, pp. 491-521. Kluwcr.
13. PEARCE, D., SCHAUB, T., SARSAKOV, V., TOMPITS, H. AND WOLTRAN, S. 2002. A polynomial translation of logic programs with nested expressions into disjunctive logic programs. Proceedings NMR-02.
14. PEARCE, D. 1997. A new logical characterization of stable models and answer sets. In: J. Dix, L. Pereira and T. Przymusinski (eds) Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pp. 57-70. Springer-Verlag.
15. SIMONS, P., NIEMELÄ, I. AND SOININEN, T. 2002. Extending and implementing the stable model semantics. AI Journal, 138, 181-234.
16. TURNER, H. 2003. Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming. To appear.