Improving ASP instantiators by join-ordering methods

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

Volumn 2173 LNAI, Issue , 2001, Pages 280-294

  Leone, Nicola ^a   Perri, Simona ^a   Scarcello, Francesco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; BENCH-MARK PROBLEMS; DIFFERENT DOMAINS; INPUT PROGRAMS; INSTANTIATION PROCESS; SMODELS;

EXPERIMENTS;

LOGIC PROGRAMMING;

EID: 84867817614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_21     Document Type: Conference Paper

References (20)

1. D. East and M. Truszczyński. dcs: An implementation of DATALOG with Constraints. In C. Baral and M. Truszczyński, editors, Proc. of NMR'2000, Colorado, USA, 2000.
2. U. Egly, T. Eiter, H. Tompits, and S. Woltran. Solving Advanced Reasoning Tasks using Quantified Boolean Formulas. In Proc. of AAAI'00, pp. 417-422.
3. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. Declarative Problem-Solving Using the DLV System. In J. Minker, editor, Logic-Based Artificial Intelligence, pp. 79-103. Kluwer Academic Pub., 2000.
4. T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364-418, 1997.
5. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A Deductive System for Nonmonotonic Reasoning. In Proc. of LPNMR'97, LNAI 1265, pp. 363-374, Berlin, 1997, Springer.
6. W. Faber, N. Leone, C. Mateis, and G. Pfeifer. Using Database Optimization Techniques for Nonmonotonic Reasoning. In Proc. of DDLP'99, pp. 135-139. 1999.
7. W. Faber, N. Leone, C. Mateis, and G. Pfeifer. Using Database Optimization Techniques for Nonmonotonic Reasoning. Technical Report DBAI-TR-99-33, Institut für Informationssysteme, Technische Universität Wien, Austria, May 1999.
8. W. Faber and G. Pfeifer. DLV homepage. www.dbai.tuwien.ac.at/proj/dlv/.
9. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database System Implementation. Prentice Hall, 2000.
10. M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
11. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. In Proc. of PODS'99, pp. 21-32, May 1999. To appear in JCSS.
12. V. Lifschitz. Answer set planning. In D. D. Schreye, editor, Proc. of ICLP'99, pp. 23-37, Las Cruces, New Mexico, USA, Nov. 1999. The MIT Press.
13. N. McCain and H. Turner. Satisfiability planning with causal theories. Proc. of KR'98, pp. 212-223. Morgan Kaufmann Pub., 1998.
14. I. Niemelä and P. Simons. Smodels - an implementation of the stable model and well-founded semantics for normal logic programs. In Proc. of LPNMR'97, LNAI 1265, pp. 420-429, Dagstuhl, Germany, July 1997. Springer Verlag.
15. T. C. Przymusinski. Stable Semantics for Disjunctive Programs. New Generation Computing, 9:401-424, 1991.
16. S. Radziszowski. Small Ramsey Numbers. The Electronic Journal of Combinatorics, 1, 1999.
17. P. Rao, K. F. Sagonas, T. Swift, D. S. Warren, and J. Freire. XSB: A System for Efficiently Computing Well-Founded Semantics. In Proc. of LPNMR'97, LNAI 1265, pp. 2-17, Dagstuhl, Germany, July 1997. Springer Verlag.
18. P. Simons. Smodels homepage. .
19. P. Simons. Extending and Implementing the Stable Model Semantics. PhD thesis, Helsinki University of Technology, Finland, 2000.
20. J. D. Ullman. Principles of Database and Knowledge Base Systems. Computer Science Press, 1989.