Stable model semantics of weight constraint rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1730, Issue , 1999, Pages 317-331

  Niemelä, Ilkka ^a   Simons, Patrik ^a   Soininen, Timo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE; SEMANTICS;

COMBINATORIAL PROBLEM; COMPILATION TECHNIQUES; DECISION PROBLEMS; DECLARATIVE SEMANTICS; PRODUCT CONFIGURATION; RESOURCE CONSTRAINT; STABLE MODEL SEMANTICS; WEIGHT CONSTRAINTS;

LOGIC PROGRAMMING;

EID: 84958675071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46767-X_23     Document Type: Conference Paper

References (16)

1. G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. In Principles of Knowledge Representation and Reasoning Proceedings of the Sixth International Conference, pages 86–97, 1998.
2. F. Buccafurri, N. Leone, and P. Rullo. Strong and weak constraints in disjunctive datalog. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 2–17, 1997.
3. M. Cadoli, L. Palopoli, A. Schaerf, and D. Vasile. NP-SPEC: An executable speci-fication language for solving all problems in NP. In Practical Aspects of Declarative Languages, LNCS 1551, pages 16–30, 1999.
4. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, pages 1070–1080, 1988.
5. S. Greco. Dynamic programming in Datalog with aggregates. IEEE Transactions on Knowledge and Data Engineering, 11(2):265–283, 1999.
6. J. Lu, A. Nerode, and V. Subrahmanian. Hybrid knowledge bases. IEEE Transac-tions on Knowledge and Data Engineering, 8(5):773–785, 1996.
7. W. Marek and M. Truszczyński. Autoepistemic logic. J. ACM, 38:588–619, 1991.
8. W. Marek and M. Truszczyński. Logic programming with costs. Manuscript, available at http://www.cs.engr.uky.edu/˜mirek/papers.html, 1999.
9. W. Marek and M. Truszczyński. Stable models and an alternative logic program-ming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, pages 375–398. Springer-Verlag, 1999.
10. R. Ng and V. Subrahmanian. Stable semantics for probabilistic deductive databases. Information and Computation, 110:42–83, 1994.
11. I. Niemelä. Logic programs with stable model semantics as a constraint pro-gramming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72–79. Available at http://www.tcs.hut.fi/pub/reports/A52abstract.html, 1998. An extended version to be published in An-nals of Mathematics and Artificial Intelligence.
12. I. Niemelä and P. Simons. Efficient implementation of the well-founded and sta-ble model semantics. In Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289–303, 1996.
13. I. Niemelä and P. Simons. Smodels – an implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 420–429, 1997.
14. D. Sabin and R. Weigel. Product configuration frameworks – a survey. IEEE Intelligent Systems & Their Applications, pages 42–49, July/August 1998.
15. P. Simons. Extending the stable model semantics with more expressive rules. In Proceedings of the 5th International Conference on Logic Programming and NonMonotonic Reasoning, 1999.
16. T. Soininen and I. Niemelä. Developing a declarative rule language for applications in product configuration. In Practical Aspects of Declarative Languages, LNCS 1551, pages 305–319, 1999.