Restricted Logic Research Articles

Judgment Logic of 10 kV Line Trunk Power Failure Based on Association Rules

Aiming at the traditional 10 kV line trunk outage fault judgment logic which mainly adopts the fixed receiver to collect the emergency repair work instructions and is susceptible to the influence of restrictive logic transmission, resulting in the problem of low fault judgment feedback integrity, it is necessary to design a new association rule-based 10 kV line trunk fault judgment logic. The association rules are used to generate the trunk fault judgment strategy, clarify different fault judgment attributes, and calculate the importance of the association rules by the improved Apriori algorithm. Combined with the spatial information service and the basic application service, the information interaction is realized through the bus exchange to generate the optimization logic of the 10 kV trunk fault judgment and complete the trunk fault judgment. The results of the example analysis show that the designed trunk line outage judgment logic has high feedback integrity, which proves that the designed outage judgment logic is effective and reliable with a certain application value, and makes a certain contribution to reducing the risk of trunk line outage.

Calibrated imputation for multivariate categorical data

Non-response is a major problem for anyone collecting and processing data. A commonly used technique to deal with missing data is imputation, where missing values are estimated and filled in into the dataset. Imputation can become challenging if the variable to be imputed has to comply with a known total. Even more challenging is the case where several variables in the same dataset need to be imputed and, in addition to known totals, logical restrictions between variables have to be satisfied. In our paper, we develop an approach for a broad class of imputation methods for multivariate categorical data such that previously published totals are preserved while logical restrictions on the data are satisfied. The developed approach can be used in combination with any imputation model that estimates imputation probabilities, i.e. the probability that imputation of a certain category for a variable in a certain unit leads to the correct value for this variable and unit.

Reduction Model Checking for Multi-Agent Systems of Group Social Commitments

Innumerable industries now use multi-agent systems (MASs) in various contexts, including healthcare, security, and commercial deployments. It is challenging to select reliable business protocols for critically important safety-related systems (e.g., in healthcare). The verification and validation of business applications is increasingly explored concerning multi-agent systems’ group social commitments. This study explains a novel extended reduction verification method to model-check business applications’ critical specification rules using action restricted computation tree logic (ARCTL). In particular, we aim to conduct the verification process for the CTLGC logic using a reduction algorithm and show its effectiveness to handle MASs with huge models, thus, showing its importance and applicability in large real-world applications. To do so, we need to transform the CTLGC model to an ARCTL model and the CTLGC formulas into ARCTL formulas. Thus, the developed method was verified with the model-checker new symbolic model verifier (NuSMV), and it demonstrated effectiveness in the safety-critical specification rule support provision. The proposed method can verify up to 2.43462 × 1014 states MASs, which shows its effectiveness when applied to real-world applications.

Data Validation Infrastructure for R

Checking data quality against domain knowledge is a common activity that pervades statistical analysis from raw data to output. The R package 'validate' facilitates this task by capturing and applying expert knowledge in the form of validation rules: logical restrictions on variables, records, or data sets that should be satisfied before they are considered valid input for further analysis. In the validate package, validation rules are objects of computation that can be manipulated, investigated, and confronted with data or versions of a data set. The results of a confrontation are then available for further investigation, summarization or visualization. Validation rules can also be endowed with metadata and documentation and they may be stored or retrieved from external sources such as text files or tabular formats. This data validation infrastructure thus allows for systematic, user-defined definition of data quality requirements that can be reused for various versions of a data set or by data correction algorithms that are parameterized by validation rules.

Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic

We investigate the decidability of model checking logics of time, knowledge, and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observable discrete-time Markov chains. Decidability results are known for certain restricted logics with respect to these semantics, subject to a variety of restrictions that are either unexplained or involve a longstanding unsolved mathematical problem. We show that mild generalizations of the known decidable cases suffice to render the model checking problem definitively undecidable. In particular, for the synchronous perfect recall semantics, a generalization from temporal operators with finite reach to operators with infinite reach renders model checking undecidable. The case of the clock semantics is closely related to a monadic second-order logic of time and probability that is known to be decidable, except on a set of measure zero. We show that two distinct extensions of this logic make model checking undecidable. One of these involves polynomial combinations of probability terms, the other involves monadic second-order quantification into the scope of probability operators. These results explain some of the restrictions in previous work.

