Zobrazeno 1 - 10
of 180
pro vyhledávání: '"Preferential entailment"'
Autor:
Engelfriet, Joeri, Treur, Jan
Publikováno v:
Journal of Logic, Language, and Information, 1998 Jul 01. 7(3), 369-388.
Externí odkaz:
https://www.jstor.org/stable/40180146
Publikováno v:
Studia Logica. 105:1291-1317
We consider a family of logical systems for representing entailment relations of various kinds. This family has its root in the logic of first-degree entailment formulated as a binary consequence system, i.e. a proof system dealing with the expressio
Autor:
Yael Sharvit
Publikováno v:
Semantics and Pragmatics. 10:1-38
It is argued that the notion of classical entailment faces two problems, the second argument projection problem and the P -to- Q problem, which arise because classical entailment is not designed to handle partial functions. It is shown that while the
Publikováno v:
Information and Computation. 247:130-140
Based on the investigation of the axioms used in the theory of information system, the notion of simplified continuous information system is introduced which is considered as a generalization of continuous information systems. Just like the continuou
Publikováno v:
Digital.CSIC. Repositorio Institucional del CSIC
instname
instname
The Logic of Approximate Entailment (LAE) is a graded counterpart of classical propositional calculus, where conclusions that are only approximately correct can be drawn. This is achieved by equipping the underlying set of possible worlds with a simi
Autor:
Mitio Takano
Publikováno v:
Studia Logica. 104:917-929
Sequent calculi for trilattice logics, including those that are determined by the truth entailment, the falsity entailment and their intersection, are given. This partly answers the problems in Shramko-Wansing (J Philos Logic 34:121---153, 2005).
Autor:
Thomas Vetterlein
The logic LAE q discussed in this paper is based on an approximate entailment relation. LAE q generalises classical propositional logic to the effect that conclusions can be drawn with a quantified imprecision. To this end, properties are modelled by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fefc27408071ac8a061cc5c86f22c25d
http://arxiv.org/abs/1808.10320
http://arxiv.org/abs/1808.10320
Publikováno v:
Computational Linguistics. 41:249-291
Entailment rules between predicates are fundamental to many semantic-inference applications. Consequently, learning such rules has been an active field of research in recent years. Methods for learning entailment rules between predicates that take in
Autor:
Amitava Das, Dwijen Rudra Pal
Publikováno v:
Research in Computing Science. 86:43-52
Formal definition textual entailment implies strict meaning relationship of meaning in its totality between text (T) and hypothesis (H). Even if the text have main ideas of a hypothesis, but lacks minor information or have additional information then
Autor:
Dennis Earl
Publikováno v:
Conceptus. 40:1-12