A framework for prioritized reasoning based on the choice evaluation

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2007, Pages 65-70

  Caroprese, Luciano ^a   Trubitsyna, Irina ^a   Zumpano, Ester ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Answer set optimization; Prioritized logic programming

Indexed keywords

CONSTRAINT THEORY; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; OPTIMIZATION; SEMANTICS;

ANSWER SET OPTIMIZATION; PREFERENCE RULES; PRIORITIZED LOGIC PROGRAMMING;

FORMAL LOGIC;

EID: 35348919078     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244017     Document Type: Conference Paper

References (19)

1. Brewka, G., Weil-Founded Semantics for Extended Logic Programs with Dynamic Preferences. Journal of Artificial Intelligence and Reasoning, 4: 19-36, 1996.
2. Brewka, G., Eiter, T., Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence, 109(1-2), 297-356, 1999.
3. Brewka, G., Logic programming with ordered disjunction. AAAI/IAAI, 100-105, 2002.
4. Brewka, G., Niemela, I., Truszczynski, M., Answer Set Optimization. IJCAI, 867-872, 2003.
5. Brewka, G., Complex Preferences for Answer Set Optimization, KR, 213-223, 2004.
6. Delgrande, J., P., Schaub, T., Tompits, H., Logic Programs with Compiled Preferences. ECAI, 464-468, 2000.
7. Delgrande, J., P., Schaub, T., Tompits, H., A Framework for Compiling Preferences in Logic Programs. Theory and Practice of Logic Programming, 3(2), 129-187, 2003.
8. Eiter, T., Gottlob, G., Mannila, H., Disjunctive Datalog. ACM Transaction On Database Systems, 22(3), 364-418, 1997.
9. Gelfond, M., Lifschitz, V., The Stable Model Semantics for Logic Programming, ICLP, 1070-1080, 1988.
10. Gelfond, M., Lifschitz, V., Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, 9:365-385, 1991.
11. Gelfond, M., Son, T.C., Reasoning with prioritized defaults. LPKR, 164-223, 1997.
12. Papadimitriou, C. H., Computational Complexity. Addison-Wesley, 1994.
13. Sakama, C., Inoue, K., Priorized logic programming and its application to commonsense reasoning. Artificial Intelligence, 123, 185-222, 2000.
14. Schaub, T., Wang, K., A Comparative Study of Logic Programs with Preference. IJCAI, 597-602, 2001.
15. Van Nieuwenborgh, D., Vermeir, D., Preferred Answer Sets for Ordered Logic Programs. JELIA, 432-443, 2002.
16. Van Nieuwenborgh, D., Heymans, S., Vermeir, D., On Programs with Linearly Ordered Multiple Preferences. ICLP, 180-194, 2004.
17. Wakaki, T., Inoue, K., Sakama, C., Nitta, K., Computing Preferred Answer Sets in Answer Set Programming. LPAR, 259-273, 2003.
18. Wang, K., Zhou, L., Lin, F., Alternating Fixpoint Theory for Logic Programs with Priority. Computational Logic, 164-178, 2000.
19. Zhang, Y., Foo, N., Answer sets for prioritized logic programs. ILPS, 69-83, 1997.