Properties of programs with monotone and convex constraints

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2005, Pages 701-706

  Liu, Lengning ^a   Truszczyński, Miroslaw ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; LOGIC PROGRAMMING; MATHEMATICAL MODELS;

LOOP FORMULAS; NORMAL LOGIC PROGRAMMING;

ARTIFICIAL INTELLIGENCE;

EID: 29344471290     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Y. Babovich and V. Lifschitz. Cmodels package, 2002. http://www.cs. utexas.edu/users/tag/cmodels.html.
2. Babovich, Y.; Erdem, E.; and Lifschitz, V. 2000. Pages' theorem and answer set programming, In: Proceedings of NMR-2000. http://xxx.lanl.gov/html/ cs.AI/0003073.
3. C. Baral. Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, 2003.
4. K. Clark 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and data bases. New York-London: Plenum Press.
5. T. Dell'Armi, W. Faber, G. Ielpa, N. Leone, and G. Pfeifer. Aggregate functions in disjunctive logic programming: semantics, complexity, and implementation in DLV. In Proc. of IJCAI-2003, pages 847-852. Morgan Kaufmann, 2003.
6. M. Denecker, N. Pelov, and M. Bruynooghe. Ultimate well-founded and stable semantics for logic programs with aggregates. In Proc. of ICLP-2001, vol. 2237 of LNCS, pages 212-226. Springer, 2001.
7. N. Eén and N. Sörensson". An extensible SAT solver. In Proc. of SAT-2003, vol. 2919 of LNCS, pages 502-518, Springer, 2003.
8. T. Eiter and M. Fink. Uniform equivalence of logic programs under the stable model semantics. In Proc. of ICLP-2003, vol. 2916 of LNCS, pages 224-238. Springer, 2003.
9. E. Erdem and V. Lifschitz. Tight logic programs. Theory and Practice of Logic Programming, 3(4-5):499-518, 2003.
10. W. Faber, N. Leone and G. Pfeifer. Recursive aggregates in disjunctive logic programs: semantics and complexity. Proceedings of JELIA-2004, vol. 3229 of LNAI, pages 200-212, Springer, 2004.
11. F. Pages. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
12. M. Gelfond and N. Leone. Logic programming and knowledge representation - the A-prolog perspective. Artificial Intelligence, 138:3-38, 2002.
13. M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In Proc. of ICLP-1988, pages 1070-1080. MIT Press, 1988.
14. V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Trans. on Computational Logic, 2(4):526-541, 2001.
15. F. Lin and Y. Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proceedings of AAAI-2002, pages 112-117. AAAI Press, 2002.
16. F. Lin. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In Proc. of KR-2002, Morgan Kaufmann, 2002.
17. V.W. Marek and M. Truszczyński. Logic programs with abstract constraint atoms. In Proc. of AAAI-04, pages 86-91. AAAI Press, 2004.
18. V.W. Marek, I. Niemelä, and M. Truszczyński. Characterizing stable models of logic programs with cardinality constraints. In Proc. of LPNMR-2004, vol. 2923 of LNAI, pages 154-166. Springer, 2004.
19. N. Pelov. Semantics of logic programs with aggregates. Ph.D. Thesis. Department of Computer Science, K.U.Leuven, Leuven, Belgium, 2004.
20. N. Pelov, M. Denecker, and M. Bruynooghe. Partial stable models for logic programs with aggregates. In Proc. of LPNMR-2004, vol. 2923 of LNAI, pages 207-219. Springer, 2004.
21. P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138:181-234, 2002.
22. H. Turner. Strong equivalence made easy: Nested expressions and weight constraints. Theory and Practice of Logic Programming, 3, (4&5):609-622, 2003.