According to the electric charge and elastic coefficient of object independent motion object, based on similar properties gravitational field electrostatic field, it is concluded that mass a constant object. However, experimental results show inertial related Therefore, considered principle equivalence not satisfied. As moves at low velocity, approximately true, so general theory relativity app...

In this paper we present a machine learning system that finds the scope of negation in biomedical texts. The system consists of two memory-based engines, one that decides if the tokens in a sentence are negation signals, and another that finds the full scope of these negation signals. Our approach to negation detection differs in two main aspects from existing research on negation. First, we fo...

We investigate the notion of classical negation from a non-classical perspective. In particular, one aim is to determine what classical negation amounts to in a paracomplete and paraconsistent four-valued setting. We first give a general semantic characterization of classical negation and then consider an axiomatic expansion BD+ of four-valued Belnap–Dunn logic by classical negation. We show th...

This paper presents an open-source toolkit for negation detection. It identifies negation cues and their corresponding scope in either raw or parsed text using maximummargin classification. The system design draws on best practice from the existing literature on negation detection, aiming for a simple and portable system that still achieves competitive performance. Pretrained models and experim...

Well Founded Semantics for logic programs extended with eXplicit negation (WFSX) is characterized by that, in any model, whenever :a (the explicit negation of a) holds, then a (the negation by default of a) also holds. When explicit negation is used contradiction may be present (e.g. a and :a both hold for some a) and thus no semantics is given to the program. We introduce here the notion of re...

In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or negation-as-failure). The proposed mechanisms are defined by very simple modular program transformations, an...