منابع مشابه
Sometimes It’s Hard to Be Coherent
The paper provides an analysis of the construction in Hungarian known as focus raising, illustrated below. János-t mond-t-am hogy jön John-ACC say-PAST-1SG that come.3SG ‘It is John that I said is coming.’ In focus raising, the focus of the matrix clause is identified with a grammatical function in the embedded clause. Focus raising is particularly interesting because of the case marking on foc...
متن کاملRobot ethics? Not yet: A reflection on Whitby's "Sometimes it's hard to be a robot"
Science fiction stories seductively portray robots as human. In present reality (early 21st century) robots are machines, even though they can do many things far better than humans (fly, swim, play chess to name a few). Any ethics for or of robots is therefore a seductive mix of fiction and reality. The key issue for rational discourse is to provide a rigorous framework for reasoning about the ...
متن کاملEasy Problems are Sometimes Hard
We present a detailed experimental investigation of the easy-hard-easy phase transition for randomly generated instances of satisfiability problems. Problems in the hard part of the phase transition have been extensively used for benchmarking satisfiability algorithms. This study demonstrates that problem classes and regions of the phase transition previously thought to be easy can sometimes be...
متن کاملResponse to "Sometimes it's hard to be a robot: A call for action on the ethics of abusing artificial agents"
This is a call for informed debate on the ethical issues raised by the forthcoming widespread use of robots, particularly in domestic settings. Research shows that humans can sometimes become very abusive towards computers and robots particularly when they are seen as human-like and this raises important ethical issues. The designers of robotic systems need to take an ethical stance on at least...
متن کاملSolving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assumptions, strictly more expressive than normal (disjunction-free) logic programming, whose expressiveness is limited to properties decidable in NP. However, this higher expressiveness comes at a computational cost, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Reviews Immunology
سال: 2002
ISSN: 1474-1733,1474-1741
DOI: 10.1038/nri865