Logic programs with abstract constraint atoms

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 86-91

  Marek, Victor W ^a   Truszczyński, Miroslław ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL TOOLS; CONSTRAINT ATOMS; LOGIC PROGRAMS; STABLE MODELS;

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS;

LOGIC PROGRAMMING;

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

References (23)

1. Aloul, F.; Ramani, A.; Markov, I.; and Sakallah, K. 2002. PBS: a backtrack-search pseudo-boolean solver and optimizer. SAT02, 346 - 353.
2. Apt, K. 1990. Logic programming. Handbook of theoretical computer science. 493-574.
3. Babovich, Y., and Lifschitz, V. 2002. Cmodels package. http://www.es.utexas.edu/users/tag/cmodels.html.
4. Baral, C. 2003. Knowledge representation, reasoning and declarative problem solving.
5. Clark, K. 1978. Negation as failure. Logic and data bases, 293-322.
6. Dell' Armi, T.; Faber, W.; Ielpa, G.; Leone, N.; and Pfeifer, G. 2003. Aggregate functions in disjunctive logic programming: semantics, complexity, and implementation in DLV. IJCAI 2003.
7. Denecker, M.; Marek, V.; and Truszczyński, M. 2000. Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. Logic-Based Artificial Intelligence, 127-144.
8. Denecker, M.; Pelov, N.; and Bruynooghe, M. 2001. Ultimate well-founded and stable semantics for logic programs with aggregates. ICLP 2001, 212-226.
9. Dixon, H., and Ginsberg, M. 2002. Inference methods for a pseudo-boolean satisfiability solver. AAAI-2002, 635-641.
10. Ferraris, P., and Lifschitz, V. 2004. Weight constraints and nested expressions. Theory and Practice of Logic Programming, (forthcoming).
11. Fitting, M. C. 2002. Fixpoint semantics for logic programming - a survey. Theoretical Computer Science 278:25-51.
12. Gelfond, M., and Leone, N. 2002. Logic programming and knowledge representation - the A-prolog perspective. Artificial Intelligence 138:3-38.
13. Gelfond, M., and Lifschitz, V. 1988. The stable semantics for logic programs. ICLP 1988, 1070-1080.
14. Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; and Scarcello, F. 2003. The dlv system for knowledge representation and reasoning, http : / /xxx.lanl.gov/abs/cs.AI/0211004.
15. Lin, F., and Zhao, Y. 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. AAAI-2002, 112-117.
16. Marek, V.; Niemelä, I.; and Truszczyński, M. 2004. Characterizing stable models of logic programs with cardinality constraints. LPNMR7, 154-166.
17. Niemel̈, I., and Simons, P. 1997. Smodels - an implementation of the stable model and well-founded semantics for normal logic programs. In LPNMR4, 420-429.
18. Pelov, N.; Denecker, M.; and Bruynooghe, M. 2004. Partial stable models for logic programs with aggregates. LP-NMR7, 207-219.
19. Prestwich, S. 2002. Randomised backtracking for linear pseudo-boolean constraint problems. CPAIOR-02, 7-20.
20. Przymusinski, T. 1990. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae 13 (4): 445-464.
21. Simons, P.; Niemelä, I.; and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138:181-234.
22. Turner, H. 2003. Strong equivalence made easy: Nested expressions and weight constraints. Theory and Practice of Logic Programming 3, (4&5): 609-622.
23. van Emden, M., and Kowalski, R. 1976. The semantics of predicate logic as a programming language. Journal of the ACM 23(4):733-742.