FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1973101725> ?p ?o ?g. }

• W1973101725 endingPage "23" @default.
• W1973101725 startingPage "1" @default.
• W1973101725 abstract "The main reasoning problems for disjunctive logic programs are complete for the second level of the polynomial hierarchy and hence considered harder than the same problems for normal (i.e., disjunction-free) programs, which are on the first level. We propose a new exact method for solving the disjunctive problems which exploits the small distance of a disjunctive programs from being normal. The distance is measured in terms of the size of a smallest “backdoor to normality,” which is the smallest number of atoms whose deletion makes the program normal. Our method consists of three phases. In the first phase, a smallest backdoor is computed. We show that this can be done using an efficient algorithm for computing a smallest vertex cover of a graph. In the second phase, the backdoor is used to transform the logic program into a quantified Boolean formula (QBF) where the number of universally quantified variables equals the size of the backdoor and where the total size of the quantified Boolean formula is quasilinear in the size of the given logic program. The quasilinearity is achieved by means of a characterization of the least model of a Horn program in terms of level numberings. In a third phase, the universal variables are eliminated using universal expansion yielding a propositional formula. The blowup in the last phase is confined to a factor that is exponential in the size of the backdoor but linear in the size of the quantified Boolean formula. By checking the satisfiability of the resulting formula with a S at solver (or by checking the satisfiability of the quantified Boolean formula by a Q bf -S at solver), we can decide the A sp reasoning problems on the input program. In consequence, we have a transformation from A sp problems to propositional satisfiability where the combinatorial explosion, which is expected when transforming a problem from the second level of the polynomial hierarchy to the first level, is confined to a function of the distance to normality of the input program. In terms of parameterized complexity, the transformation is fixed-parameter tractable. We complement this result by showing that (under plausible complexity-theoretic assumptions) such a fixed-parameter tractable transformation is not possible if we consider the distance to tightness instead of distance to normality." @default.
• W1973101725 created "2016-06-24" @default.
• W1973101725 creator A5037092803 @default.
• W1973101725 creator A5089442472 @default.
• W1973101725 date "2015-10-28" @default.
• W1973101725 modified "2023-09-24" @default.
• W1973101725 title "Backdoors to Normality for Disjunctive Logic Programs" @default.
• W1973101725 cites W1496518193 @default.
• W1973101725 cites W1505818550 @default.
• W1973101725 cites W1517036688 @default.
• W1973101725 cites W1553364858 @default.
• W1973101725 cites W1559081432 @default.
• W1973101725 cites W1587265115 @default.
• W1973101725 cites W1605107773 @default.
• W1973101725 cites W1766332311 @default.
• W1973101725 cites W1964680470 @default.
• W1973101725 cites W1976055110 @default.
• W1973101725 cites W1985980194 @default.
• W1973101725 cites W1988772559 @default.
• W1973101725 cites W1994520092 @default.
• W1973101725 cites W1998084650 @default.
• W1973101725 cites W1999396796 @default.
• W1973101725 cites W2004414305 @default.
• W1973101725 cites W2010160994 @default.
• W1973101725 cites W2011124182 @default.
• W1973101725 cites W2011958646 @default.
• W1973101725 cites W2011992362 @default.
• W1973101725 cites W2023141722 @default.
• W1973101725 cites W2050842068 @default.
• W1973101725 cites W2052175425 @default.
• W1973101725 cites W2056850725 @default.
• W1973101725 cites W2076698873 @default.
• W1973101725 cites W2079430756 @default.
• W1973101725 cites W2087432892 @default.
• W1973101725 cites W2088394397 @default.
• W1973101725 cites W2091138122 @default.
• W1973101725 cites W2100699693 @default.
• W1973101725 cites W2108911687 @default.
• W1973101725 cites W2152131859 @default.
• W1973101725 cites W2180068027 @default.
• W1973101725 cites W2189084874 @default.
• W1973101725 cites W2999957995 @default.
• W1973101725 cites W54881092 @default.
• W1973101725 doi "https://doi.org/10.1145/2818646" @default.
• W1973101725 hasPublicationYear "2015" @default.
• W1973101725 type Work @default.
• W1973101725 sameAs 1973101725 @default.
• W1973101725 citedByCount "12" @default.
• W1973101725 countsByYear W19731017252016 @default.
• W1973101725 countsByYear W19731017252017 @default.
• W1973101725 countsByYear W19731017252019 @default.
• W1973101725 countsByYear W19731017252021 @default.
• W1973101725 crossrefType "journal-article" @default.
• W1973101725 hasAuthorship W1973101725A5037092803 @default.
• W1973101725 hasAuthorship W1973101725A5089442472 @default.
• W1973101725 hasBestOaLocation W19731017252 @default.
• W1973101725 hasConcept C11413529 @default.
• W1973101725 hasConcept C114614502 @default.
• W1973101725 hasConcept C118615104 @default.
• W1973101725 hasConcept C136726353 @default.
• W1973101725 hasConcept C158465420 @default.
• W1973101725 hasConcept C16221470 @default.
• W1973101725 hasConcept C168773769 @default.
• W1973101725 hasConcept C187455244 @default.
• W1973101725 hasConcept C200415742 @default.
• W1973101725 hasConcept C2781045450 @default.
• W1973101725 hasConcept C33923547 @default.
• W1973101725 hasConcept C38652104 @default.
• W1973101725 hasConcept C41008148 @default.
• W1973101725 hasConcept C6943359 @default.
• W1973101725 hasConceptScore W1973101725C11413529 @default.
• W1973101725 hasConceptScore W1973101725C114614502 @default.
• W1973101725 hasConceptScore W1973101725C118615104 @default.
• W1973101725 hasConceptScore W1973101725C136726353 @default.
• W1973101725 hasConceptScore W1973101725C158465420 @default.
• W1973101725 hasConceptScore W1973101725C16221470 @default.
• W1973101725 hasConceptScore W1973101725C168773769 @default.
• W1973101725 hasConceptScore W1973101725C187455244 @default.
• W1973101725 hasConceptScore W1973101725C200415742 @default.
• W1973101725 hasConceptScore W1973101725C2781045450 @default.
• W1973101725 hasConceptScore W1973101725C33923547 @default.
• W1973101725 hasConceptScore W1973101725C38652104 @default.
• W1973101725 hasConceptScore W1973101725C41008148 @default.
• W1973101725 hasConceptScore W1973101725C6943359 @default.
• W1973101725 hasFunder F4320321181 @default.
• W1973101725 hasFunder F4320334678 @default.
• W1973101725 hasIssue "1" @default.
• W1973101725 hasLocation W19731017251 @default.
• W1973101725 hasLocation W19731017252 @default.
• W1973101725 hasLocation W19731017253 @default.
• W1973101725 hasOpenAccess W1973101725 @default.
• W1973101725 hasPrimaryLocation W19731017251 @default.
• W1973101725 hasRelatedWork W1597588219 @default.
• W1973101725 hasRelatedWork W1608133301 @default.
• W1973101725 hasRelatedWork W1757210337 @default.
• W1973101725 hasRelatedWork W1973101725 @default.
• W1973101725 hasRelatedWork W2014111643 @default.
• W1973101725 hasRelatedWork W2399929470 @default.

• next