To see the other types of publications on this topic, follow the link: Logical entailment.

Journal articles on the topic 'Logical entailment'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Logical entailment.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Zhou, Y., and Y. Zhang. "A Logical Study of Partial Entailment." Journal of Artificial Intelligence Research 40 (January 20, 2011): 25–56. http://dx.doi.org/10.1613/jair.3117.

Full text
Abstract:
We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means that under the circumstance of \Gamma, if P is true then some "part" of Q will also be true. We distinguish three different kinds of partial entailments and formalize them by using an extended notion of prime implicant. We study their semantic properties, which show that, surprisingly, partial entailments fail for many simple inference rules. Then, we study t
APA, Harvard, Vancouver, ISO, and other styles
2

De Bruijn, J., and S. Heymans. "Logical Foundations of RDF(S) with Datatypes." Journal of Artificial Intelligence Research 38 (August 20, 2010): 535–68. http://dx.doi.org/10.1613/jair.3088.

Full text
Abstract:
The Resource Description Framework (RDF) is a Semantic Web standard that provides a data language, simply called RDF, as well as a lightweight ontology language, called RDF Schema. We investigate embeddings of RDF in logic and show how standard logic programming and description logic technology can be used for reasoning with RDF. We subsequently consider extensions of RDF with datatype support, considering D entailment, defined in the RDF semantics specification, and D* entailment, a semantic weakening of D entailment, introduced by ter Horst. We use the embeddings and properties of the logics
APA, Harvard, Vancouver, ISO, and other styles
3

Andersen, Frederik J. "Countering Justification Holism in the Epistemology of Logic: The Argument from Pre-Theoretic Universality." Australasian Journal of Logic 20, no. 3 (2023): 375–96. http://dx.doi.org/10.26686/ajl.v20i3.8201.

Full text
Abstract:

 
 
 A key question in the philosophy of logic is how we have epistemic justification for claims about logical entailment (assuming we have such justification at all). Justification holism asserts that claims of logical entailment can only be justified in the context of an entire logical theory, e.g., classical, intuitionistic, paraconsistent, paracomplete etc. According to holism, claims of logical entailment cannot be atomistically justified as isolated statements, independently of theory choice. At present there is a developing interest in—and endorsement of—justification ho
APA, Harvard, Vancouver, ISO, and other styles
4

Shi, Jihao, Xiao Ding, and Ting Liu. "Case-Based Deduction for Entailment Tree Generation." Mathematics 12, no. 18 (2024): 2893. http://dx.doi.org/10.3390/math12182893.

Full text
Abstract:
Maintaining logical consistency in structured explanations is critical for understanding and troubleshooting the reasoning behind a system’s decisions. However, existing methods for entailment tree generation often struggle with logical consistency, resulting in erroneous intermediate conclusions and reducing the overall accuracy of the explanations. To address this issue, we propose case-based deduction (CBD), a novel approach that retrieves cases with similar logical structures from a case base and uses them as demonstrations for logical deduction. This method guides the model toward logical
APA, Harvard, Vancouver, ISO, and other styles
5

TATAR, DOINA, ANDREEA MIHIS, DANA LUPSA, and EMMA TAMAIANU-MORITA. "ENTAILMENT-BASED LINEAR SEGMENTATION IN SUMMARIZATION." International Journal of Software Engineering and Knowledge Engineering 19, no. 08 (2009): 1023–38. http://dx.doi.org/10.1142/s0218194009004520.

Full text
Abstract:
This paper presents some original methods for text summarization of a single source document by extraction. The methods are based on some of our own text segmentation algorithms. We denote them as logical segmentation because for all these methods (LTT, ArcInt and ArcReal) the score of a sentence is calculated starting from the number of sentences which are entailed by it. For a text (which is a sequence of sentences) the scores form a structure which indicates how the most important sentences alternate with less important ones and organizes the text according to its logical content. The secon
APA, Harvard, Vancouver, ISO, and other styles
6

PALOMINO, MIGUEL. "A comparison between two logical formalisms for rewriting." Theory and Practice of Logic Programming 7, no. 1-2 (2007): 183–213. http://dx.doi.org/10.1017/s1471068406002845.

Full text
Abstract:
AbstractMeseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. Even though it is not possible to establish an entailment system map between them, both can be naturally simulated in each other. Semantically, there is no embedding between the corresponding institutions. Along the way, the notions of entailment and satisfaction in Meseguer's rewriting logic are gen
APA, Harvard, Vancouver, ISO, and other styles
7

Cropper, Andrew, and Sophie Tourret. "Logical reduction of metarules." Machine Learning 109, no. 7 (2019): 1323–69. http://dx.doi.org/10.1007/s10994-019-05834-x.

