Towards local search for answer sets

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

Volumn 2401 LNCS, Issue , 2002, Pages 363-377

  Dimopoulos, Yannis ^a   Sideris, Andreas ^a  

^a UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; HEURISTIC METHODS; HEURISTIC PROGRAMMING; LOCAL SEARCH (OPTIMIZATION); SEMANTICS; ALGORITHMS; COMPUTATION THEORY; COMPUTER PROGRAMMING; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

ANSWER SET PROGRAMMING; DECLARATIVE PROBLEM SOLVING; HARD COMPUTATIONAL PROBLEM; LOCAL SEARCH ALGORITHM; PROPOSITIONAL SATISFIABILITY; PROPOSITIONAL SATISFIABILITY PROBLEMS; STABLE MODEL SEMANTICS; SYSTEMATIC SEARCHES;

LOGIC PROGRAMMING; PROBLEM SOLVING;

EID: 84888252417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45619-8_25     Document Type: Conference Paper

References (23)

1. A. Bertoni, G. Grossi, A. Provetti, V. Kreinovich, and L. Tari. The prospect for answer sets computation by a genetic model. In Proc. of the AAAI Spring 2001 Symposium on Answer Set Programming. http://www.cs.nmsu.edu/tson/ ASP2001/2001.
2. T. Dell'Armi, W. Faber, G. Ielpa, C. Koch, N. Leone, S. Perri, and G. Pfeifer. System description: DLV. In Proc. of the 6th Intern. Conf. on Logic Programming and Nonmonotonic Reasoning, LPNMR-01, LNCS 2173, pages 424-428. Springer Verlag, 2001.
3. Y. Dimopoulos, B. Nebel, and J. Koehler. Encoding planning problems in nonmonotonic logic programs. In Proc. of the 4th European Conference on Planning, ECP'97, LNCS 1348, pages 169-181. Springer Verlag, 1997.
4. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. The diagnosis frontend of the dlv system. AI Communications, 12(1/2):99-111, 1999.
5. J. Frank. Learning short-term weights for GSAT. In Proc. 15h Intern. Joint Conference on AI, IJCAI-97, pages 384-391, 1997.
6. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th Intern. Conf. and Symp. on Logic Programming, ICSLP-88, pages 1070-1080, 1988.
7. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9(3/4):365-386, 1991.
8. C. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proc. of the 15th National Conference on AI, AAAI-98, pages 431-437, 1998.
9. K. Heljanko and I. Niemela. Bounded LTL model checking with stable models. In Proc. of the 6th Intern. Conf. on Logic Programming and Nonmonotonic Reasoning, LPNMR'01, LNCS 2173, pages 200-212. Springer Verlag, 2001.
10. H. Hoos and T. Stutzle. Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning, 24(4):421-481, 2000.
11. N. Jussien and O. Lhomme. Local search with constraint propagation and conflictbased heuristics. In Proc. of the 17th National Conference on AI, AAAI-00, pages 169-174, 2000.
12. N. Leone, S. Perri, and P. Rullo. Local search techniques for disjunctive logic programs. In 6th Congress of the Italian Association for Artificial Intelligence, AIIA 99, LNCS 1792, pages 107-118. Springer Verlag, 2000.
13. B. Mazure, L. Sais, and E. Gregoire. Tabu search for SAT. In Proc. of the 14th National Conference on AI, AAAI-97, pages 281-285, 1997.
14. D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In Proc. of the 14th National Conference on AI, AAAI-97, pages 321-326, 1997.
15. P. Nicolas, F. Saubion, and I. Stephan. GADEL: A genetic algorithm to compute default logic extensions. In Proc. of the 14th European Conference on AI, ECAI'00, pages 484-488. IOS Press, 2000.
16. P. Nicolas, F. Saubion, and I. Stephan. New generation systems for non-monotonic reasoning. In Proc. of the 6th Intern. Conf. on Logic Programming and Nonmonotonic Reasoning, LPNMR'01, LNCS 2173, pages 309-321. Springer Verlag, 2001.
17. D. Schuurmans and F. Southey. Local search characteristics of incomplete SAT procedures. In Proc. of the 17th National Conference on AI, AAAI-00, pages 297-302, 2000.
18. B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proc. of the 12th National Conference on AI, AAAI-94, pages 337-343, 1994.
19. B. Selman, H. Levesque, and D. Mithcell. A new method for solving hard satisfiability porblems. In Proc. of the 10th National Conference on AI, AAAI-92, pages 440-446, 1992.
20. P. Simons. Extending the stable model semantics with more expressive rules. In Proc. of the 5th Intern. Conf. on Logic Programming and Nonmonotonic Reasoning, LPNMR-99, LNCS 1730, pages 305-316. Springer Verlag, 1999.
21. P. Simons. Extending and implementing the stable model semantics. Ph.D. Thesis, Research Report 58, Helsinki University of Technology, 2000.
22. T. Surjanen and I. Niemela. The Smodels system. In Proc. of the 6th Intern. Conf. on Logic Programming and Nonmonotonic Reasoning, LPNMR-01, LNCS 2173, pages 434-438. Springer Verlag, 2001.
23. A. Van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.