Relevant bibliographies by topics / Logical entailment

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Logical entailment'

Author: Grafiati
Published: 10 December 2022
Last updated: 31 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Logical entailment"

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
More sources

Dissertations / Theses on the topic "Logical entailment"

1

Erickson, Evelyn Fernandes. "An investigation of logical pluralism and b-entailment." PROGRAMA DE P?S-GRADUA??O EM FILOSOFIA, 2016. https://repositorio.ufrn.br/jspui/handle/123456789/22409.

Full text
Abstract:
Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-03-20T21:03:00Z No. of bitstreams: 1 EvelynFernandesErickson_DISSERT.pdf: 706523 bytes, checksum: 8adb88738bde33540238e2807b96f5f4 (MD5)<br>Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-03-23T00:17:48Z (GMT) No. of bitstreams: 1 EvelynFernandesErickson_DISSERT.pdf: 706523 bytes, checksum: 8adb88738bde33540238e2807b96f5f4 (MD5)<br>Made available in DSpace on 2017-03-23T00:17:48Z (GMT). No. of bitstreams: 1 EvelynFernandesErickson_DISSERT.pdf: 706523 bytes, checksum: 8adb88738bd
APA, Harvard, Vancouver, ISO, and other styles
2

Fjellstad, Andreas. "Transparency, transitivity or reflexivity." Thesis, University of Aberdeen, 2015. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=228553.

Full text
Abstract:
This thesis investigates logico-philosophical aspects of using either a non-transitive or a non-reflexive logic to obtain a logic of truth in which truth is transparent. It enquires into and rejects the claim that restricting transitivity of entailment to accommodate transparent truth suffices to make the connective tonk acceptable by arguing that tonk as defined in a cut-free sequent calculus requires in addition that the logic is non-reflexive to be uniquely defined, and develops a semantics for tonk based on models with two valuations which delivers a non-transitive and non-reflexive logic.
APA, Harvard, Vancouver, ISO, and other styles
3

Dickson, Mark Lloyd. "Irreducible complexity as a nexus for an interdisciplinary dialogue between machine logic, molecular biology and theology / by M.L. Dickson." Thesis, North-West University, 2007. http://hdl.handle.net/10394/740.

Full text
Abstract:
The claim that a principle known as Irreducible Complexity (IC) is empirically discoverable is investigated successively from the perspective of engineering, then molecular biology and finally theology, with the aim of evaluating the utility of IC for an interdisciplinary dialogue between all three. In the process, IC is subjected to the principle objections presented against it in the literature, leading to the conclusion that IC is sufficiently resistant to scientific criticism to be accepted as a true property of certain living systems. The ubiquity of machine descriptors in the professiona
APA, Harvard, Vancouver, ISO, and other styles
4

Van, der Vyver Thelma. "Proof systems for propositional modal logic." Diss., 1997. http://hdl.handle.net/10500/16280.

Full text
Abstract:
In classical propositional logic (CPL) logical reasoning is formalised as logical entailment and can be computed by means of tableau and resolution proof procedures. Unfortunately CPL is not expressive enough and using first order logic (FOL) does not solve the problem either since proof procedures for these logics are not decidable. Modal propositional logics (MPL) on the other hand are both decidable and more expressive than CPL. It therefore seems reasonable to apply tableau and resolution proof systems to MPL in order to compute logical entailment in MPL. Although some of the principles in
APA, Harvard, Vancouver, ISO, and other styles
5

Siblini, Reda. "Recognizing Textual Entailment Using Description Logic And Semantic Relatedness." Thesis, 2014. http://spectrum.library.concordia.ca/978489/1/Siblini_PhD_S2014.pdf.

Full text
Abstract:
Textual entailment (TE) is a relation that holds between two pieces of text where one reading the first piece can conclude that the second is most likely true. Accurate approaches for textual entailment can be beneficial to various natural language processing (NLP) applications such as: question answering, information extraction, summarization, and even machine translation. For this reason, research on textual entailment has attracted a significant amount of attention in recent years. A robust logical-based meaning representation of text is very hard to build, therefore the majority of textual
APA, Harvard, Vancouver, ISO, and other styles
6

Chang, Fu-Chieh, and 張富傑. "A Formal Logic Approach to Chinese Recognizing Textual Entailment." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/68400557821193296503.

Full text
Abstract:
碩士<br>國立臺灣大學<br>電子工程學研究所<br>102<br>In the research of natural language processing (NLP), understanding the natural language is always a challenging problem. Traditionally, the research of NLP focuses on the semantics and logic of natural language. However, the present NLP research trend is focusing on the big data and machine learning techniques. These two methods have their own pros and cons; however, the traditional research of semantics and logic are seldom discussed in the recent works, and the existing machine learning techniques also have their limitations. Combining the traditional work
APA, Harvard, Vancouver, ISO, and other styles
7