Full text
Abstract:
AbstractMany forms of inductive logic programming (ILP) use metarules, second-order Horn clauses, to define the structure of learnable programs and thus the hypothesis space. Deciding which metarules to use for a given learning task is a major open problem and is a trade-off between efficiency and expressivity: the hypothesis space grows given more metarules, so we wish to use fewer metarules, but if we use too few metarules then we lose expressivity. In this paper, we study whether fragments of metarules can be logically reduced to minimal finite subsets. We consider two traditional forms of
APA, Harvard, Vancouver, ISO, and other styles
8

Qiu, Junming, Wenqing Li, Zhanhao Xiao, et al. "Knowledge Compilation Meets Logical Separability." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (2022): 5851–60. http://dx.doi.org/10.1609/aaai.v36i5.20529.

Full text
Abstract:
Knowledge compilation is an alternative solution to address demanding reasoning tasks with high complexity via converting knowledge bases into a suitable target language. Interestingly, the notion of logical separability, proposed by Levesque, offers a general explanation for the tractability of clausal entailment for two remarkable languages: decomposable negation normal form and prime implicates. It is interesting to explore what role logical separability on earth plays in problem tractability. In this paper, we apply the notion of logical separability in three reasoning problems within the
APA, Harvard, Vancouver, ISO, and other styles
9

Huang, Xuejing, and Bruno C. d. S. Oliveira. "Distributing intersection and union types with splits and duality (functional pearl)." Proceedings of the ACM on Programming Languages 5, ICFP (2021): 1–24. http://dx.doi.org/10.1145/3473594.

Full text
Abstract:
Subtyping with intersection and union types is nowadays common in many programming languages. From the perspective of logic, the subtyping problem is essentially the problem of determining logical entailment : does a logical statement follow from another one? Unfortunately, algorithms for deciding subtyping and logical entailment with intersections, unions and various distributivity laws can be highly non-trivial. This functional pearl presents a novel algorithmic formulation for subtyping (and logical entailment) in the presence of various distributivity rules between intersections, unions an
APA, Harvard, Vancouver, ISO, and other styles
10

Zaitsev, Dmitry. "Supervenience, Entailment, and Vague Objects." Aitías, Revista de Estudios Filosóficos del Centro de Estudios Humanísticos de la UANL 2, no. 3 (2022): 1–20. http://dx.doi.org/10.29105/aitas2.3-27.

Full text
Abstract:
Not long ago came into common use, the relation of supervenience is rapidly gaining in popularity. At the same time, its logical nature, in particular its possible correlations with such fundamental logical relation as entailment, remains unresolved and needs clarification. In this paper, I compare these two relations and outline a new approach to formal explication of supervenience. In so doing, I employ as main sources two conceptions: of intensional semantics, and impossible object descriptions as its core part, introduced in section 3, and of relevant consequence relation, briefly describe
APA, Harvard, Vancouver, ISO, and other styles
11

Beltagy, I., Stephen Roller, Pengxiang Cheng, Katrin Erk, and Raymond J. Mooney. "Representing Meaning with a Combination of Logical and Distributional Models." Computational Linguistics 42, no. 4 (2016): 763–808. http://dx.doi.org/10.1162/coli_a_00266.

Full text
Abstract:
NLP tasks differ in the semantic information they require, and at this time no single semantic representation fulfills all requirements. Logic-based representations characterize sentence structure, but do not capture the graded aspect of meaning. Distributional models give graded similarity ratings for words and phrases, but do not capture sentence structure in the same detail as logic-based approaches. It has therefore been argued that the two are complementary. We adopt a hybrid approach that combines logical and distributional semantics using probabilistic logic, specifically Markov Logic N
APA, Harvard, Vancouver, ISO, and other styles
12

Garrett, Brian Jonathan. "Causal Essentialism versus the Zombie Worlds." Canadian Journal of Philosophy 39, no. 1 (2009): 93–112. http://dx.doi.org/10.1353/cjp.0.0042.

Full text
Abstract:
David Chalmers claims that the logical possibility of ‘zombie worlds’ — worlds physically indiscernible from the actual world, but that lack consciousness — reveal that consciousness is a distinct fact, or property, in addition to the physical facts or properties.The ‘existence’ or possibility of Zombie worlds violates the physicalist demand that consciousness logically supervene upon the physical. On the assumption that the logical supervenience of consciousness upon the physical is, indeed, a necessary entailment of physicalism, the existence of zombie worlds implies the falsity of physicali
APA, Harvard, Vancouver, ISO, and other styles
13