Extractive text summarization using F-RBM

The Intense growth of data over the internet and process extracting predominating details from it is a time-consuming task. A new application of making this task simplified is text-summarization. This paper presents the integration of Restricted Boltzmann Machine and Fuzzy Logic methods. Both of these processes have different ways of giving precision to a summary but together being part of the unsupervised world has surpassed their working alone to summarize the text. Integrated algorithm i.e. called FRBM (fuzzy Restricted Boltzmann Machine) provides enhanced depiction in the modeling of probability over visible and hidden units than the RBM.

Wandering and Placemaking in London: Iain Sinclair’s Literary Methodology

Wandering and Placemaking in London: Iain Sinclair’s Literary Methodology

Tone Association and Output Locality in Non-Linear Structures

This paper offers a computational characterization of tone-to-TBU association processes using a restricted least-fixed point logic. Crucially, least fixed point logics allow recursive definitions which capture output-oriented processes. The added requirement that these definitions are quantifier-free ensures that they are inherently local, a restriction that is well-motivated for phonological processes in general. The typology developed here distinguishes between possible and impossible tone mappings, capturing a wider range of attested tone mappings (left-to-right, right-to-left, edge-in, quality-sensitive) than previous rule-based or optimization approaches, while also explaining why certain unattested mapping patterns (for example center-out association) are impossible. This thus represents a strong first approximation of a definition for output-based local functions over non-linear structures

Multiple hypothesis testing in experimental economics

The analysis of data from experiments in economics routinely involves testing multiple null hypotheses simultaneously. These different null hypotheses arise naturally in this setting for at least three different reasons: when there are multiple outcomes of interest and it is desired to determine on which of these outcomes a treatment has an effect; when the effect of a treatment may be heterogeneous in that it varies across subgroups defined by observed characteristics and it is desired to determine for which of these subgroups a treatment has an effect; and finally when there are multiple treatments of interest and it is desired to determine which treatments have an effect relative to either the control or relative to each of the other treatments. In this paper, we provide a bootstrap-based procedure for testing these null hypotheses simultaneously using experimental data in which simple random sampling is used to assign treatment status to units. Using the general results in Romano and Wolf (Ann Stat 38:598–633, 2010), we show under weak assumptions that our procedure (1) asymptotically controls the familywise error rate—the probability of one or more false rejections—and (2) is asymptotically balanced in that the marginal probability of rejecting any true null hypothesis is approximately equal in large samples. Importantly, by incorporating information about dependence ignored in classical multiple testing procedures, such as the Bonferroni and Holm corrections, our procedure has much greater ability to detect truly false null hypotheses. In the presence of multiple treatments, we additionally show how to exploit logical restrictions across null hypotheses to further improve power. We illustrate our methodology by revisiting the study by Karlan and List (Am Econ Rev 97(5):1774–1793, 2007) of why people give to charitable causes.

SOME MODEL THEORY OF GUARDED NEGATION

AbstractThe Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal logic and of many description logics, along with many sentences that arise in databases. It has been shown that the syntax of GNFO is restrictive enough so that computational problems such as validity and satisfiability are still decidable. This suggests that, in spite of its expressive power, GNFO formulas are amenable to novel optimizations. In this article we study the model theory of GNFO formulas. Our results include effective preservation theorems for GNFO, effective Craig Interpolation and Beth Definability results, and the ability to express the certain answers of queries with respect to a large class of GNFO sentences within very restricted logics.

Effective algorithm for solving complex problems of production control and of material flows control of industrial enterprise

