Logic programs with monotone cardinality atoms

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2923, Issue , 2004, Pages 154-166

  Marek, Victor W ^a   Niemelä, Ilkka ^b   Truszczyński, Miroslaw ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; CONSTRAINT THEORY; KNOWLEDGE REPRESENTATION; SEMANTICS; ATOMS; INTEGER PROGRAMMING;

LOGIC PROGRAMS; STABLE-MODEL SEMANTICS; SYNTACTIC MODIFICATIONS;

LOGIC PROGRAMMING;

CARDINALITIES; DISJUNCTIVE LOGIC PROGRAMMING; FINITE SET; LOGIC PROGRAMS; NON-DETERMINISM; NONNEGATIVE INTEGERS; OPERATIONAL CONCEPTS; STABLE MODEL;

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

References (15)

1. Y. Babovich and V. Lifschitz. Cmodels, 2002. http://www.cs.utexas.edu/users/tag/cmodels.html.
2. M. Denecker, V. Marek, and M. Truszczyński. Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In J. Minker, editor, Logic-Based Artificial Intelligence, pages 127-144. Kluwer Academic Publishers, 2000.
3. M. Denecker, V. Marek, and M. Truszczyński. Ultimate approximations in nonmonotonic knowledge representation systems. In Principles of Knowledge Representation and Reasoning, Proceedings of the Eighth International Conference (KR2002), pages 177-188. Morgan Kaufmann Publishers, 2002.
4. D. East and M. Truszczyński. Propositional satisfiability in answer-set programming. In Proceedings of Joint German/Austrian Conference on Artificial Intelligence, KI'2001, volume 2174, pages 138-153. Lecture Notes in Artificial Intelligence, Springer Verlag, 2001.
5. E. Erdem and V. Lifschitz. Tight logic programs. Theory and Practice of Logic Programming, 3(4-5):499-518, 2003.
6. F. Fages. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
7. M. C. Fitting. Fixpoint semantics for logic programming - a survey. Theoretical Computer Science, 278:25-51, 2002.
8. M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070-1080. MIT Press, 1988.
9. L. Liu and M. Truszczyński. Local-search techniques in propositional logic extended with cardinality atoms. In Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming, CP-2003. Lecture Notes in Computer Science, Springer Verlag, 2003.
10. I. Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In Proceedings of JICSLP-96. MIT Press, 1996.
11. I. Niemelä and P. Simons. Extending the smodels system with cardinality and weight constraints. In J. Minker, editor, Logic-Based Artificial Intelligence, pages 491-521. Kluwer Academic Publishers, 2000.
12. I. Niemelä, P. Simons, and T. Soininen. Stable model semantics of weight constraint rules. In Proceedings of LPNMR-1999, volume 1730 of Lecture Notes in Computer Science, pages 317-331. Springer-Verlag, 1999.
13. T.C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445-464, 1990.
14. C. Sakama and K. Inoue. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning, 13:145-172, 1984.
15. P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138:181-234, 2002.