Recent research in nonmonotonic logic programming under the answer-set semantics studies different notions of equivalence. In particular, strong and uniform equivalence are proposed as useful tools for optimizing (parts of) a logic program. While previous research mainly addressed propositional (i.e., ground) programs, we deal here with the more general case of non-ground programs, and provide ...

Tailoring many-body interactions among a proper quantum system endows it with computing ability by means of static quantum computation in the sense that some of the physical degrees of freedom can be used to store binary information and the corresponding binary variables satisfy some given logic relations if and only if the system is in the ground state. Two theorems are proved showing that the...

this research is intended to investigate educational change in complexity paradigm. complexity paradigm provide a new perspective for thinkers to changing the world and it's phenomena and many of theorists present new viewpoints in variant scientific domains according to the main components of this paradigm. for this, the researcher first investigates and criticizes educational change theories ...

sciences exist to demonstrate the fundamental order underlying nature. chaos/complexity theory is a novel and amazing field of scientific inquiry. notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (retrieved from http://www.inc...

We propose an objective, comprehensive, and complexity independent metric for performance evaluation of graphics/text separation (text segmentation) algorithms. The metric includes a positive set and a negative set of indices, at both the character and the character string (text) levels, and it evaluates the detection accuracy of the location, width, height, orientation, skew, string length, an...

In this paper we investigate computational complexity of the PERF-consistency and PERF-entailment problems for ground normal logic programs. In [3] it is proved that these problems belong to Σ2 and Π P 2 correspondingly. The question of obtaining more accurate results was left as open. We prove that both problems belong to ∆2 . Lower bounds on the complexity of these problems are also establish...

We study the local geometry of a one-hidden-layer fully-connected neural network where the training samples are generated from a multi-neuron logistic regression model. We prove that under Gaussian input, the empirical risk function employing quadratic loss exhibits strong convexity and smoothness uniformly in a local neighborhood of the ground truth, for a class of smooth activation functions ...

In this letter, we study the optimum selection of ground stations (GSs) in RF/optical satellite networks (SatNets) order to minimize overall installation cost under an outage probability requirement, assuming independent weather conditions between sites. First, show that optimization problem can be formulated as a binary-linear-programming problem, and then give formal proof its NP-hardness. Fu...