Prototypes for reasoning with infinite stable models and function symbols

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

Volumn 2173 LNAI, Issue , 2001, Pages 416-419

  Bonatti, Piero A ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (5)

1. P. A. Bonatti. Reasoning with infinite stable models. In Proc. of IJCAI'01, 2001.
2. P. A. Bonatti. Resolution for skeptical stable model semantics. Journal of Automated Reasoning, to appear. Preliminary version in Proc. of LPNMR'97, Springer, 1997.
3. S. Decorte, D. de Schreye, M. Fabris. Exploiting the Power of Typed Norms in Automatic Inference of Interargument Relations. Technical report, Department of Computer Science, K. U. Leuven, Belgium, 1994.
4. I. Niemelä, P. Simons. Smodels - an implementation of the stable model and well-founded semantics for normal LP. In Proc. of LPNMR'97, LNAI 1265, Springer Verlag, Berlin, 1997.
5. Tommi Syrjänen. Omega-Restricted Logic Programs. This book.