Inserire una breve descrizione delle modifiche fatte
(Richiesto)
Minor changes are by default collapsed in the page history.
No changes
The page does not exist yet.
Failed to load changes
Version by on
Leave Collaboration
Are you sure you want to leave the realtime collaboration and continue editing alone? The changes you save while editing alone will lead to merge conflicts with the changes auto-saved by the realtime editing session.
Answer Sets
Michael Gelfond
Frank van Harmelen, Vladimir Lifschitz, Bruce Porter (a cura di)
Handbook of Knowledge Representation, capitolo 7, pp. 285–316
Foundations of Artificial Intelligence 3
Elsevier B.V.
2008
Publisher Summary This chapter discusses Answer Set Prolog, which is a language for knowledge representation and reasoning based on the answer set/stable model semantics of logic programs. The language has roots in the declarative programming, syntax, and semantics of standard Prolog, disjunctive databases, and nonmonotonic logic. Unlike standard Prolog, it allows expressing disjunction and classic or strong negation. It differs from many other knowledge representation languages by its ability to represent defaults. A substantial part of education consists in learning various defaults, exceptions to these defaults, and the ways of using this information to draw reasonable conclusions about the world and the consequences of one's actions. Answer Set Prolog provides a powerful logical model of this process. Its syntax allows a simple representation of defaults and their exceptions, its consequence relation characterizes the corresponding set of valid conclusions, and its inference mechanisms allow a program to find these conclusions in a reasonable amount of time.