McQueen, Kelvin James. "A priori entailment and the metaphysics of science." Phd thesis, 2013. http://hdl.handle.net/1885/155983.

Full text
Abstract:
In this dissertation I develop a framework for evaluating theories of fundamental reality and a related framework for evaluating reductive explanations. The former is the A Priori Entailment thesis (AET), which states that all truths are a priori deducible from the fundamental truths. The latter is the Reduction Entailment thesis (RET), which states that a successful and complete reductive explanation requires that the explanandum is a priori deducible from the explanans. After defending AET/RET I use them to resolve disputes in quantum metaphysics. The dissertation is split into four chapters
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Logical entailment"

1

Burchardt, Aljoscha. Modeling textual entailment with role-semantic information. German Research Center for Artifical Intelligence, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

1930-, Belnap Nuel D., and Dunn J. Michael 1941-, eds. Entailment: The logic of relevance and necessity. 2nd ed. Princeton University Press, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sidorenko, E. A. Relevantnai︠a︡ logika: Predposylki, ischislenii︠a︡, semantika. IFRAN, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Patterson, Richard. Aristotle's modal logic: Essence and entailment in the Organon. Cambridge University Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zaĭt︠s︡ev, D. V. Obobshchennai︠a︡ relevantnai︠a︡ logika i modeli rassuzhdeniĭ: Monografii︠a︡. Kreativnai︠a︡ ėkonomika, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Burgess, John P. No Requirement of Relevance. Edited by Stewart Shapiro. Oxford University Press, 2009. http://dx.doi.org/10.1093/oxfordhb/9780195325928.003.0024.

Full text
Abstract:
Classic logic defines entailment to hold between a premise (or set of premises) and a conclusion if and only if their logical form guarantees that either the premise (or at least one element of the set of premises) is false, or the conclusion is true. The definition obliges the logician to recognize certain degenerate entailments. A premise (or set of premises) that is contradictory in the sense that its logical form guarantees that it is false (or that at least one element of the set of is false) entails any conclusion: ex falso quodlibet. And a conclusion that is tautologous in the sense tha
APA, Harvard, Vancouver, ISO, and other styles
7

Russell, Gillian K. Barriers to Entailment: Hume's Law and Other Limits on Logical Consequence. Oxford University Press, 2023.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Belnap, Nuel D., J. Michael Dunn, and Alan Ross Anderson. Entailment. Princeton Univ Pr, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Holliday, Wesley H., and Thomas F. III Icard. Axiomatization in the Meaning Sciences. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198739548.003.0002.

Full text
Abstract:
While much of semantic theorizing is based on intuitions about logical phenomena associated with linguistic constructions—phenomena such as consistency and entailment—it is rare to see axiomatic treatments of linguistic fragments. Given a fragment interpreted in some class of formally specified models, it is often possible to ask for a characterization of the reasoning patterns validated by the class of models. Axiomatizations provide such a characterization, often in a perspicuous and efficient manner. This chapter highlights some of the benefits of providing axiomatizations for the purpose o
APA, Harvard, Vancouver, ISO, and other styles
10

Crupi, Vincenzo, and Katya Tentori. Confirmation Theory. Edited by Alan Hájek and Christopher Hitchcock. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780199607617.013.33.

Full text
Abstract:
We first discuss several qualitative properties of confirmation as analyzed in a probabilistic framework. Some of these properties are classical, while others are relatively novel; some are shared by absolute and incremental confirmation, others are distinctive for each kind. We then proceed to address axiomatic characterizations of major classes of probabilistic measures of incremental confirmation. This treatment includes an original result displaying how conditions which single out the traditional probability difference measure up to ordinal equivalence. Finally, we argue that the longstand
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Logical entailment"

1

Ambrose, Alice. "On Entailment and Logical Necessity*." In Essays in Analysis. Routledge, 2023. http://dx.doi.org/10.4324/9781032641768-6.

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

Ciardelli, Ivano. "Relations with Dependence Logic." In Trends in Logic. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09706-5_7.

Full text
Abstract:
AbstractWe saw how by bringing questions into play in logic we can capture dependency relations as cases of (contextual or logical) entailment, and we can analyze such relations using standard tools of logic.
APA, Harvard, Vancouver, ISO, and other styles
3

Ciardelli, Ivano. "Foundations of Inquisitive Logic." In Trends in Logic. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09706-5_2.

