DLVMC: Enhanced model checking in DLV

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

Volumn 6341 LNAI, Issue , 2010, Pages 365-368

  Maratea, Marco ^b   Ricca, Francesco ^a   Veltri, Pierfrancesco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; EFFICIENT STRATEGY; SAT SOLVERS; SEARCH SPACES; STABLE MODEL;

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTER PROGRAMMING; FORMAL LOGIC; LOGIC PROGRAMMING;

MODEL CHECKING;

EID: 78049362345     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15675-5_33     Document Type: Conference Paper

References (16)

1. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: ICLP/SLP 1988, pp. 1070-1080. MIT Press, Cambridge (1988)
2. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. NGC 9, 365-385 (1991)
3. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2003)
4. Lifschitz, V.: Action Languages, Answer Sets and Planning. In: The Logic Programming Paradigm - A 25-Year Perspective, pp. 357-373 (1999)
5. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL 7(3), 499-562 (2006) (Pubitemid 44330485)
6. Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.H.: Unfolding Partiality and Disjunctions in Stable Model Semantics. ACM TOCL 7(1), 1-37 (2006) (Pubitemid 43924967)
7. Lierler, Y.: Disjunctive Answer Set Programming via Satisfiability. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 447-451. Springer, Heidelberg (2005)
8. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: IJCAI 2007, pp. 386-392 (2007)
9. Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communications of the ACM 5, 394-397 (1962)
10. Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. AMAI 12, 53-87 (1994)
11. Koch, C., Leone, N., Pfeifer, G.: Enhancing Disjunctive Logic Programming Systems by SAT Checkers. AI 15(1-2), 177-212 (2003)
12. Leone, N., Rullo, P., Scarcello, F.: Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation. Inf.Comp. 135(2), 69-112 (1997)
13. Pfeifer, G.: Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 220-233. Springer, Heidelberg (2003)
14. Janhunen, T., Niemelä, I., Simons, P., You, J.H.: Partiality and Disjunctions in Stable Model Semantics. In: KR 2000, vol. 12, 15, pp. 411-419 (2000)
15. Giunchiglia, E., Maratea, M.: Solving optimization problems with DLL. In: Proc. of the 17th European Conference on Artificial Intelligence (ECAI 2006). Frontiers in Artificial Intelligence and Applications, vol. 141, pp. 377-381. IOS Press, Amsterdam (2006)
16. Järvisalo, M., Junttila, T.A., Niemelä, I.: Unrestricted vs restricted cut in a tableau method for boolean circuits. Annals of Mathemathics and Artificial Intelligence 44(4), 373-399 (2005)