Evaluating epistemic negation in answer set programming
نویسندگان
چکیده
Article history: Received 15 August 2015 Received in revised form 31 December 2015 Accepted 12 April 2016 Available online 22 April 2016
منابع مشابه
Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)
Epistemic negation not along with default negation ¬ plays a key role in knowledge representation and nonmonotonic reasoning. However, the existing approaches behave not satisfactorily in that they suffer from the problems of unintended world views due to recursion through the epistemic modal operator K or M (KF and MF are shorthands for ¬notF and not¬F , respectively). In this paper we present...
متن کاملParacoherent Answer Set Programming
We study the problem of reasoning from incoherent answer set programs, i.e., from logic programs that do not have an answer set due to cyclic dependencies of an atom from its default negation. As a starting point we consider so-called semi-stable models which have been developed for this purpose building on a program transformation, called epistemic transformation. We give a model-theoretic cha...
متن کاملModelling autonomic dataspaces using answer sets
This paper presents an approach for managing an autonomic dataspace, able to automatically define views adapted for fulfilling the requirements of a set of users, and adjust them as the dataspace evolves. An autonomic dataspace deals with incomplete knowledge to manage itself because of the heterogeneity and the lack of metadata related to the resources it integrates. Our approach exploits the ...
متن کاملModeling epistemic knowledge in logic programs with negation as failure
Representing what an intelligent agent knows or believes can be an important feature for a Web service. Epistemic logic programs proposed by Gelfond [6] are a clear way to reason about what an intelligent agent knows or believes, but the complexity of the reasoning is exponential. The paper proposes a new class of logic programs, which consists from logic programs with two types of negation as ...
متن کاملModeling Epistemic Knowledge about Users
Representing what an intelligent agent knows or believes can be an important feature for an entity that acts in a collaborative environment. Epistemic logic programs are a clear way to reason about what an intelligent agent knows or believes, but the complexity of the reasoning is exponential. The paper presents a new kind of logic programs, the logic programs with two types of negation as fail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 237 شماره
صفحات -
تاریخ انتشار 2016