Decision problem

Known as: Solvable, Decision variant, Decidability problems

In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes-or-no answer…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

In this paper, we present two different formal frameworks for representing decision making. In both frameworks, decisions have…

2009

We shall consider the general problem of causal propagation for spinor fields, focus attention in particular on the case…

2007

A novel technique is proposed for improving the standard Vapnik-Chervonenkis (VC) dimension estimate for the Support Vector…

2006

We prove that every n-modal logic between K and S5 is undecidable, whenever n ≥ 3. We also show that each of these logics is non…

2004

Abstract Let $G=(V,E)$ be a simple graph and $s$ and $t$ be two distinct vertices of $G$. A path in $G$ is called \lb for some…

2000

We compare, in terms of solvability and efficiency, the synchronous model, noted Ss, with the asynchronous model augmented with a…

1993

Precoloring Extension (shortly PrExt) is the following problem: Given a graph G with some precolored vertices and a color bound k…

1993

A localization technique using reliable, highly accurate, robust, inexpensive light beam sensors designed for mechanical assembly…

1990

Conclusions To summarize, we have identiied a problem that arises in learning from the knowledge in textbooks: the problem of…

1955