This paper proposes an argument-based semantics for combined epistemic and practical reasoning, taking seriously the idea that in certain contexts epistemic reasoning is sceptical while practical reasoning is credulous. The new semantics combines grounded and preferred semantics. A dialectical proof theory is defined which is sound and complete with respect to this semantics and which combines ...

This paper proposes an argument-based semantics for combined epistemic and practical reasoning, taking seriously the idea that in certain contexts epistemic reasoning is sceptical while practical reasoning is credulous. The new semantics combines grounded and preferred semantics. A dialectical proof theory is defined which is sound and complete with respect to this semantics and which combines ...

Looking at the history of Artiicial Intelligence, often theoretical rigor seems inversely proportional to practical applicability. Particularly, in the eld of robotics, there is a gap between the research on knowledge representation and practical robotics. In the present paper, a solution for bridging this gap is intuitively discussed: Shanahan's logical account for a mobile robot. It is presen...

In this paper‎, ‎we give a complete proof of Theorem 4.1(ii) and a new‎ ‎elementary proof of Theorem 4.1(i) in [Li and Shen‎, ‎On the‎ ‎intersection of the normalizers of the derived subgroups of all‎ ‎subgroups of a finite group‎, ‎ J‎. ‎Algebra, ‎323  (2010) 1349--1357]‎. ‎In addition‎, ‎we also give a generalization of Baer's Theorem‎.

Evaluations of technological artifacts in HCI4D contexts are known to suffer from high levels of participant response bias— where participants only provide positive feedback that they think will please the researcher. This paper describes a practical, low-cost intervention that uses the concept of social proof to influence participant response bias and successfully elicit critical feedback from...

The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoretical results showing clause learning as equivalent in power to resolution. There exist, however, problems that are intractable for resolution, for which clause-learning solvers are hence doomed. In this paper, we presen...

This paper addresses the residual scaling techniques (coarse-grid-correction optimization techniques) in multigrid methods. We survey recent developments in this area and prove the equivalence of the over-weighted residual technique and the over-correction technique. This leads to the proof of mathematical equivalence of the pre-scaling and post-scaling acceleration techniques. Two theorems hav...

We present a new generic construction of a public-key encryption (PKE) scheme secure against leakage-resilient chosen-ciphertext attacks (LR-CCA), from any Hash Proof System (HPS) and any one-time lossy filter (OT-LF). Efficient constructions of HPSs and OT-LFs from the DDH and DCR assumptions suggest that our construction is a practical approach to LR-CCA security. Most of practical PKEs with ...