Results 211 to 220 of about 1,899 (235)
Some of the next articles are maybe not open access.
First-Degree Entailment and Structural Reasoning
Synthese Library, 2019In this paper it is shown how the logic of first-degree entailment of Anderson and Belnap can be represented by a variety of deductively equivalent binary (Fmla-Fmla) consequence systems, up to a system with transitivity as the only inference rule. Some possible extensions of these systems are briefly considered as well.
Yaroslav Shramko, Shramko Yaroslav
exaly +2 more sources
Correspondence analysis and automated proof-searching for first degree entailment
European Journal of Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yaroslav Petrukhin, Vasily Shangin
exaly +2 more sources
Variable Domain First-Order First-Degree Entailment and Some of Its Children
Studia LogicazbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henrique Antunes +2 more
exaly +2 more sources
Textual Entailment by Generality
Available online 7 December 2011International audienceTextual Entailment consists in determining if an entailment relation exists between two texts. In this paper, we present an Informative Asymmetric Measure called the Asymmetric InfoSimba (AIS), which ...
Sebastiao Pais +2 more
exaly +2 more sources
Intuitive Semantics for First-Degree Entailment and ‘Coupled Trees’
Philosophical Studies, 1976Classically, an argument A therefore B is ‘valid’ (or A is said to ‘entail’ B) if and only if (iff) each situation (model) is such that either A is false or B is true. This fits well with so-called ‘tableau’ methods for showing that A entails B by working out the mutual inconsistency of A and ~B.
openaire +2 more sources
Removing the Oddity in First Degree Entailment
Thought: A Journal of Philosophy, 2019I discuss an old problem with first degree entailment (FDE), namely the unintuitive way disjunctions and conjunctions between statements with values B and N are defined. I supply a solution to this problem that involves a modification of FDE that leaves the philosophical motivation for the logic unharmed.
openaire +1 more source
Towards Tractable Approximations to Many-Valued Logics: The Case of First Degree Entailment
2022FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs
D’Agostino, Marcello +1 more
openaire +1 more source
Default Rules in the Logic of First-Degree Entailments
2019Monotonicity is a property of the consequence relation of classical logic, which has been questioned for a range of reasons, some of which we overview. Default logic, which is a non-monotonic logic, was introduced to model defeasible conclusions that may be justified by default rules. In this paper, we scrutinize certain features of non-monotonicity of
openaire +1 more source

