Local search techniques for disjunctive logic programs

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

Volumn 1792, Issue , 2000, Pages 107-118

  Leone, Nicola ^a   Perri, Simona ^b   Rullo, Pasquale ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; COMPUTER CIRCUITS; CONSTRAINT SATISFACTION PROBLEMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; LOCAL SEARCH (OPTIMIZATION); LOGIC PROGRAMMING; POLYNOMIAL APPROXIMATION; RECONFIGURABLE HARDWARE;

COMPUTATIONAL COSTS; DISJUNCTIVE LOGIC PROGRAMS; HEURISTIC APPROACH; HEURISTIC TECHNIQUES; LOCAL SEARCH TECHNIQUES; MINIMAL MODEL; POLYNOMIAL-TIME; SAT PROBLEMS;

C (PROGRAMMING LANGUAGE);

EID: 77952000153     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (10)

1. Ben-Eliyahu, R. and Palopoli, L. (1994), Reasoning with Minimal Models: Efficient Algorithms and Applications, in “Proc. Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94),” pp. 39-50.
2. Cadoli, M. (1992), On the complexity of model finding for nonmonotonic prepositional logics. In A. Marchetti Spaccamela, P. Mentrasti, and M. Venturini Zilli, editors, Proceedings of the Fourth Italian Conference on Theoretical Computer Science, pages 125-139. World Scientific Publishing Co.
3. Chen, Z., and Toda, S., (1995), The complexity of selecting maximal solutions. Information and Computation, 119:231-239.
4. Eiter, T., Gottlob, G., and Mannila, H. (1997), Disjunctive datalog, ACM Trans, on, Database Systems., 22(3):315-363, September 1997.
5. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F. (1998), The KR System dlv: Progress Report, Comparisons and Benchmarks. Proc. KR‘98, pp.406-417.
6. Koch, C., Leone, N., (1999)’’Stable Model Checking Made Easy”, Proceedings of the 16th, International Joint, Conference on, Artificial Intelligence - IJCAI’99, Stockolm, August 1999.
7. Leone, N., Rullo, P., Scarcello, F. (1997), Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation, Information, and Computation, 135(2):69-112.
8. Minker, J. (1982), On Indefinite Data Bases and the Closed World Assumption, in “Proc. of the 6th Conference on Automated Deduction (CADE-82),” pp. 292-308.
9. Selman, B., Kautz, A., Cohen, B. (1993), Local Search Strategies for Satisfiability Testing, in “Second DIMACS Challenge on Cliques, Coloring, and Satisfiability”.
10. Zhang, H. (1997), SATO: An efficient Propositional Prover. Proc. CADE-97.