Full text
Abstract:
AbstractIn this chapter, we lay the foundations for our enterprise. In particular, we explain how an information-based semantics, inquisitive semantics, allows us to interpret statements and questions in a uniform way and to define a general notion of entailment in which questions can occur as premises and conclusions. We explore in detail the significance of this generalized notion of entailment, showing in particular that it captures as a special case an important logical notion that we call dependency. We explain how questions can be viewed as denoting information types and how inquisitive
APA, Harvard, Vancouver, ISO, and other styles
4

Bos, Johan, and Katja Markert. "Recognising Textual Entailment with Robust Logical Inference." In Machine Learning Challenges. Evaluating Predictive Uncertainty, Visual Object Classification, and Recognising Tectual Entailment. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11736790_23.

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

Levine, Michael P. "Miracles and the Logical Entailment Analysis of Causation." In Hume and the Problem of Miracles: A Solution. Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-2245-7_5.

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

Bochman, Alexander. "Prolegomena to a Theory of Defeasible Entailment." In A Logical Theory of Nonmonotonic Inference and Belief Change. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04560-2_8.

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

Caleiro, Carlos, Sérgio Marcelino, and Umberto Rivieccio. "Some More Theorems on Structural Entailment Relations and Non-deterministic Semantics." In Janusz Czelakowski on Logical Consequence. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-44490-6_12.

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

Alrabbaa, Christian, Franz Baader, Stefan Borgwardt, Raimund Dachselt, Patrick Koopmann, and Julián Méndez. "Evonne: Interactive Proof Visualization for Description Logics (System Description)." In Automated Reasoning. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_16.

Full text
Abstract:
AbstractExplanations for description logic (DL) entailments provide important support for the maintenance of large ontologies. The “justifications” usually employed for this purpose in ontology editors pinpoint the parts of the ontology responsible for a given entailment. Proofs for entailments make the intermediate reasoning steps explicit, and thus explain how a consequence can actually be derived. We present an interactive system for exploring description logic proofs, called Evonne, which visualizes proofs of consequences for ontologies written in expressive DLs. We describe the methods us
APA, Harvard, Vancouver, ISO, and other styles
9

Bozga, Marius, Lucas Bueri, and Radu Iosif. "Decision Problems in a Logic for Reasoning About Reconfigurable Distributed Systems." In Automated Reasoning. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_40.

