DATALOG with Constraints - An Answer-set Programming System

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 163-168

  East, Deborah ^a   Truszczyński, Mirosław ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

constraint saitsfaction; knowledge representation; logic programming; nonmonotonic reasoning; search

Indexed keywords

COMPUTER CIRCUITS; CONSTRAINT SATISFACTION PROBLEMS; KNOWLEDGE REPRESENTATION; SEARCH ENGINES;

ANSWER SET PROGRAMMING; CONSTRAINT SAITSFACTION; KNOWLEDGE-REPRESENTATION; LOGIC-PROGRAMMING; NON-MONOTONIC REASONING; PROGRAMMING SYSTEM; PROPOSITIONAL LOGIC; SEARCH; SEARCH PROBLEM; SIMPLE++;

SEMANTICS;

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

References (17)

1. Cadoli, M.; Eiter, T.; and Gottlob, G. 1997. Default logic as a query language. IEEE Transactions on Knowledge and Data Engineering 9(3):448-463.
2. Cholewiński, P.; Marek, W.; Mikitiuk, A.; and Truszczyński, M. 1999. Computing with default logic. Artificial Intelligence 112:105-146.
3. Cholewiński, P.; Marek, W.; and Truszczyński, M. 1997. Default reasoning system deres. In Proceedings of KR-96, 512-528. Morgan Kaufman.
4. Dubois, O.; Andre, P.; Boufkhad, Y.; and Carlier, J. 1996. Sat versus unsat. DIMACS Cliques, Coloring and Satisfiability 26.
5. Eiter, T., and Gottlob, G. 1995. Computing with default logic. Annals of Mathematics and Artificial Intelligence 15(3-4):289-323.
6. Eiter, T.; Leone, N.; Mateis, C.; Pfeifer, G.; and Scarcello, F. 1998. A kr system dlv: Progress report, comparisons and benchmarks. In Proceedings of Sixth International Conference on Knowledge Representation and Reasoning (KR'98), 406-417. Morgan Kaufman.
7. Janhunen, T.; Niemelä, I.; Simons, P.; and You, J. 2000. Unfolding partiality and disjunctions in stable models semantics. manuscript.
8. Kautz, H. A., and Selman, B. 1992. Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence.
9. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proccedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96).
10. Kautz, H.; McAllester, D.; and Selman, B. 1996. Encoding plans in propositional logic. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR-96).
11. Lifschitz, V. 1999a. Action languages, answer sets, and planning. In Apt, K.; Marek, W.; Truszczyński, M.; and Warren, D., eds., The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag. 357-373.
12. Lifschitz, V. 1999b. Answer set planning. In Proceedings of the 1999 International Conference on Logic Programming, 23-37. MIT Press.
13. Marek, V., and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In Apt, K.; Marek, W.; Truszczyński, M.; and Warren, D., eds., The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag. 375-398.
14. Niemela, I., and Simons, P. 1996. Efficient implementation of the well-founded and stable model semantics. In Proceedings of JICSLP-96. MIT Press.
15. Niemela, I. 1998. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, 72-79.
16. Schlipf, J. 1995. The expressive powers of the logic programming semantics. Journal of the Computer Systems and Science 51(1):64-86.
17. Simons, P. 1999. Extending the stable model semantics with more expressive rules. In Gelfond, M.; Leone, N.; and Pfeifer, G., eds., Proceedings of 5th International Conference, LPNMR'99, volume 1730 of Lecture Notes in Artificial Intelligence, 305-316. Springer Verlag.