Matches in SemOpenAlex for { <https://semopenalex.org/work/W1520421608> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W1520421608 endingPage "337" @default.
- W1520421608 startingPage "331" @default.
- W1520421608 abstract "In the paper we consider a variant of information systems introduced by Pawlak in [1]. In our model, suggested by Skowj:gn, [2] and [3], knowledge about a given domain is represented by a directed graph. Nodes of such a graph are labeled by states and edges by actions. Moreover some nodes of the graph are distinguished as terminal (or accepting). We may think of this model in the following way.~odes correspond to specific situations; states assigned to these nodes represent (incomplete) descriptions of situations; edges represent possible changes of these situations when an a~tion (attached to a given edge) is performed. For example a part of medical knowledge can be represented in this framework: situations correspond to specific diseases (or their complete descriptions); states correspond to partial descriptions of these diseases (symptoms); actions correspond to transitions from one situation to another what reflects the effect of an application of a particular treatment. All nodes which correspond to a specific disease or to a state of good health can be distinguished as terminal ones. A decision problem can be informally described as follows: a knowledge base (graph) and a state s is given; decide whether there is a strategy of applying actions such that each node labeled by s is transformed by this strategy to a terminal one. The main result of this paper states that the above problem is NP-complete (provided a knowledge base is represented by an acyclic graph). Moreover a deterministic polynomial time algorithm is presented for the case of decision problems of a bounded degree; the degree of the decision problem is defined as the number of nodes labeled by the initial state. The paper is organized as follows: in the next section precise definitions of an information system, strategy and decision problem are given; the NP-completeness of the decision problem is shown in section 3 whereas a deterministic polynomial time algorithm for the restricted decision problem is described in section 4. In the last section we argue that the unrestricted decision problem (the graph does not need to be acyclic) is PSPACE-complete." @default.
- W1520421608 created "2016-06-24" @default.
- W1520421608 creator A5063395947 @default.
- W1520421608 date "1989-01-01" @default.
- W1520421608 modified "2023-09-27" @default.
- W1520421608 title "Complexity of decision problems under incomplete information" @default.
- W1520421608 cites W2019254124 @default.
- W1520421608 doi "https://doi.org/10.1007/3-540-51486-4_80" @default.
- W1520421608 hasPublicationYear "1989" @default.
- W1520421608 type Work @default.
- W1520421608 sameAs 1520421608 @default.
- W1520421608 citedByCount "0" @default.
- W1520421608 crossrefType "book-chapter" @default.
- W1520421608 hasAuthorship W1520421608A5063395947 @default.
- W1520421608 hasConcept C11413529 @default.
- W1520421608 hasConcept C132525143 @default.
- W1520421608 hasConcept C154945302 @default.
- W1520421608 hasConcept C311688 @default.
- W1520421608 hasConcept C41008148 @default.
- W1520421608 hasConcept C4554734 @default.
- W1520421608 hasConcept C80444323 @default.
- W1520421608 hasConceptScore W1520421608C11413529 @default.
- W1520421608 hasConceptScore W1520421608C132525143 @default.
- W1520421608 hasConceptScore W1520421608C154945302 @default.
- W1520421608 hasConceptScore W1520421608C311688 @default.
- W1520421608 hasConceptScore W1520421608C41008148 @default.
- W1520421608 hasConceptScore W1520421608C4554734 @default.
- W1520421608 hasConceptScore W1520421608C80444323 @default.
- W1520421608 hasLocation W15204216081 @default.
- W1520421608 hasOpenAccess W1520421608 @default.
- W1520421608 hasPrimaryLocation W15204216081 @default.
- W1520421608 hasRelatedWork W1508645576 @default.
- W1520421608 hasRelatedWork W1561218479 @default.
- W1520421608 hasRelatedWork W1681025728 @default.
- W1520421608 hasRelatedWork W174721655 @default.
- W1520421608 hasRelatedWork W184555552 @default.
- W1520421608 hasRelatedWork W191285954 @default.
- W1520421608 hasRelatedWork W1967736473 @default.
- W1520421608 hasRelatedWork W1970673089 @default.
- W1520421608 hasRelatedWork W1972659052 @default.
- W1520421608 hasRelatedWork W2040745298 @default.
- W1520421608 hasRelatedWork W2071403952 @default.
- W1520421608 hasRelatedWork W2113238753 @default.
- W1520421608 hasRelatedWork W2153725805 @default.
- W1520421608 hasRelatedWork W2163745834 @default.
- W1520421608 hasRelatedWork W2374557197 @default.
- W1520421608 hasRelatedWork W2506189277 @default.
- W1520421608 hasRelatedWork W2974452640 @default.
- W1520421608 hasRelatedWork W857268061 @default.
- W1520421608 hasRelatedWork W92304355 @default.
- W1520421608 hasRelatedWork W181903397 @default.
- W1520421608 isParatext "false" @default.
- W1520421608 isRetracted "false" @default.
- W1520421608 magId "1520421608" @default.
- W1520421608 workType "book-chapter" @default.