How Flexible Is Answer Set Programming? An Experiment in Formalizing Commonsense in ASP

Authors:
Marcello Balduccini
Affiliations:
Intelligent Systems, OCTO, Eastman Kodak Company, Rochester, NY, USA 14650-2102
Venue:
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2009

Citing 5
Cited 0

Representing Knowledge in A-Prolog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Induction from answer sets in nonmonotonic logic programs

ACM Transactions on Computational Logic (TOCL)
Commonsense Reasoning

Commonsense Reasoning
Integrating answer set programming and constraint logic programming

Annals of Mathematics and Artificial Intelligence
Negotiation using logic programming with consistency restoring rules

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an exercise in the formalization of commonsense with Answer Set Programming aimed at finding the answer to an interesting riddle, whose solution is not obvious to many people. Solving the riddle requires a considerable amount of commonsense knowledge and sophisticated knowledge representation and reasoning techniques, including planning and adversarial reasoning. Most importantly, the riddle is difficult enough to make it unclear, at first analysis, whether and how Answer Set Programming or other formalisms can be used to solve it.