Full text
Abstract:
AbstractWe consider a logic used to describe sets of configurations of distributed systems, whose network topologies can be changed at runtime, by reconfiguration programs. The logic uses inductive definitions to describe networks with an unbounded number of components and interactions, written using a multiplicative conjunction, reminiscent of Bunched Implications [37] and Separation Logic [39]. We study the complexity of the satisfiability and entailment problems for the configuration logic under consideration. Additionally, we consider the robustness property of degree boundedness (is every
APA, Harvard, Vancouver, ISO, and other styles
10

Echenim, Mnacho, Radu Iosif, and Nicolas Peltier. "Unifying Decidable Entailments in Separation Logic with Inductive Definitions." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_11.

Full text
Abstract:
AbstractThe entailment problem $$\upvarphi \models \uppsi $$ φ ⊧ ψ in Separation Logic [12, 15], between separated conjunctions of equational ($$x \approx y$$ x ≈ y and $$x \not \approx y$$ x ≉ y ), spatial ($$x \mapsto (y_1,\ldots ,y_\upkappa )$$ x ↦ ( y 1 , … , y κ ) ) and predicate ($$p(x_1,\ldots ,x_n)$$ p ( x 1 , … , x n ) ) atoms, interpreted by a finite set of inductive rules, is undecidable in general. Certain restrictions on the set of inductive definitions lead to decidable classes of entailment problems. Currently, there are two such decidable classes, based on two restrictions, cal
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Logical entailment"

1

Arieli, Ofer, Kees van Berkel, Badran Raddaoui, and Christian Strasser. "Deontic Reasoning Based on Inconsistency Measures." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/7.

Full text
Abstract:
Conflicts are inherent to normative systems. In this paper, we explore a novel approach to normative reasoning by quantifying the amount of conflicts within normative systems. We refine the idea from classical logic, according to which a formula is a consequence of a knowledge base in case its negation renders the knowledge base inconsistent. In our approach, whether a formula is a logical consequence depends, for instance, on its negation's marginal contribution to the inconsistency of the given knowledge base. Accordingly, various inconsistency measures and corresponding (nonmonotonic and pa
APA, Harvard, Vancouver, ISO, and other styles
2

Tatevosov, Sergei, and Olga Fedorova. "Causative-Inchoative Entailment and the Logical Structure of Accomplishments in Kumyk." In 2024 IEEE 3rd International Conference on Problems of Informatics, Electronics and Radio Engineering (PIERE). IEEE, 2024. https://doi.org/10.1109/piere62470.2024.10805037.

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

Hirschbrunn, Joshua, and Yevgeny Kazakov. "Extending Description Logics with Generic Concepts – the Tale of Two Semantics." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/43.

Full text
Abstract:
Description Logic (DL) ontologies often need to model similar properties for different concepts. Taking inspiration from generic classes in object-oriented programming, we introduce concept parameters to describe related concepts. For example, LocalAnesthesia[Eye] and LocalAnesthesia[Knee] can be used to describe the anesthesia of an eye or a knee, respectively. The main benefit of generic concepts is to be able to describe general properties, for example, that every local anesthesia is done by applying an anesthetic drug. We propose to use generic concepts, such as LocalAnesthesia[X] to defin
APA, Harvard, Vancouver, ISO, and other styles
4

Alrabbaa, Christian, Stefan Borgwardt, Tom Friese, et al. "Explaining Reasoning Results for OWL Ontologies with Evee." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/67.

Full text
Abstract:
One of the advantages of formalizing domain knowledge in OWL ontologies is that one can use reasoning systems to infer implicit information automatically. However, it is not always straightforward to understand why certain entailments are inferred, and others are not. The popular ontology editor Protégé offers two explanation services to deal with this issue: justifications for OWL 2 DL ontologies, and proofs generated by the reasoner ELK for lightweight OWL 2 EL ontologies. Since justifications are often insufficient for explaining inferences, there is thus only little tool support for more c
APA, Harvard, Vancouver, ISO, and other styles
5

Bos, Johan, and Katja Markert. "Recognising textual entailment with logical inference." In the conference. Association for Computational Linguistics, 2005. http://dx.doi.org/10.3115/1220575.1220654.

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

Arieli, Ofer, AnneMarie Borg, and Christian Straßer. "Characterizations and Classifications of Argumentative Entailments." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/6.

Full text
Abstract:
In this paper we provide a detailed analysis of the inference process induced by logical argumentation frameworks. The frameworks may be defined with respect to any propositional language and logic, different arguments that represent deductions in the logic, various support-based attack relations between arguments, and all the complete Dung-style semantics for the frameworks. We show that, ultimately, for characterizing the inference process with respect to a given framework, extension-based semantics may be divided into two types: single-extension and multiple-extension, which induce respecti
APA, Harvard, Vancouver, ISO, and other styles
7

Suzuki, Riko, Hitomi Yanaka, Masashi Yoshikawa, Koji Mineshima, and Daisuke Bekki. "Multimodal Logical Inference System for Visual-Textual Entailment." In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop. Association for Computational Linguistics, 2019. http://dx.doi.org/10.18653/v1/p19-2054.

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

Roth, Dan, and Mark Sammons. "Semantic and logical inference model for textual entailment." In the ACL-PASCAL Workshop. Association for Computational Linguistics, 2007. http://dx.doi.org/10.3115/1654536.1654558.

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

Schwering, Christoph. "A Reasoning System for a First-Order Logic of Limited Belief." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/173.

Full text
Abstract:
Logics of limited belief aim at enabling computationally feasible reasoning in highly expressive representation languages. These languages are often dialects of first-order logic with a weaker form of logical entailment that keeps reasoning decidable or even tractable. While a number of such logics have been proposed in the past, they tend to remain for theoretical analysis only and their practical relevance is very limited. In this paper, we aim to go beyond the theory. Building on earlier work by Liu, Lakemeyer, and Levesque, we develop a logic of limited belief that is highly expressive but
APA, Harvard, Vancouver, ISO, and other styles
10

Lyon, Tim S., and Piotr Ostropolski-Nalewaja. "Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/79.

Full text
Abstract:
Chase algorithms are indispensable in the domain of knowledge base querying, which enable the extraction of implicit knowledge from a given database via applications of rules from a given ontology. Such algorithms have proved beneficial in identifying logical languages which admit decidable query entailment. Within the discipline of proof theory, sequent calculi have been used to write and design proof-search algorithms to identify decidable classes of logics. In this paper, we show that the chase mechanism in the context of existential rules is in essence the same as proof-search in an extens
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Logical entailment"

1

Borgwardt, Stefan. Concise Justifications Versus Detailed Proofs for Description Logic Entailments. Technische Universität Dresden, 2021. http://dx.doi.org/10.25368/2023.225.

Full text
Abstract:
We discuss explanations in Description Logics (DLs), a family of logics used for knowledge representation. Initial work on explaining consequences for DLs had focused on justifications, which are minimal subsets of axioms that entail the consequence. More recently, it was proposed that proofs can provide more detailed information about why a consequence follows. Moreover, several measures have been proposed to estimate the comprehensibility of justifications and proofs, for example, their size or the complexity of logical expressions. In this paper, we analyze the connection between these meas
APA, Harvard, Vancouver, ISO, and other styles
2

Koopmann, Patrick. Actions with Conjunctive Queries: Projection, Conflict Detection and Verification. Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.243.

Full text
Abstract:
Description Logic actions specify adaptations of description logic interpretations based on some preconditions defined using a description logic. We consider DL actions in which preconditions can be specified using DL axioms as well as using conjunctive queries, and combinatiosn thereof. We investigate complexity bounds for the executability and the projection problem for these actions, which respectively ask whether an action can be executed on models of an interpretation, and which entailments are satisfied after an action has been executed on this model. In addition, we consider a set of ne
APA, Harvard, Vancouver, ISO, and other styles
3

Bamber, D. A Characterization of Probabilistic Entailment in Adams' Logic of Conditionals. Defense Technical Information Center, 1995. http://dx.doi.org/10.21236/ada301476.

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

Borgwardt, Stefan, and Veronika Thost. Temporal Query Answering in DL-Lite with Negation. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.221.

Full text
Abstract:
Ontology-based query answering augments classical query answering in databases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We investigate temporal query answering w.r.t. ontologies formulated in DL-Lite, a family of description logics that captures the conceptual features of relational databases and was tailored for efficient query answering. We consider a recently proposed temporal query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL). In particular, we consider negation in the onto
APA, Harvard, Vancouver, ISO, and other styles
5

