5,316 research outputs found
Universal First-Order Logic is Superfluous for NL, P, NP and coNP
In this work we continue the syntactic study of completeness that began with
the works of Immerman and Medina. In particular, we take a conjecture raised by
Medina in his dissertation that says if a conjunction of a second-order and a
first-order sentences defines an NP-complete problems via fops, then it must be
the case that the second-order conjoint alone also defines a NP-complete
problem. Although this claim looks very plausible and intuitive, currently we
cannot provide a definite answer for it. However, we can solve in the
affirmative a weaker claim that says that all ``consistent'' universal
first-order sentences can be safely eliminated without the fear of losing
completeness. Our methods are quite general and can be applied to complexity
classes other than NP (in this paper: to NLSPACE, PTIME, and coNP), provided
the class has a complete problem satisfying a certain combinatorial property
Circuit Complexity Meets Ontology-Based Data Access
Ontology-based data access is an approach to organizing access to a database
augmented with a logical theory. In this approach query answering proceeds
through a reformulation of a given query into a new one which can be answered
without any use of theory. Thus the problem reduces to the standard database
setting.
However, the size of the query may increase substantially during the
reformulation. In this survey we review a recently developed framework on
proving lower and upper bounds on the size of this reformulation by employing
methods and results from Boolean circuit complexity.Comment: To appear in proceedings of CSR 2015, LNCS 9139, Springe
No Rationality Through Brute-Force
All reasoners described in the most widespread models of a rational reasoner exhibit logical omniscience, which is impossible for finite reasoners (real reasoners). The most common strategy for dealing with the problem of logical omniscience is to interpret the models using a notion of beliefs different from explicit beliefs. For example, the models could be interpreted as describing the beliefs that the reasoner would hold if the reasoner were able reason indefinitely (stable beliefs). Then the models would describe maximum rationality, which a finite reasoner can only approach in the limit of a reasoning sequence. This strategy has important consequences for epistemology. If a finite reasoner can only approach maximum rationality in the limit of a reasoning sequence, then the efficiency of reasoning is epistemically (and not only pragmatically) relevant. In this paper, I present an argument to this conclusion and discuss its consequences, as, for example, the vindication of the principle 'no rationality through brute-force'
P?=NP as minimization of degree 4 polynomial, integration or Grassmann number problem, and new graph isomorphism problem approaches
While the P vs NP problem is mainly approached form the point of view of
discrete mathematics, this paper proposes reformulations into the field of
abstract algebra, geometry, fourier analysis and of continuous global
optimization - which advanced tools might bring new perspectives and approaches
for this question. The first one is equivalence of satisfaction of 3-SAT
problem with the question of reaching zero of a nonnegative degree 4
multivariate polynomial (sum of squares), what could be tested from the
perspective of algebra by using discriminant. It could be also approached as a
continuous global optimization problem inside , for example in
physical realizations like adiabatic quantum computers. However, the number of
local minima usually grows exponentially. Reducing to degree 2 polynomial plus
constraints of being in , we get geometric formulations as the
question if plane or sphere intersects with . There will be also
presented some non-standard perspectives for the Subset-Sum, like through
convergence of a series, or zeroing of fourier-type integral for some natural . The last discussed
approach is using anti-commuting Grassmann numbers , making nonzero only if has a Hamilton cycle. Hence,
the PNP assumption implies exponential growth of matrix representation of
Grassmann numbers. There will be also discussed a looking promising
algebraic/geometric approach to the graph isomorphism problem -- tested to
successfully distinguish strongly regular graphs with up to 29 vertices.Comment: 19 pages, 8 figure
- …