Switch to: References

Citations of:

Invitation to fixed-parameter algorithms

New York: Oxford University Press (2006)

Add citations

You must login to add citations.
  1. On the computational complexity of ethics: moral tractability for minds and machines.Jakob Stenseke - 2024 - Artificial Intelligence Review 57 (105):90.
    Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Dynamic Tractable Reasoning: A Modular Approach to Belief Revision.Holger Andreas - 2020 - Cham, Schweiz: Springer.
    This book aims to lay bare the logical foundations of tractable reasoning. It draws on Marvin Minsky's seminal work on frames, which has been highly influential in computer science and, to a lesser extent, in cognitive science. Only very few people have explored ideas about frames in logic, which is why the investigation in this book breaks new ground. The apparent intractability of dynamic, inferential reasoning is an unsolved problem in both cognitive science and logic-oriented artificial intelligence. By means of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Parameterized Complexity of Theory of Mind Reasoning in Dynamic Epistemic Logic.Iris van de Pol, Iris van Rooij & Jakub Szymanik - 2018 - Journal of Logic, Language and Information 27 (3):255-294.
    Theory of mind refers to the human capacity for reasoning about others’ mental states based on observations of their actions and unfolding events. This type of reasoning is notorious in the cognitive science literature for its presumed computational intractability. A possible reason could be that it may involve higher-order thinking. To investigate this we formalize theory of mind reasoning as updating of beliefs about beliefs using dynamic epistemic logic, as this formalism allows to parameterize ‘order of thinking.’ We prove that (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • NP-Hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs.Sepp Hartung & André Nichterlein - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 283--292.