Koopmann, Patrick, and Jieying Chen. Deductive Module Extraction for Expressive Description Logics (Extended Version). Technische Universität Dresden, 2020. http://dx.doi.org/10.25368/2022.262.

Full text
Abstract:
In deductive module extraction, we determine a small subset of an ontology for a given vocabulary that preserves all logical entailments that can be expressed in that vocabulary. While in the literature stronger module notions have been discussed, we argue that for applications in ontology analysis and ontology reuse, deductive modules, which are decidable and potentially smaller, are often sufficient. We present methods based on uniform interpolation for extracting different variants of deductive modules, satisfying properties such as completeness, minimality and robustness under replacements
APA, Harvard, Vancouver, ISO, and other styles
6

Baader, Franz, Stefan Borgwardt, and Marcel Lippmann. Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.222.

Full text
Abstract:
In Ontology-Based Data Access (OBDA), user queries are evaluated over a set of facts under the open world assumption, while taking into account background knowledge given in the form of a Description Logic (DL) ontology. Motivated by situation awareness applications, temporal conjunctive queries (TCQs) have recently been proposed as a useful extension of traditional OBDA to support the processing of temporal information. This paper extends the existing complexity analysis of TCQ entailment to very expressive DLs underlying the OWL 2 standard, and in contrast to previous work also allows for qu
APA, Harvard, Vancouver, ISO, and other styles
7

Baader, Franz, Stefan Borgwardt, and Marcel Lippmann. On the Complexity of Temporal Query Answering. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.191.

Full text
Abstract:
Ontology-based data access (OBDA) generalizes query answering in databases towards deduction since (i) the fact base is not assumed to contain complete knowledge (i.e., there is no closed world assumption), and (ii) the interpretation of the predicates occurring in the queries is constrained by axioms of an ontology. OBDA has been investigated in detail for the case where the ontology is expressed by an appropriate Description Logic (DL) and the queries are conjunctive queries. Motivated by situation awareness applications, we investigate an extension of OBDA to the temporal case. As query lan
APA, Harvard, Vancouver, ISO, and other styles
8

Borgwardt, Stefan, and Veronika Thost. Temporal Query Answering in EL. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.214.

Full text
Abstract:
Context-aware systems use data about their environment for adaptation at runtime, e.g., for optimization of power consumption or user experience. Ontology-based data access (OBDA) can be used to support the interpretation of the usually large amounts of data. OBDA augments query answering in databases by dropping the closed-world assumption (i.e., the data is not assumed to be complete any more) and by including domain knowledge provided by an ontology. We focus on a recently proposed temporalized query language that allows to combine conjunctive queries with the operators of the well-known pr
APA, Harvard, Vancouver, ISO, and other styles
9

Borgwardt, Stefan, Walter Forkel, and Alisa Kovtunova. Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.223.

Full text
Abstract:
Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language ELH⊥, which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a com
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Logical entailment' for particular source types:
Journal articles Books
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!

To the bibliography