Generality and equivalence relations in default logic

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 434-439

  Inoue, Katsumi ^a   Sakama, Chiaki ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b WAKAYAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; MULTI AGENT SYSTEMS; SET THEORY;

CREDULOUS CONSEQUENCES; DEFAULT THEORIES;

LOGIC PROGRAMMING;

EID: 36348949110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Antoniou, G. and Kehagias, K. 2000. A note on the refinement of ontologies. International Journal of Intelligent Systems, 15:623-632.
2. Baader, F. and Hollunder, B. 1995. Embedding defaults into terminological knowledge representation formalisms. Journal of Automated Reasoning, 14:149-180.
3. Eiter, T., Lukasiewicz, T., Schindlauer, R. and Tompits, H. 2004. Combining answer set programming with description logics for the semantic web, In: Proceedings of KR '04, 141-151, AAAI Press.
4. Eiter, T., Tompits, H. and Woltran, S. 2005. On solution correspondences in answer-set programming. In: Proceedings of IJCAI-05, 97-102.
5. Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385,
6. Gelfond, M., Lifschitz, V., Przymusińska, H. and Truszczyński, M. 1991. Disjunctive defaults. In: Proceedings of KR '91, 230-237, Morgan Kaufmann.
7. Ghilardi, S., Lutz, C. and Wolter, F. 2006. Did I damage my ontology? A case for conservative extensions in description logics. In: Proceedings of KR '06, 187-197.
8. Gunter, C. A. and Scott, D. S. 1990. Semantic domains. In: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, 633-674, North-Holland.
9. Inoue, K. and Sakama, C. 2006, Generality relations in answer set programming. Proceedings of ICLP '06, LNCS, 4079, 211-225, Springer.
10. Lifschitz, V., Pearce, D. and Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541.
11. Nibleti, T. 1988. A study of generalization in logic programs. In: Proceedings of EWSL-88, 131-138, Pitman.
12. Nienhuys-Cheng, S.-H. and de Wolf, R. 1997. Foundations of Inductive Logic Programming. LNAI, 1228, Springer.
13. Plotkin, G. D. 1970. A note on inductive generalization. In: B. Meltzer and D. Michie (eds.), Machine Intelligence 5, 153-63, Edinburgh University Press.
14. Plotkin, G. D. 1976. A powerdomain construction. SIAM Journal of Computing, 5:452-287.
15. Reiter, R. 1980. A logic for default Reasoning. Artificial Intelligence, 13:81-132.
16. Sakama, C. 2005. Ordering default theories and non-monotonic logic programs. Theoretical Computer Science, 338:127-152.
17. Turner, H. 2001. Strong equivalence of logic programs and default theories (made easy). In: Proc. of LPNMR '01, LNAI, 2173, 81-92, Springer.