A universal economical and mathematical model designed for determination of optimal strategies for managing subsystems (components of subsystems) of production and logistics of enterprises is considered. Declared universality allows taking into account on the system level both production components, including limitations on the ways of converting raw materials and components into sold goods, as well as resource and logical restrictions on input and output material flows. The presented model and generated control problems are developed within the framework of the unified approach that allows one to implement logical conditions of any complexity and to define corresponding formal optimization tasks. Conceptual meaning of used criteria and limitations are explained. The belonging of the generated tasks of the mixed programming with the class of NP is shown. An approximate polynomial algorithm for solving the posed optimization tasks for mixed programming of real dimension with high computational complexity is proposed. Results of testing the algorithm on the tasks in a wide range of dimensions are presented.

A hidden Markov tree model for testing multiple hypotheses corresponding to Gene Ontology gene sets

BackgroundTesting predefined gene categories has become a common practice for scientists analyzing high throughput transcriptome data. A systematic way of testing gene categories leads to testing hundreds of null hypotheses that correspond to nodes in a directed acyclic graph. The relationships among gene categories induce logical restrictions among the corresponding null hypotheses. An existing fully Bayesian method is powerful but computationally demanding.ResultsWe develop a computationally efficient method based on a hidden Markov tree model (HMTM). Our method is several orders of magnitude faster than the existing fully Bayesian method. Through simulation and an expression quantitative trait loci study, we show that the HMTM method provides more powerful results than other existing methods that honor the logical restrictions.ConclusionsThe HMTM method provides an individual estimate of posterior probability of being differentially expressed for each gene set, which can be useful for result interpretation. The R package can be found on https://github.com/k22liang/HMTGO.

Assessment of potential agricultural and short-rotation forest bioenergy crop establishment sites in Jackson County, Florida, USA

We present an analysis framework composed of a geospatial process that can be employed to identify suitable areas for increasing the supply of biomass material on landscapes that include a large number of private landowners. Our analysis estimated bare land and a broad open land class, and considered restrictions on bioenergy projects pertaining to soils, parcel size, landowner, and landowner residence. In our case study county within the southern United States, the public land area remaining after excluded areas were removed represented less than 1% of the non-excluded land in the county, and broader-classified, open areas comprised about 1% of the non-excluded land. About 30% of the non-excluded land in the county was located on privately-owned land. However, when logical restrictions were considered, this estimate was reduced by as much as 43 (open areas) to 50% (bare ground) of the non-excluded private lands. The analysis suggests that large reductions in estimates of potential land areas available for bioenergy production may be observed when realistic assumptions are placed on geospatial analyses of land.

To be fair, use bundles

Attempts to manage the reasoning about systems with fairness properties are long running. The popular but restricted Computational Tree Logic (CTL) is amenable to automated reasoning but has difficulty expressing some fairness properties. More expressive languages such as CTL* and CTL+ are computationally complex. The main contribution of this paper is to show the usefulness and practicality of employing the bundled variants of these languages to handle fairness. In particular we present a tableau for a bundled variant of CTL that still has the similar computational complexity to the CTL tableau and a simpler implementation. We further show that the decision problem remains in EXPTIME even if a bounded number of CTL* fairness constraints are allowed in the input formulas. By abandoning limit closure the bundled logics can simultaneously be easier to automate and express many typical fairness constraints.

Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic (Extended Abstract)

We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains. Decidability results are known for certain restricted logics with respect to these semantics, subject to a variety of restrictions that are either unexplained or involve a longstanding unsolved mathematical problem. We show that mild generalizations of the known decidable cases suffice to render the model checking problem definitively undecidable. In particular, for a synchronous perfect recall, a generalization from temporal operators with finite reach to operators with infinite reach renders model checking undecidable. The case of the clock semantics is closely related to a monadic second order logic of time and probability that is known to be decidable, except on a set of measure zero. We show that two distinct extensions of this logic make model checking undecidable. One of these involves polynomial combinations of probability terms, the other involves monadic second order quantification into the scope of probability operators. These results explain some of the restrictions in previous work.

Against Agamben: Sovereignty and the Void in the Discourse of the Nation in Early Modern China