Taher, Marewan D., and Salah M. Salih. "A Paradigmatic Lexical Relation Study of Analysing Entailment in Identity and Inclusion Relations." Koya University Journal of Humanities and Social Sciences 5, no. 1 (2023): 159–66. http://dx.doi.org/10.14500/kujhss.v5n1y2022.pp159-166.

Full text
Abstract:
While paradigmatic lexical/sense relations are traditionally used to analyse the relations between lexical items, the present article adopts a descriptive qualitative method, based on Cruse’s (2000) classification of lexical/sense relations, to find the identity and inclusion relations of two lexical items in two different texts by using the logical entailment relation. The article aims at finding out whether or not lexical items can be substituted by another without changing their meaning; the meaning of one lexical item is included in the meaning of the other; and the validity of these relat
APA, Harvard, Vancouver, ISO, and other styles
14

Anisa, Febiyana. "THE TRUTH RELATIONS IN THE MAIN CHARACTER’S ENTAILMENT SENTENCES IN MURDER ON THE ORIENT EXPRESS MOVIE." MEDIOVA: Journal of Islamic Media Studies 1, no. 2 (2021): 181–95. http://dx.doi.org/10.32923/medio.v1i2.1876.

Full text
Abstract:
This study analyzed entailment of the main character’s sentences in Murder on The Orient Express movie in the semantics field. The purpose of this study is to explain the truth in the sentence uttered by the main character in the movie and to prove the truth value from the interlocutor’s response in the sentence. This study focused on explaining the truth of Poirot’s sentences and proving the truth value from the interlocutor’s response. This study used a qualitative descriptive method and a propositional logic approach. This study found 16 data of entailment. The data were analyzed using the
APA, Harvard, Vancouver, ISO, and other styles
15

Borovcanin, Momcilo. "Some consequence relations on propositional formulas." Serbian Journal of Electrical Engineering 8, no. 1 (2011): 9–15. http://dx.doi.org/10.2298/sjee1101009b.

