Results 261 to 270 of about 6,523 (306)
Some of the next articles are maybe not open access.
Journal of Philosophical Logic, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
1991
Approximation techniques are widely used in many areas of Computer Science for dealing with polynomially intractable problems. The major difficulty about introducing approximation in reasoning problems is in that it is very hard to find a measure of the approximation which is not dependent on the particular problem at hand. Our goal is to introduce the
Cadoli M., Schaerf M.
openaire +1 more source
Approximation techniques are widely used in many areas of Computer Science for dealing with polynomially intractable problems. The major difficulty about introducing approximation in reasoning problems is in that it is very hard to find a measure of the approximation which is not dependent on the particular problem at hand. Our goal is to introduce the
Cadoli M., Schaerf M.
openaire +1 more source
Journal of Philosophical Logic, 1980
The validity of an entailment has nothing to do with whether or not the components are true, false, necessary, or impossible; it has to do solely with whether or not there is a necessary connection between antecedent and consequent. Hence it is a mistake (we feel) to try to build a sieve which will “strain out” entailments from the set of material or ...
openaire +1 more source
The validity of an entailment has nothing to do with whether or not the components are true, false, necessary, or impossible; it has to do solely with whether or not there is a necessary connection between antecedent and consequent. Hence it is a mistake (we feel) to try to build a sieve which will “strain out” entailments from the set of material or ...
openaire +1 more source
Erkenntnis, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Chemistry & Biodiversity, 2007
AbstractEverything in Rosen's work flows from the principle of ‘closure to efficient cause’, the necessary and sufficient distinguishing feature of complexity, and a necessary distinguishing feature of an organism. Some students of Rosen find considerable confusion over the meaning of ‘closure to efficient cause’. Such confusion is unnecessary.
openaire +2 more sources
AbstractEverything in Rosen's work flows from the principle of ‘closure to efficient cause’, the necessary and sufficient distinguishing feature of complexity, and a necessary distinguishing feature of an organism. Some students of Rosen find considerable confusion over the meaning of ‘closure to efficient cause’. Such confusion is unnecessary.
openaire +2 more sources
Which Entailments Entail which Entailments?
1989We offer a procedure for deciding when a conjunction of entailments provably entails a single entailment. First some relevant context. The context from below is chiefly supplied in §19 and §24.3 (all references via the “section squiggle” are to ENT). There we showed how to decide provability for first degree formulas (no nesting of arrows). From above,
openaire +1 more source
THE CONTINUOUS REALIZABILITY OF ENTAILMENT
Mathematical Logic Quarterly, 1983A method is here given for modelling the Anderson-Belnap logics of positive entailment (LE) and relevant implication (LR) in established mathematical structures, notably topological spaces and finite- dimensional Banach spaces, respectively. For topological spaces four constructions are required: Function spaces, \(Y^ X\), with pointwise convergence ...
openaire +1 more source
Entailment analysis for improving Chinese textual entailment system
2013 IEEE 14th International Conference on Information Reuse & Integration (IRI), 2013Textual Entailment (TE) is a critical issue in natural language processing (NLP); many NLP applications can be benefited from the recognition of textual entailment (RTE). In this paper we report our observation on how to improve the Chinese textual entailment system and the experiment results on the NTCIR-10 RITE-2 dataset.
Shih-Hung Wu +4 more
openaire +1 more source
The pure calculus of entailment
Journal of Symbolic Logic, 1962The “implicational paradoxes” are treated by most contemporary logicians somewhat as follows:“The two-valued prepositional calculus sanctions as valid many of the obvious and satisfactory inferences which we recognize intuitively as valid, such as(A→.B→C)→.A→B→.A→C,2andA→B→.B→C→.A→C;it consequently suggests itself as a candidate for a formal analysis ...
Alan Ross Anderson, Nuel Belnap
openaire +2 more sources
Relevant entailment and logical ground
Philosophical StudiesAccording to an intuitive picture of relevant entailment, an entailment is relevant if all the formulas it contains contribute to its validity. In this paper, we provide a ground-theoretic analysis of this notion of contribution, and as a result of ...
Pierre Saint-Germier, Verdée Peter
exaly +2 more sources