agnostic learning of neural networks with bounded fan-in. It would be interesting to extend the hardness result for networks with real outputs to the case of a linear output unit with a constraint on the size of the output weights. We conjecture that a similar result can be obtained, with a relative error bound that|unlike Vu's result for this case 19]|does not decrease as the input dimension i...

Local Consistency has proven to be an important notion in the study of constraint satisfaction problems. We give an algebraic condition that characterizes all the constraint types for which generalized arc-consistency is suucient to ensure the existence of a solution. We give some examples to illustrate the application of this result.

We prove an institutional version of A. Robinson’s Consistency Theorem. This result is then applied to the institution of many-sorted first-order predicate logic and to two of its variations, infinitary and partial, obtaining very general syntactic criteria sufficient for a signature square in order to satisfy the Robinson consistency and Craig interpolation properties.

Identification ofNeisseria gonorrhoeaeby the Bruker matrix-assisted laser desorption ionization-time of flight mass spectrometry (MALDI-TOF MS) system may be affected by "B consistency categorization." A supplementary database of 17N. gonorrhoeaemain spectra was constructed. Twelve of 64N. gonorrhoeaeidentifications were categorized with B consistency, which disappeared using the supplementary ...

This paper introduces new notions of asymptotic proofs, PT(polynomial-time)extensions, PTM(polynomial-time Turing machine)-ω-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). An asymptotic proof is a set of infinitely many formal proofs, which is introduced to define and characterize a property, PTM-ω-consistency, of a formal theory. Informally speaking, PTM-ω-...

In globally distributed systems, shared state is never perfect. When communication is neither fast nor reliable, we cannot achieve strong consistency, low latency, and availability at the same time. Unfortunately, abandoning strong consistency has wide ramifications. Eventual consistency, though attractive from a performance viewpoint, is challenging to understand and reason about, both for sys...

One fundamental research result in the area of Constraint Processing (CP) is a condition that guarantees problem tractability by relating the consistency level of a Constraint Satisfaction Problem (CSP) to the structure of the problem. In our research, we propose to build effective problem-solving strategies that exploit the above-mentioned result in practice. To this end, our investigations ta...

In a Randall–Sundrum type II inflationary scenario we compute perturbation amplitudes and spectral indices up to next-to-lowest order in the slowroll parameters, starting from the well-known lowest-order result for a de Sitter brane. Using two different prescriptions for the tensor amplitude, we show that the braneworld consistency equations are not degenerate with respect to the standard relat...

A binding-time analysis is correct if it always produces consistent binding-time information. Consistency prevents partial evaluators from “going wrong”. A sufficient and decidable condition for consistency, called well-annotatedness, was first presented by Gomard and Jones. In this paper we prove that a weaker condition implies consistency. Our condition is decidable, subsumes the one of Gomar...