Epistemic NP Modifiers
نویسندگان
چکیده
(2) The suspects are in custody at two undisclosed locations. 'The suspects are in custody at two locations and it is not disclosed which locations they are in custody in'. (3) The suspects were arrested at unspecified locations. 'The suspects were arrested at some locations and it was unspecified which locations they were arrested in'. (4) Fabienne put the money in an unexpected place. 'Fabienne put the money at some place, and it was not expected that she
منابع مشابه
Evidentiality and Epistemic Modality at the Semantics/Pragmatics Interface
It is fairly standard to assume that a speech act consists of an illocutionary level of meaning, F , and a separate level of propositional content, p, such that F takes p as its argument, F (p). This paper is concerned (i) with establishing for one language, Cusco Quechua (CQ), to which of these two levels of meaning its evidential and its epistemic modal markers belong, and (ii) with developin...
متن کاملComplexity Results in Epistemic Planning
Epistemic planning is a very expressive framework that extends automated planning by the incorporation of dynamic epistemic logic (DEL). We provide complexity results on the plan existence problem for multi-agent planning tasks, focusing on purely epistemic actions with propositional preconditions. We show that moving from epistemic preconditions to propositional preconditions makes it decidabl...
متن کاملThe NP-Completeness of Reflected Fragments of Justification Logics
Justification Logic studies epistemic and provability phenomena by introducing justifications/proofs into the language in the form of justification terms. Pure justification logics serve as counterparts of traditional modal epistemic logics, and hybrid logics combine epistemic modalities with justification terms. The computational complexity of pure justification logics is typically lower than ...
متن کاملEfficient reasoning about actions based on assignments and announcements
We propose a reasoning about actions framework based on a combination of epistemic logic and star-free PDL, into which we integrate Reiter’s solution to the frame problem. We then show that prediction (alias plan verification) can be reduced in polynomial time to dynamic epistemic logic with assignments that has recently been proposed by Kooi et al.. We establish decidability and complexity res...
متن کاملEpistemic Reasoning in Logic Programs
Although epistemic logic programming has an enhanced capacity to handle complex incomplete information reasoning and represent agents’ epistemic behaviours, it embeds a significantly higher computational complexity than non-disjunctive and disjunctive answer set programming. In this paper, we investigate some important properties of epistemic logic programs. In particular, we show that Lee and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cmp-lg/9708004 شماره
صفحات -
تاریخ انتشار 1997