In Kingdom and Glory, Agamben analyzed the dual perspective of the void, through the metaphor of the empty throne, in the governmental machine in the West. I engage with the ambiguous question of the void with regard to the concept of sovereignty through my reading of two Chinese intellectuals in the late Qing period, Liang Qichao (1872–1929) and Zhang Taiyan (1869–1936). This paper therefore addresses the question of sovereignty and the void in the discourse of nation in early modern China, an issue that is related to the problem of the political economy or the politics of life. I argue that the rhetorical move in Liang Qichao’s argument for the birth of a new nation and new people was to move from the not-having (無) to the there is (有) in support of the formation of a new nation-state and a restricted logic of sovereignty, while Zhan Taiyan’s position was to affirm the dynamitic re-composition of the void by constantly negating the given fixated state, and thus proposing a different and radical vision of nation and full sovereignty of the lives of each and every one of the people who are co-inhabiting in the polis.

Truth Space Method for Caching Database Queries

We propose a new method of client-side data caching for relational databases with a central server and distant clients. Data are loaded into the client cache based on queries executed on the server. Every has the corresponding DB table – the result of the execution. These queries have a special form called universal relational query based on three fundamental Relational Algebra operations: selection, projection and natural join. We have to mention that such a form is the closest one to the natural language and the majority of database search queries can be expressed in this way. Besides, this form allows us to analyze correctness by checking lossless join property. A subsequent may be executed in a client’s local cache if we can determine that the result is entirely contained in the cache. For this we compare truth spaces of the logical restrictions in a new user’s and the results of the queries execution in the cache. Such a comparison can be performed analytically , without need in additional Database queries. This method may be used to define lacking data in the cache and execute the on the server only for these data. To do this the analytical approach is also used, what distinguishes our paper from the existing technologies. We propose four theorems for testing the required conditions. The first and the third theorems conditions allow us to define the existence of required data in cache. The second and the fourth theorems state conditions to execute queries with cache only. The problem of cache data actualizations is not discussed in this paper. However, it can be solved by cataloging queries on the server and their serving by triggers in background mode. The article is published in the author’s wording.

The ideal restructuring of migrant families in the immigration law

The legal configuration of kinship ties in immigration law is governed by a restrictive logic that combines a dependent and nuclear composition with mismatches in the concrete form of managing the distances, the dynamics and the times at origin and destination. The family model in immigration law has an ideal and dominant approach openly excluding other family realities in the social context. Law in an inherent tendency towards the ideal doesn’t allow a legitimate choice between autonomy and individual freedom in order to define or not the family project and own relationships. In this paper I discuss from a critical approach the inconsistencies presented by the current Spanish immigration law to restructure households in the family reunification scheme because of Law doesn’t secure a suitable degree of equality and justice.

Relax-and-fix decomposition technique for solving large scale grid-based location problems

Many problems in business, engineering, defence, resource exploitation, and even the medical sciences with location aspects can be expressed as grid-based location problems (GBLPs), modeled as integer linear programming problems. Such problems are often very computationally complex to solve. We develop a relax-and-fix-based decomposition approach to solve large-scale GBLPs, which we demonstrate will significantly reduce solution runtimes while not severely impacting optimality. We also introduce problem-specific logical restrictions, constraints that reduce the feasible region and the resulting branch-and-bound tree with minimal reductions in optimality.

Fault Lines in Russia's Discourse of Nation: Television Coverage of the December 2010 Moscow Riots

This article analyzes Russian television news accounts of the December 2010 Manezhnaia riots that followed an ethnic Russian football fan's murder by a group of men from the North Caucasus. It focuses on the narrative struggle to reconcile official nation-building rhetoric with grassroots realities and broadcasters' own assumptions. Using the tools of media discourse analysis, Stephen Hutchings and Vera Tolz demonstrate that national television's conceptual apparatus consists of a multifaceted amalgam in which interpretations of the Soviet period are modified through the influences of late imperial Russian intellectual traditions and western interpretations of societal diversity. Hutchings and Tolz show how the essentialization of ethnic boundaries within this apparatus leads both to the overinterpretation of interethnic aspects of the crisis, and to their occlusion. Rather than submitting to a univocal state machine, post-Manezhnaia broadcasting reveals fault lines whose partial convergence around a single narrative reflects the restricted logic of the conceptual apparatus and a perceived need to reflect the public mood.