Full text
Abstract:
Consequence relations on propositional formulas are binary relations on propositional formulas that represent certain types of entailment - formal or semi-formal derivation of conclusion from a certain set of premises. Some of well known examples are classical implication (standard logical entailment), preference relations (i.e. relations that satisfy Reflexivity, Left logical equivalence, Right weakening, And, Or and Cautious monotonicity) rational relations (i.e. preference relations that also satisfy rational monotonicity), consequence relations (prime examples are qualitative possibilities
APA, Harvard, Vancouver, ISO, and other styles
16

Caminati, Marco. "First Order Languages: Further Syntax and Semantics." Formalized Mathematics 19, no. 3 (2011): 179–92. http://dx.doi.org/10.2478/v10037-011-0027-0.

Full text
Abstract:
First Order Languages: Further Syntax and SemanticsThird of a series of articles laying down the bases for classical first order model theory. Interpretation of a language in a universe set. Evaluation of a term in a universe. Truth evaluation of an atomic formula. Reassigning the value of a symbol in a given interpretation. Syntax and semantics of a non atomic formula are then defined concurrently (this point is explained in [16], 4.2.1). As a consequence, the evaluation of any w.f.f. string and the relation of logical implication are introduced. Depth of a formula. Definition of satisfaction
APA, Harvard, Vancouver, ISO, and other styles
17

KASSOFF, MICHAEL, and MICHAEL R. GENESERETH. "PrediCalc: a logical spreadsheet management system." Knowledge Engineering Review 22, no. 3 (2007): 281–95. http://dx.doi.org/10.1017/s0269888907001154.

Full text
Abstract:
AbstractIn this article, we describe PrediCalc, a logical spreadsheet that allows for many-to-many constraints and propagation in all directions. We explain PrediCalc’s update mechanism and PrediCalc’s unique approach to handling inconsistencies between the spreadsheet values and the spreadsheet formulas. We have developed a paraconsistent entailment relation for the purpose of computing the consequences of PrediCalc’s value assignments under inconsistency.We close with thoughts on the prospects of logical spreadsheets on the World Wide Web, and describe our initial Websheet prototypes.
APA, Harvard, Vancouver, ISO, and other styles
18

Rudolph, S., and B. Glimm. "Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend!" Journal of Artificial Intelligence Research 39 (October 28, 2010): 429–81. http://dx.doi.org/10.1613/jair.3029.

Full text
Abstract:
Description Logics are knowledge representation formalisms that provide, for example, the logical underpinning of the W3C OWL standards. Conjunctive queries, the standard query language in databases, have recently gained significant attention as an expressive formalism for querying Description Logic knowledge bases. Several different techniques for deciding conjunctive query entailment are available for a wide range of DLs. Nevertheless, the combination of nominals, inverse roles, and number restrictions in OWL 1 and OWL 2 DL causes unsolvable problems for the techniques hitherto available. We
APA, Harvard, Vancouver, ISO, and other styles
19

BESNARD, PHILIPPE. "A LOGICAL ANALYSIS OF RULE INCONSISTENCY." International Journal of Semantic Computing 05, no. 03 (2011): 271–80. http://dx.doi.org/10.1142/s1793351x11001250.

Full text
Abstract:
Representing knowledge in a rule-based system takes place by means of "if…then…" statements. These are called production rules for the reason that new information is produced when the rule fires. The logic attached to rule-based systems is taken to be classical inasmuch as "if…then…" is encoded by material implication. However, it appears that the notion of triggering "if…then…" amounts to different logical definitions. The paper investigates the matter, with an emphasis upon consistency because reading "if… then…" statements as rules calls for a notion of rule consistency that does not confor
APA, Harvard, Vancouver, ISO, and other styles
20

Deshmukh, Soham, Shuo Han, Hazim Bukhari, et al. "Audio Entailment: Assessing Deductive Reasoning for Audio Understanding." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 22 (2025): 23769–77. https://doi.org/10.1609/aaai.v39i22.34548.

Full text
Abstract:
Recent literature uses language to build foundation models for audio. These Audio-Language Models (ALMs) are trained on a vast number of audio-text pairs and show remarkable performance in tasks including Text-to-Audio Retrieval, Captioning, and Question Answering. However, their ability to engage in more complex open-ended tasks, like Interactive Question-Answering, requires proficiency in logical reasoning- a skill not yet benchmarked. We introduce the novel task of Audio Entailment to evaluate an ALM's deductive reasoning ability. This task assesses whether a text description (hypothesis) o
APA, Harvard, Vancouver, ISO, and other styles
21

Kruszewski, German, Denis Paperno, and Marco Baroni. "Deriving Boolean structures from distributional vectors." Transactions of the Association for Computational Linguistics 3 (December 2015): 375–88. http://dx.doi.org/10.1162/tacl_a_00145.

Full text
Abstract:
Corpus-based distributional semantic models capture degrees of semantic relatedness among the words of very large vocabularies, but have problems with logical phenomena such as entailment, that are instead elegantly handled by model-theoretic approaches, which, in turn, do not scale up. We combine the advantages of the two views by inducing a mapping from distributional vectors of words (or sentences) into a Boolean structure of the kind in which natural language terms are assumed to denote. We evaluate this Boolean Distributional Semantic Model (BDSM) on recognizing entailment between words a
APA, Harvard, Vancouver, ISO, and other styles
22

Kupperman, Joel J. "A New Look at the Logic of the ‘Is’-‘Ought’ Relation." Philosophy 80, no. 3 (2005): 343–59. http://dx.doi.org/10.1017/s0031819105000331.

Full text
Abstract:
In the 1950's some prominent philosophers suggested a logical relation weaker than entailment between primarily descriptive statements and ethical conclusions. The paper revisits this suggestion. It examines four ways in which ethical statemnts can be supported by descriptions and evaluations. This provides a similarity bteween some kinds of reason-giving in ethics and familiar cases of logical inference, making it plausible to speak of a logic. The similarity however is limited, and the strength in ethics of descriptive reasons is never precise and always somewhat contestable.
APA, Harvard, Vancouver, ISO, and other styles
23

Costa, Jorge Campos da, and Claudia Strey. "INFERENCES AND INTERFACES: VALIDITY AND RELEVANCE." Linguagem em (Dis)curso 14, no. 3 (2014): 577–94. http://dx.doi.org/10.1590/1982-4017-140308-0814.

Full text
Abstract:
The Ancient Greeks, since the sophists' texts represented threats to legitimate reasoning anchored in the notion of truth, tried to examine the relationship among valid, informal and fallacious arguments. Aristotle distinguished mainly formal ways of abstractions from the daily practical uses, addressing the relationships between the logical forms and the interferences of content. This paper, motivated by this script of insights, investigates problems concerning logical operators, relations of sense, probability, entailment and their properties in natural language, constituted as inferences in
APA, Harvard, Vancouver, ISO, and other styles
24

Levine, Michael P. "The Deterministic and Ontological Implications of the Logical Entailment Analysis of Causation." Idealistic Studies 17, no. 1 (1987): 1–13. http://dx.doi.org/10.5840/idstudies19871717.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Lance, Mark, and Philip Kremer. "The logical structure of linguistic commitment II: Systems of relevant commitment entailment." Journal of Philosophical Logic 25, no. 4 (1996): 425–49. http://dx.doi.org/10.1007/bf00249667.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Karivets', Ihor. "Elements, Types and Consequences of Scientific Creativity. Foreword to the Ukrainian Translation of Jan Łukasiewicz’s article “Creativity in Science”." Humanitarian vision 6, no. 2 (2020): 40–42. http://dx.doi.org/10.23939/shv2020.02.040.

Full text
Abstract:
For the first time, the article “Creativity in Science” by Jan Łukasiewicz, a well-known representative of the Lviv-Warsaw School, logician and methodologist of science, was translated into Ukrainian. A well-known logician refutes the thesis that sciences exist only to reproduce facts and establish truths based on them. Sciences exist to meet the intellectual needs of man, which are manifested in his desire to understand. Reasoning is a creative act that includes demonstration, deduction, affirmation and understanding, as well as creation of hypotheses. Scientific creativity consists in the fo
APA, Harvard, Vancouver, ISO, and other styles
27

Harrison, Jonathan. "The Logical Function of ‘That’, or Truth, Propositions and Sentences." Philosophy 79, no. 1 (2004): 67–96. http://dx.doi.org/10.1017/s0031819104000063.

Full text
Abstract:
(i) It is propositions, not sentences, that are true or false. It is true ‘Dogs bark’ does not make sense. It is true that dogs bark does. (ii) and (iii) Davidson wrong about ‘that’. (iv) The difference between ‘implies’ and ‘if ... then ...’. (v), (vi), (vii) and (viii) Russell, not Quine, right about the subject matter of logic. (ix) The objectual and substitutional interpretations of quantifiers compatible. (x), (xi), (xii), (xiii), (xiv), (xv) and (xvi) Implications for well-known theories of truth; truth correspondence. (xvii), (xviii) and (xix) and (xx) Implications for the principle of
APA, Harvard, Vancouver, ISO, and other styles
28

Hanke, Miroslav. "Jan Dullaert of Ghent on the Foundations of Propositional Logic." Vivarium 55, no. 4 (2017): 273–306. http://dx.doi.org/10.1163/15685349-12341348.

Full text
Abstract:
Abstract Jan Dullaert (1480-1513) was a direct student of John Mair and a teacher of Gaspar Lax, Juan de Celaya, and Juan Luis Vives. His commentary on Aristotle’s Peri Hermeneias addresses the foundations of propositional logic, including a detailed analysis of conditionals (following Paul of Venice’s Logica magna) and the semantics of logical connectives (conjunction, disjunction, and implication). Dullaert’s propositional logic is limited to the immediate implications of the semantics of these connectives, i.e., their introduction and elimination rules. In the same context, he discusses sev
APA, Harvard, Vancouver, ISO, and other styles
29

Mitra, Arindam, Peter Clark, Oyvind Tafjord, and Chitta Baral. "Declarative Question Answering over Knowledge Bases Containing Natural Language Text with Answer Set Programming." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 3003–10. http://dx.doi.org/10.1609/aaai.v33i01.33013003.

Full text
Abstract:
While in recent years machine learning (ML) based approaches have been the popular approach in developing endto-end question answering systems, such systems often struggle when additional knowledge is needed to correctly answer the questions. Proposed alternatives involve translating the question and the natural language text to a logical representation and then use logical reasoning. However, this alternative falters when the size of the text gets bigger. To address this we propose an approach that does logical reasoning over premises written in natural language text. The proposed method uses
APA, Harvard, Vancouver, ISO, and other styles
30

González, Luis. "Discrete Entailment-Based Linking and -EE Nouns in English." Research in Language 5 (December 18, 2007): 51–79. http://dx.doi.org/10.2478/v10015-007-0002-6.

Full text
Abstract:
Barker (1998) argues that since the referent of an -ee noun can be an indirect object, a direct object, a prepositional object, or a subject, -ee nouns cannot be described as a syntactic natural class. Portero Muñoz (2003) concurs and offers a semantic analysis based on Logical Structure (LS) in the framework of Role and Reference Grammar (RRG). This article proposes that RRG’s macroroles (Actor and Undergoer) can be derived with two entailments and without any need for LS. Its analysis improves Portero Muñoz’s, presenting additional evidence that subjects that allow -ee noun formation are Und
APA, Harvard, Vancouver, ISO, and other styles
31

Moiseeva, Anna Yu. "THE RELATIONSHIP BETWEEN LOGICAL CONSEQUENCE AND IMPLICATION IN RELEVANT LOGIC." Vestnik Tomskogo gosudarstvennogo universiteta. Filosofiya, sotsiologiya, politologiya, no. 81 (2024): 39–47. https://doi.org/10.17223/1998863x/81/4.

Full text
Abstract:
The article defends the following theses: (1) The interpretation of relevant implication as a formalization of the natural concept of entailment leads to the fact that the logical properties attributed to the implication in a specific version of relevant logic are transferred to the level of semantics and determine the properties of the model. (2) The means of transfer is the “relevant” principle of deduction, which in one form or another is necessarily present in each of the logics, since it is the only intuitively acceptable option for justifying the formalization of the conditional connecti
APA, Harvard, Vancouver, ISO, and other styles
32

Lance, Mark Norris, and Philip Kremer. "The logical structure of linguistic commitment I: Four systems of non-relevant commitment entailment." Journal of Philosophical Logic 23, no. 4 (1994): 369–400. http://dx.doi.org/10.1007/bf01048687.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Williamson, Timothy. "Gillian K. Russell: Barriers to Entailment: Hume's Law and Other Limits on Logical Consequence." Journal of Philosophy 121, no. 10 (2024): 592–96. https://doi.org/10.5840/jphil20241211039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Fandinno, Jorge, David Pearce, Concepción Vidal, and Stefan Woltran. "Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs." Algorithms 15, no. 6 (2022): 201. http://dx.doi.org/10.3390/a15060201.

Full text
Abstract:
Answer Set Programming (ASP) is a well established logical approach in artificial intelligence that is widely used for knowledge representation and problem solving. Equilibrium logic extends answer set semantics to more general classes of programs and theories. When intertheory relations are studied in ASP, or in the more general form of equilibrium logic, they are usually understood in the form of comparisons of the answer sets or equilibrium models of theories or programs. This is the case for strong and uniform equivalence and their relativised and projective versions. However, there are ma
APA, Harvard, Vancouver, ISO, and other styles
35

Kakas, Antonis. "Informalizing Formal Logic." Informal Logic 39, no. 2 (2019): 169–204. http://dx.doi.org/10.22329/il.v39i2.5169.

Full text
Abstract:
This paper presents a way in which formal logic can be understood and reformulated in terms of argumentation that can help us unify formal and informal reasoning. Classical deductive reasoning will be expressed entirely in terms of notions and concepts from argumentation so that formal logical entailment is equivalently captured via the arguments that win between those supporting concluding formulae and arguments supporting contradictory formulae. This allows us to go beyond Classical Logic and smoothly connect it with human reasoning, thus providing a uniform argumentation-based view of both
APA, Harvard, Vancouver, ISO, and other styles
36

Ciola, Graziana. "Marsilius of Inghen on the Definition of consequentia." Vivarium 56, no. 3-4 (2018): 272–91. http://dx.doi.org/10.1163/15685349-12341359.

Full text
Abstract:
Abstract This paper offers an analysis of Marsilius of Inghen’s definition of consequentia and of his treatment of logical validity as presented in the first book of his treatise on Consequentiae. Comparing Marsilius of Inghen’s, John Buridan’s, and Albert of Saxony’s theories, the author argues that Marsilius’ account is based on a conception of consequence as a relation of entailment among propositions rather than as a type of conditional sentence and, thus, moves the discussion away from the sentential level. Therefore, Marsilius’ theory represents an original and important contribution to
APA, Harvard, Vancouver, ISO, and other styles
37

Ciardelli, Ivano. "Questions as information types." Synthese 195, no. 1 (2016): 321–65. http://dx.doi.org/10.1007/s11229-016-1221-y.

Full text
Abstract:
Abstract This paper argues that questions have an important role to to play in logic, both semantically and proof-theoretically. Semantically, we show that by generalizing the classical notion of entailment to questions, we can capture not only the standard relation of logical consequence, which holds between pieces of information, but also the relation of logical dependency, which holds between information types. Proof-theoretically, we show that questions may be used in inferences as placeholders for arbitrary information of a given type; by manipulating such placeholders, we may construct f
APA, Harvard, Vancouver, ISO, and other styles
38

Burgess-Jackson, Keith. "What Independence Is." Review of European Studies 12, no. 3 (2020): 50. http://dx.doi.org/10.5539/res.v12n3p50.

Full text
Abstract:
Eighty years ago, in a short essay entitled “What Is Independence?,” Richard Robinson (1902-1996) made two errors that, to my knowledge, remain uncorrected. The errors are (1) claiming that entailment entails consistency (it does not) and (2) misstating the relation of subcontrariness. To make good on my claim that these are errors, I present and explain, in a more systematic way than Robinson does, nine distinct logical relations, one of which is independence. There are independent reasons for making these relations—as well as their relations to one another&m
APA, Harvard, Vancouver, ISO, and other styles
39

Chi, Zeyu. "Essence, Propria and Essentialist Explanation." History of Philosophy & Logical Analysis 23, no. 2 (2020): 338–61. http://dx.doi.org/10.30965/26664275-02302004.

Full text
Abstract:
Abstract In this paper I propose a notion of propria inspired by Aristotle, on which propria are non-essential, necessary properties explained by the essence of a thing. My proposal differs from the characterization of propria by Kit Fine and Kathrin Koslicki: unlike Fine, the relation of explanation on my account can’t be assimilated to a notion of logical entailment. In disagreement with Koslicki, I suggest that the explanatory relation at issue needs not be necessary. My account of essence is conceptually parsimonious: it illuminates the contribution of essence to explanation without relyin
APA, Harvard, Vancouver, ISO, and other styles
40

Blanco, Jose Miguel, Sandra M. Lopez, and Marcos M. Recio. "The class of all 3-valued natural conditional variants of RM3 that are Plumwood Algebras." Australasian Journal of Logic 20, no. 2 (2023): 188–218. http://dx.doi.org/10.26686/ajl.v29i2.8285.

Full text
Abstract:
Valerie Plumwood introduced in "Some false laws of logic" a series of arguments on how the rules Exported Syllogism, Disjunctive Syllogism, Commutation, and Exportation are not acceptable. Based on this we define the class of Plumwood algebras - logical matrices that do not verify any of these theses. Afterwards we provide conditional variants of the characteristic matrix of the logic RM3 that are also Plumwood algebras. These matrices are given an axiomatization based on First Degree Entailment and are endowed with Belnap-Dunn Semantics. Finally we provide results of Soundness and Completenes
APA, Harvard, Vancouver, ISO, and other styles
41

Marocco, Paolo, and Roberto Gigliucci. "An Investigation about Entailment and Narrative by AI Techniques (Generative Models)." Communication, Society and Media 3, no. 4 (2020): p61. http://dx.doi.org/10.22158/csm.v3n4p61.

Full text
Abstract:
Many storytelling generation problems concern the difficulty to model the sequence of sentences. Language models are generally able to assign high scores to well-formed text, especially in the cases of short texts, failing when they try to simulate human textual inference. Although in some cases output text automatically generated sounds as bland, incoherent, repetitive and unrelated to the context, in other cases the process reveals capability to surprise the reader, avoiding to be boring/predictable, even if the generated text satisfies entailment task requirements. The lyric tradition often
APA, Harvard, Vancouver, ISO, and other styles
42

Jäger, Christoph. "Fischer’s Fate with Fatalism." European Journal for Philosophy of Religion 9, no. 4 (2017): 25–38. http://dx.doi.org/10.24204/ejpr.v9i4.2027.

Full text
Abstract:
John Martin Fischer’s core project in Our Fate (2016) is to develop and defend Pike-style arguments for theological incompatibilism, i. e., for the view that divine omniscience is incompatible with human free will. Against Ockhamist attacks on such arguments, Fischer maintains that divine forebeliefs constitute so-called hard facts about the times at which they occur, or at least facts with hard ‘kernel elements’. I reconstruct Fischer’s argument and outline its structural analogies with an argument for logical fatalism. I then point out some of the costs of Fischer’s reasoning that come into
APA, Harvard, Vancouver, ISO, and other styles
43

Fang, Liangda, Kewen Wang, Zhe Wang, and Ximing Wen. "Disjunctive Normal Form for Multi-Agent Modal Logics Based on Logical Separability." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2817–26. http://dx.doi.org/10.1609/aaai.v33i01.33012817.

Full text
Abstract:
Modal logics are primary formalisms for multi-agent systems but major reasoning tasks in such logics are intractable, which impedes applications of multi-agent modal logics such as automatic planning. One technique of tackling the intractability is to identify a fragment called a normal form of multiagent logics such that it is expressive but tractable for reasoning tasks such as entailment checking, bounded conjunction transformation and forgetting. For instance, DNF of propositional logic is tractable for these reasoning tasks. In this paper, we first introduce a notion of logical separabili
APA, Harvard, Vancouver, ISO, and other styles
44

Feiman, Roman, Joshua K. Hartshorne, and David Barner. "Contrast and entailment: Abstract logical relations constrain how 2- and 3-year-old children interpret unknown numbers." Cognition 183 (February 2019): 192–207. http://dx.doi.org/10.1016/j.cognition.2018.11.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Golovko, N. V. "What is not mentioned in the famous article by Edmund Gettier." Siberian Journal of Philosophy 21, no. 1 (2023): 105–26. http://dx.doi.org/10.25205/2541-7517-2023-21-1-105-126.

Full text
Abstract:
The paper aims to unfold the «internal» content of Gettier’s argument as a skeptical argument against knowledge in terms of answering the question: «why he could be right when he says what he says». Our initial hypothesis is that E. Gettier does not say anything about the «accidentality of the fact that Smith has 10 coins in his pocket», but he uses the words «entailment» and «deduction», which substantiates the «truth of the conclusion», and on the basis of which he attributes «knowledge» to Smith. The article comes out at a certain time, E. Gettier uses the rhetoric of necessary and sufficie
APA, Harvard, Vancouver, ISO, and other styles
46

Du, Jianfeng, Jeff Z. Pan, Sylvia Wang, Kunxun Qi, Yuming Shen, and Yu Deng. "Validation of Growing Knowledge Graphs by Abductive Text Evidences." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2784–91. http://dx.doi.org/10.1609/aaai.v33i01.33012784.

Full text
Abstract:
This paper proposes a validation mechanism for newly added triples in a growing knowledge graph. Given a logical theory, a knowledge graph, a text corpus, and a new triple to be validated, this mechanism computes a sorted list of explanations for the new triple to facilitate the validation of it, where an explanation, called an abductive text evidence, is a set of pairs of the form (triple, window) where appending the set of triples on the left to the knowledge graph enforces entailment of the new triple under the logical theory, while every sentence window on the right which is contained in t
APA, Harvard, Vancouver, ISO, and other styles
47

Hanke, Miroslav. "Scholastická logika „vědění“ III." Studia Neoaristotelica 18, no. 3 (2021): 1–107. http://dx.doi.org/10.5840/studneoar202118310.

Full text
Abstract:
The problem of logical omniscience breaks down to the problems of the closure of knowledge under implication and of the distribution of knowledge over implication. In late medieval scholasticism these two related issues were engaged in various genres, in particular in general analysis of validity, games of obligationes, solution to self-referential antinomies and semantics of terms. The present study analyses the corpus of fourteenth-century texts with some overreaches to the subsequent two centuries, attempting to cover representatives of both the “British” and the “Continental” tradition. Wi
APA, Harvard, Vancouver, ISO, and other styles
48

Gimeno-Simó, Joan. "On how to legitimately constrain a semantic theory." Semiotica 2021, no. 240 (2021): 97–127. http://dx.doi.org/10.1515/sem-2021-0014.

Full text
Abstract:
Abstract Semanticists often restrict their theories by imposing constraints on the parameters that can be employed for interpreting the expressions of a language. Such constraints are based on non-logical features of actual contexts of utterance, but they often have important effects on issues that do pertain to logic, like analyticity or entailment. For example, Kaplan’s restriction to so-called “proper contexts” was required in order to count “I am here now” as valid. In this paper I argue that constraints of this kind are often posited in an arbitrary and non-consistent way, and that they y
APA, Harvard, Vancouver, ISO, and other styles
49

Gardner, Philippa. "Equivalences between logics and their representing type theories." Mathematical Structures in Computer Science 5, no. 3 (1995): 323–49. http://dx.doi.org/10.1017/s0960129500000785.

Full text
Abstract:
We propose a new framework for representing logics, called LF+, which is based on the Edinburgh Logical Framework. The new framework allows us to give, apparently for the first time, general definitions that capture how well a logic has been represented. These definitions are possible because we are able to distinguish in a generic way that part of the LF+ entailment corresponding to the underlying logic. This distinction does not seem to be possible with other frameworks. Using our definitions, we show that, for example, natural deduction first-order logic can be well-represented in LF+, wher
APA, Harvard, Vancouver, ISO, and other styles
50

Sabharwal, Chaman L., and Jennifer L. Leopold. "Evolution of Region Connection Calculus to VRCC-3D+." New Mathematics and Natural Computation 10, no. 02 (2014): 103–41. http://dx.doi.org/10.1142/s1793005714500069.

Full text
Abstract:
Qualitative spatial reasoning (QSR) is useful for deriving logical inferences when quantitative spatial information is not available. QSR theories have applications in areas such as geographic information systems, spatial databases, robotics, and cognitive sciences. The existing QSR theories have been applied primarily to 2D. The ability to perform QSR over a collection of 3D objects is desirable in many problem domains. Here we present the evolution (VRCC-3D+) of RCC-based QSR from 2D to both 3D (including occlusion support) and 4D (a temporal component). It is time consuming to construct lar
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!