3 research outputs found
Syntactic Conditions for Antichain Property in Consistency Restoring Prolog
We study syntactic conditions which guarantee when a CR-Prolog (Consistency
Restoring Prolog) program has antichain property: no answer set is a proper
subset of another. A notable such condition is that the program's dependency
graph being acyclic and having no directed path from one cr-rule head literal
to another.Comment: Proceedings of the 11th Workshop on Answer Set Programming and Other
Computing Paradigms 201
Formalization of Psychological Knowledge in Answer Set Programming and its Application
In this paper we explore the use of Answer Set Programming (ASP) to
formalize, and reason about, psychological knowledge. In the field of
psychology, a considerable amount of knowledge is still expressed using only
natural language. This lack of a formalization complicates accurate studies,
comparisons, and verification of theories. We believe that ASP, a knowledge
representation formalism allowing for concise and simple representation of
defaults, uncertainty, and evolving domains, can be used successfully for the
formalization of psychological knowledge. To demonstrate the viability of ASP
for this task, in this paper we develop an ASP-based formalization of the
mechanics of Short-Term Memory. We also show that our approach can have rather
immediate practical uses by demonstrating an application of our formalization
to the task of predicting a user's interaction with a graphical interface.Comment: 26th Int'l. Conference on Logic Programming (ICLP'10
Negotiation Using Logic Programming with Consistency Restoring Rules β
We formalize negotiations using logic programming with consistency restoring rules (or CR-Prolog) [Balduccini and Gelfond, 2003]. Our formulation deals with incomplete information, preferences, and changing goals. We assume that each agent is equipped with a knowledge base for negotiation which consists of a CR-program, a set of possible assumptions, and a set of ordered goals. We use the notion of an answer set as a means to formalize the basic notions of negotiation such as proposal, response, negotiation, negotiation tree (protocol), etc. and discuss their properties.