Academic literature on the topic 'Relevant logic'

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 'Relevant logic.'

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 "Relevant logic"

1

Standefer, Shawn. "Tracking reasons with extensions of relevant logics." Logic Journal of the IGPL 27, no. 4 (June 25, 2019): 543–69. http://dx.doi.org/10.1093/jigpal/jzz018.

Full text
Abstract:
Abstract In relevant logics, necessary truths need not imply each other. In justification logic, necessary truths need not all be justified by the same reason. There is an affinity to these two approaches that suggests their pairing will provide good logics for tracking reasons in a fine-grained way. In this paper, I will show how to extend relevant logics with some of the basic operators of justification logic in order to track justifications or reasons. I will define and study three kinds of frames for these logics. For the first kind of frame, I show soundness and highlight a difficulty in proving completeness. This motivates two alternative kinds of frames, with respect to which completeness results are obtained. Axioms to strengthen the justification logic portions of these logics are considered. I close by developing an analogy between the dot operator of justification logic and theory fusion in relevant logics.
APA, Harvard, Vancouver, ISO, and other styles
2

Ciuni, Roberto, Damian Szmuc, and Thomas Macaulay Ferguson. "Relevant Logics Obeying Component Homogeneity." Australasian Journal of Logic 15, no. 2 (July 4, 2018): 301. http://dx.doi.org/10.26686/ajl.v15i2.4864.

Full text
Abstract:
This paper discusses three relevant logics (S*fde , dS*fde , crossS*fde) that obey Component Homogeneity - a principle that Goddard and Routley introduce in their project of a logic of significance. The paper establishes two main results. First, it establishes a general characterization result for two families of logic that obey Component Homogeneity - that is, we provide a set of necessary and sufficient conditions for their consequence relations. From this, we derive characterization results for S*fde , dS*fde , crossS*fde. Second, the paper establishes complete sequent calculi for S*fde , dS*fde , crossS*fde. Among the other accomplishments of the paper, we generalize the semantics from Bochvar, Hallden, Deutsch and Daniels, we provide a general recipe to define (a given family of) containment logics, we explore the single-premise/single-conclusion fragment of S*fde , dS*fde , crossS*fde and the connections between crossS*fde and the logic Eq of equality by Epstein. Also, we present S*fde as a relevant logic of meaninglessness that follows the main philosophical tenets of Goddard and Routley, and we briefly examine three further systems that are closely related to our main logics. Finally, we discuss Routley's criticism to containment logic in light of our results, and overview some open issues.
APA, Harvard, Vancouver, ISO, and other styles
3

FRANCEZ, NISSIM. "BILATERAL RELEVANT LOGIC." Review of Symbolic Logic 7, no. 2 (April 16, 2014): 250–72. http://dx.doi.org/10.1017/s1755020314000082.

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

Bollen, A. W. "Relevant logic programming." Journal of Automated Reasoning 7, no. 4 (December 1991): 563–85. http://dx.doi.org/10.1007/bf01880329.

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

Strong, Gary W. "Phase logic is biologically relevant logic." Behavioral and Brain Sciences 16, no. 3 (September 1993): 472–73. http://dx.doi.org/10.1017/s0140525x00031174.

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

Swirydowicz, Kazimierz. "There exist exactly two maximal strictly relevant extensions of the relevant logic R." Journal of Symbolic Logic 64, no. 3 (September 1999): 1125–54. http://dx.doi.org/10.2307/2586622.

Full text
Abstract:
AbstractIn [60] N. Belnap presented an 8-element matrix for the relevant logic R with the following property: if in an implication A → B the formulas A and B do not have a common variable then there exists a valuation v such that v (A → B) does not belong to the set of designated elements of this matrix. A 6-element matrix of this kind can be found in: R. Routley, R.K. Meyer, V. Plumwood and R.T. Brady [82], Below we prove that the logics generated by these two matrices are the only maximal extensions of the relevant logic R which have the relevance property: if A → B is provable in such a logic then A and B have a common propositional variable.
APA, Harvard, Vancouver, ISO, and other styles
7

Orlowska, Ewa. "Relational proof system for relevant logics." Journal of Symbolic Logic 57, no. 4 (December 1992): 1425–40. http://dx.doi.org/10.2307/2275375.

Full text
Abstract:
AbstractA method is presented for constructing natural deduction-style systems for propositional relevant logics. The method consists in first translating formulas of relevant logics into ternary relations, and then defining deduction rules for a corresponding logic of ternary relations. Proof systems of that form are given for various relevant logics. A class of algebras of ternary relations is introduced that provides a relation-algebraic semantics for relevant logics.
APA, Harvard, Vancouver, ISO, and other styles
8

Garson, James. "Modularity and relevant logic." Notre Dame Journal of Formal Logic 30, no. 2 (March 1989): 207–23. http://dx.doi.org/10.1305/ndjfl/1093635079.

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

Brady, Ross T. "Gentzenizations of relevant logics with distribution." Journal of Symbolic Logic 61, no. 2 (June 1996): 402–20. http://dx.doi.org/10.2307/2275668.

Full text
Abstract:
We establish cut-free left-handed Gentzenizations for a range of major relevant logics from B through to R, all with distribution. B is the basic system of the Routley-Meyer semantics (see [15], pp. 287–300) and R is the logic of relevant implication (see [1], p. 341). Previously, the contractionless logics DW, TW, EW, RW and RWK were Gentzenized in [3], [4] and [5], and also the distributionless logics LBQ, LDWQ, LTWQo, LEWQot, LRWQ, LRWKQ and LRQ in [6] and [7]. This paper provides Gentzenizations for the logics DJ, TJ, T and R, with various levels of contraction, and for the contractionless logic B, which could not be included in [4] using the technique developed there. We also include the Gentzenization of TW in order to compare it with that in [4]. The Gentzenizations that we obtain here for DW and RW are inferior to those already obtained in [4], but they are included for reference when constructing other systems. The logics EW and E present a difficulty for our method and are omitted. For background to the Gentzenization of relevant logics, see [6], and for motivation behind the logics involved, see [6], [1] and [15]. Because of the number of properties that are brought to bear in obtaining these systems, we prefer to consider Gentzenizations for particular logics rather than for arbitrary bunches of axioms.
APA, Harvard, Vancouver, ISO, and other styles
10

Zaverucha, Gerson. "Relevant logic as a basis for paraconsistent epistemic logics." Journal of Applied Non-Classical Logics 2, no. 2 (January 1992): 225–41. http://dx.doi.org/10.1080/11663081.1992.10510783.

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

Dissertations / Theses on the topic "Relevant logic"

1

Ishtiaq, Samin. "A relevant analysis of natural deduction." Thesis, Queen Mary, University of London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.246668.

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

Zaverucha, Gerson. "A nonmonotonic multi-agent logic of belief : a Modal Defeasible Relevant approach." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46629.

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

Slater, Andrew, and andrew slater@csl anu edu au. "Investigations into Satisfiability Search." The Australian National University. Research School of Information Sciences and Engineering, 2003. http://thesis.anu.edu.au./public/adt-ANU20040310.103258.

Full text
Abstract:
In this dissertation we investigate theoretical aspects of some practical approaches used in solving and understanding search problems. We concentrate on the Satisfiability problem, which is a strong representative from search problem domains. The work develops general theoretical foundations to investigate some practical aspects of satisfiability search. This results in a better understanding of the fundamental mechanics for search algorithm construction and behaviour. A theory of choice or branching heuristics is presented, accompanied by results showing a correspondence of both parameterisations and performance when the method is compared to previous empirically motivated branching techniques. The logical foundations of the backtracking mechanism are explored alongside formulations for reasoning in relevant logics which results in the development of a malleable backtracking mechanism that subsumes other intelligent backtracking proof construction techniques and allows the incorporation of proof rearrangement strategies. Moreover, empirical tests show that relevant backtracking outperforms all other forms of intelligent backtracking search tree construction methods. An investigation into modelling and generating world problem instances justifies a modularised problem model proposal which is used experimentally to highlight the practicability of search algorithms for the proposed model and related domains.
APA, Harvard, Vancouver, ISO, and other styles
4

Dam, Mads F. "Relevance logic and concurrent composition." Thesis, University of Edinburgh, 1990. http://hdl.handle.net/1842/414.

Full text
Abstract:
Compositionality, i.e. that properties of composite systems are deduced in terms of those of their immediate constituents, is crucial to the tractability and practical usefulness of program logics. A general technique for obtaining this for parallel composition appeals to a relativisation of properties with respect to properties of parallel environments. This induces a notion of consequence on properties which will in general be a relevant one. Based on this observation we suggest using modal or temporal extensions of relevance logics to build compositional logics for processes. We investigate the general model theory of propositional relevance logic and introduce a notion of model based on semilattices with an inf-preserving binary operation. We present a number of correspondence and completeness results, investigate the relationship to Sylvan and Meyer's ternary model, and present concrete models based on Milner's SCCS. To account for dynamic behaviour a modal extension of linear logic is introduced, interpreted over models extended by prefixing in the style of CCS/SCCS. We show a variety of characterisation results, relating models to processes under testing preorders, and obtain completeness results, first for the general algebraically based interpretations and next for the process-based ones giving, for the latter, procedures for deciding validity and satisfiability of formulas. From a computational point of view the processes considered are unacceptably weak in that they lack a suitable notion of external, or controllable, choice. To remedy this we consider indexed modal models under weak preorders, generalising notions of process equivalence such as testing and failures equivalence. We give characterisations of these in terms of modal logic and axiomatise the logics obtained. Relevant extensions of these logics are introduced, interpreted over model classes on which a parallel composition is defined. We axiomatise the logics obtained, giving decision procedures as before, and conclude by specialising the results to testing equivalence and synchronous parallel composition.
APA, Harvard, Vancouver, ISO, and other styles
5

Cosijn, Erica. "Relevance judgements in information retrieval." Thesis, Pretoria [s.n.], 2003. http://upetd.up.ac.za/thesis/available/etd-09192005-145624/.

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

Ferrar, Madeleine. "The logic of the ludicrous : a pragmatic study of humour." Thesis, University College London (University of London), 1993. http://discovery.ucl.ac.uk/1317896/.

Full text
Abstract:
This thesis represents an attempt to show how recent research in pragmatic theory can contribute to our understanding of humour. Two inferential theories have been selected: speech act theory and relevance theory. In addition, I have looked at the modification of the speech act model proposed by Leech. An exposition of each theory is followed by an account of how these theories can be applied to humour. Some research into humour has already been carried out using the speech act model. This is described and evaluated. For Leech's extension of that model, and for the relevance-theoretic model, there is virtually no existing research on which to draw. Consequently, both the application of these theories to humour, and their evaluation thereof, are my own. Speech act accounts of humour are based on the notion that humorous utterances are unconventional and unpredictable. One way of exploiting our expectations, and thereby creating a condo effect, it is argued, is to violate the norms of conversation (that is to say, Grice's maxims and Searle's conditions). This analysis is found to be insufficient, on its own, to distinguish between the humorous and the non-humorous utterance. I will show how the unpredictable, unconventional remark can be used to create a number of different effects, some humorous, some nonhumorous. Maxim violation is thus seen to be inadequate, both as a descriptive and as an explanatory tool. Relevance theory constitutes a radical departure from the whole maxim-based framework. Adopting this approach to the analysis of verbal humour, I will try to find out exactly what is going on in our minds when we interpret humorously intended utterances. I will identify the various processes which I believe are employed in the appreciation of verbal jokes, and will conclude that these processes are not unique to humour. In spite of this, I will claim that there is a sense in which verbal humour can be said to be unique.
APA, Harvard, Vancouver, ISO, and other styles
7

Wannenburg, Johann Joubert. "On the algebra of relevance logics." Diss., University of Pretoria, 2016. http://hdl.handle.net/2263/60869.

Full text
Abstract:
After recalling some prerequisites from universal algebra in Chapter 1, we recount in Chapter 2 the general theory of deductive (logical) systems. As working examples, we consider the exponential-free fragment CLL of linear logic and some of its extensions, notably the relevance logic Rt and its fragment R (which lacks a sentential `truth' constant t of Rt). In Chapter 2, we focus on what it means for two deductive systems to be equivalent (in the sense of abstract algebraic logic). To be algebraizable is to be equivalent to the equational consequence relation j=K of some class K of pure algebras. This phenomenon, rst investigated in [11], is explored in detail in Chapter 3, and nearly all of the well-known algebraization results for familiar logics can be viewed as instances of it. For example, CLL is algebraized by the variety of involutive residuated lattices. The algebraization of stronger logics is then a matter of restriction. In particular, Rt corresponds in this way to the variety DMM of De Morgan monoids, which is studied in Chapter 4. Moreover, the subvarieties of DMM algebraize the axiomatic extensions of Rt. The lattice of axiomatic extensions of Rt is naturally of logical interest, but our perspective allows us to view its structure through an entirely algebraic lens: it is interchangeable with the subvariety lattice of DMM. The latter is susceptible to the methods of universal algebra. Exploiting this fact in Chapter 5, we determine (and axiomatize) the minimal subvarieties of DMM, of which, as it happens, there are just four. It follows immediately that Rt has just four maximal consistent axiomatic extensions; they are described transparently. These results do not appear to be in the published literature of relevance logic (perhaps for philosophical reasons relating to the status of the constant t). The new ndings of Chapter 5 allow us to give, in Chapter 6, a simpler proof of a theorem of K. Swirydowicz [59], describing the upper part of the lattice of axiomatic extensions of R. Among the many potential applications of this result, we explain one that was obtained recently in [52]: the logic R has no structurally complete axiomatic consistent extension, except for classical propositional logic.
Dissertation (MSc)--University of Pretoria, 2016.
Mathematics and Applied Mathematics
MSc
Unrestricted
APA, Harvard, Vancouver, ISO, and other styles
8

Wannenburg, Johann Joubert. "Varieties of De Morgan Monoids." Thesis, University of Pretoria, 2020. http://hdl.handle.net/2263/75178.

Full text
Abstract:
De Morgan monoids are algebraic structures that model certain non-classical logics. The variety DMM of all De Morgan monoids models the relevance logic Rt (so-named because it blocks the derivation of true conclusions from irrelevant premises). The so-called subvarieties and subquasivarieties of DMM model the strengthenings of Rt by new logical axioms, or new inference rules, respectively. Meta-logical problems concerning these stronger systems amount to structural problems about (classes of) De Morgan monoids, and the methods of universal algebra can be exploited to solve them. Until now, this strategy was under-developed in the case of Rt and DMM. The thesis contributes in several ways to the filling of this gap. First, a new structure theorem for irreducible De Morgan monoids is proved; it leads to representation theorems for the algebras in several interesting subvarieties of DMM. These in turn help us to analyse the lower part of the lattice of all subvarieties of DMM. This lattice has four atoms, i.e., DMM has just four minimal subvarieties. We describe in detail the second layer of this lattice, i.e., the covers of the four atoms. Within certain subvarieties of DMM, our description amounts to an explicit list of all the covers. We also prove that there are just 68 minimal quasivarieties of De Morgan monoids. Thereafter, we use these insights to identify strengthenings of Rt with certain desirable meta-logical features. In each case, we work with the algebraic counterpart of a meta-logical property. For example, we identify precisely the varieties of De Morgan monoids having the joint embedding property (any two nontrivial members both embed into some third member), and we establish convenient sufficient conditions for epimorphisms to be surjective in a subvariety of DMM. The joint embedding property means that the corresponding logic is determined by a single set of truth tables. Epimorphisms are related to 'implicit definitions'. (For instance, in a ring, the multiplicative inverse of an element is implicitly defined, because it is either uniquely determined or non-existent.) The logical meaning of epimorphism-surjectivity is, roughly speaking, that suitable implicit definitions can be made explicit in the corresponding logical syntax.
Thesis (PhD)--University of Pretoria, 2020.
DST-NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS)
Mathematics and Applied Mathematics
PhD
Unrestricted
APA, Harvard, Vancouver, ISO, and other styles
9

Rebecca, Schmidt. "The Power of Algorithms : The Use of Algorithmic Logic and Human Curation at The Guardian." Thesis, Stockholms universitet, Institutionen för mediestudier, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-120371.

Full text
Abstract:
Algorithms are part of most online activities but act largely in the background and remain hidden to the general public. They are programmed pieces of software that are designed to consume massive amounts of data and progress it into easy consumable pieces of information. Furthermore, that software is able to draw connections between pieces of information and filter it based on relevance or other criteria. What these criteria are and what they are based on often remains a well-kept secret. Companies such as Facebook, Google, Twitter and Netflix all use algorithms to make sense of the ever-increasing amount of Data and suggest posts, movies or search results. With more and more people getting their news stories trough social media platforms and search engines, algorithms play an important role in the way we receive news. That lead to the questions of what power algorithms have over the news we see and what power they have over news organisations and journalism. To answer these broad questions, it was decided to focus on one large news organisations and examine what role algorithms play. The news organisation chosen for this research was The Guardian. In order to investigate these how and if algorithms are used, interviews with eight experts working at The Guardian were conducted. The informants were developers, engineers, product managers, editors and journalists in order to get a broader spectrum of possible frames in place. So as to analyse the interviews, tables were created to understand the way algorithms in relation to the institution of The Guardian and the power of editors were framed by the interviewees. One of the results that could be observed through the interviews and analysis was that algorithms will play an increasingly large role in The Guardian and possibly share their influence with editors. It can also be found that technology and news organisations will become more and more intertwined and data from users will be collected and analysed. The last part of the thesis discusses the impact of the results in a broader context and what further research can be done.
APA, Harvard, Vancouver, ISO, and other styles
10

Rellstab, Daniel H. "Charles S. Peirce' Theorie natürlicher Sprache und ihre Relevanz für die Linguistik : Logik, Semantik, Pragmatik /." Tübingen : Narr, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=2896939&prov=M&dok%5Fvar=1&dok%5Fext=htm.

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

Books on the topic "Relevant logic"

1

Norman, Jean, and Richard Sylvan, eds. Directions in Relevant Logic. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-1005-8.

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

Norman, Jean. Directions in Relevant Logic. Dordrecht: Springer Netherlands, 1989.

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

Jean, Norman, and Sylvan Richard, eds. Directions in relevant logic. Dordrecht: Kluwer Academic Publishers, 1989.

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

Relevant logic: A philosophical interpretation. Cambridge, UK: Cambridge Univeristy Press, 2004.

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

Relevant logic: A philosophical examination of inference. Oxford, OX, UK: B. Blackwell, 1988.

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

Shramko, Yaroslav. Intuitionismus und Relevanz. Berlin: Logos, 1999.

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

Walton, Douglas N. Relevance in argumentation. Mahwah, NJ: L. Erlbaum Associates, 2002.

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

Relevance in argumentation. Mahwah, N.J: L. Erlbaum Associates, 2004.

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

Gabbay, Dov M. A practical logic of cognitive systems. Amsterdam: North Holland, 2003.

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

Wright, Marie-Christine. A relevance logic for natural language. Manchester: University of Manchester, 1993.

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

Book chapters on the topic "Relevant logic"

1

Woods, John. "The Relevance of Relevant Logic." In Directions in Relevant Logic, 77–86. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-1005-8_4.

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

Sylvan, Richard. "RELEVANT CONDITIONALS, and relevant application thereof." In Applied Logic Series, 191–244. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-011-5638-7_10.

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

Mares, Edwin D., and Robert K. Meyer. "Relevant Logics." In The Blackwell Guide to Philosophical Logic, 280–308. Oxford, UK: Blackwell Publishing Ltd, 2017. http://dx.doi.org/10.1002/9781405164801.ch13.

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

Gochet, Paul, Pascal Gribomont, and Didier Rossetto. "Algorithms for Relevant Logic." In Logic, Thought and Action, 479–96. Dordrecht: Springer Netherlands, 2005. http://dx.doi.org/10.1007/1-4020-3167-x_21.

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

Slaney, John. "Relevant Logic and Paraconsistency." In Inconsistency Tolerance, 270–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30597-2_9.

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

Maddux, Roger D. "Tarskian Classical Relevant Logic." In Outstanding Contributions to Logic, 67–161. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71430-7_3.

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

Urquhart, Alasdair. "What is Relevant Implication?" In Directions in Relevant Logic, 167–74. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-1005-8_11.

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

Norman, Jean, and Richard Sylvan. "Introduction: Routes in Relevant Logic." In Directions in Relevant Logic, 1–21. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-1005-8_1.

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

Bacon, John. "Categorical Propositions In Relevance Logic." In Directions in Relevant Logic, 197–203. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-1005-8_15.

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

van Dijk, Teun A. "“Relevance” in Logic and Grammar." In Directions in Relevant Logic, 25–57. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-1005-8_2.

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

Conference papers on the topic "Relevant logic"

1

Cheng, Jingde. "Temporal Relevant Logic as the Logic Basis of Anticipatory Reasoning-Reacting Systems." In COMPUTING ANTICIPATORY SYSTEMS: CASYS'03 - Sixth International Conference. AIP, 2004. http://dx.doi.org/10.1063/1.1787339.

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

Kamide, Norihiro. "Formalizing Inconsistency-Tolerant Relevant Human Reasoning: A Decidable Paraconsistent Relevant Logic with Constructible Falsity." In 2013 IEEE International Conference on Systems, Man and Cybernetics (SMC 2013). IEEE, 2013. http://dx.doi.org/10.1109/smc.2013.321.

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

Cheng, Jingde. "Adaptive Prediction by Anticipatory Reasoning Based on Temporal Relevant Logic." In 2008 8th International Conference on Hybrid Intelligent Systems (HIS). IEEE, 2008. http://dx.doi.org/10.1109/his.2008.118.

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

Obikod, Tetiana. "DEVELOPMENT OF MATHEMATICAL LOGIC AS A POWERFUL APPARATUS OF MODERN PHYSICS." In Relevant Trends of Scientific Research in the Countries of Central and Eastern Europe. Publishing House “Baltija Publishing”, 2020. http://dx.doi.org/10.30525/978-9934-26-002-5-51.

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

Cheng, Jingde. "Deontic relevant logic as the logical basis for legal information systems." In the 2006 ACM symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1141277.1141353.

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

CHENG, JINGDE, and YUICHI GOTO. "A STRONG RELEVANT LOGIC APPROACH TO THE CALCULUS OF FUZZY CONDITIONALS." In Proceedings of the 5th International FLINS Conference. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812777102_0009.

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

Cheng, Jingde. "A Temporal Relevant Logic Approach to Modeling and Reasoning about Epistemic Processes." In 2009 Fifth International Conference on Semantics, Knowledge and Grid. IEEE, 2009. http://dx.doi.org/10.1109/skg.2009.105.

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

Biatov, Konstantin. "Experiments on unsupervised learning for extracting relevant fragments from spoken dialog corpus." In the 2nd workshop on Learning language in logic and the 4th conference. Morristown, NJ, USA: Association for Computational Linguistics, 2000. http://dx.doi.org/10.3115/1117601.1117619.

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

Espinal, Albeiro, Yannis Haralambous, Dominique Bedart, and John Puentes. "Uncertainty-Oriented Textual Marker Selection for Extracting Relevant Terms from Job Offers." In 8th International Conference on Artificial Intelligence and Fuzzy Logic System (AIFZ 2022). Academy and Industry Research Collaboration Center (AIRCC), 2022. http://dx.doi.org/10.5121/csit.2022.121601.

Full text
Abstract:
Automated resume ranking aims at selecting and sorting pertinent resumes, among those sent to answer a given job of er. Most of the screening and elimination process relies on the resumes’ content, marginally including information of the job of er. In this sense, currently available resume ranking approaches lack of accuracy in detecting relevant information in job of ers, which is imperative to assure that selected resumes are pertinent. To improve the extraction of relevant terms that represent significant information in job of ers, we study the uncertainty-oriented selection of 16 textual markers – 10 obtained by examining the behaviour of expert recruiters and 6 from the literature – according to two approaches: fuzzy logistic regression and fuzzy decision trees. Results indicate that globally, fuzzy decision trees improve the F1 and recall metrics, by 27% and 53% respectively, compared to a state-of-the-art term extraction approach.
APA, Harvard, Vancouver, ISO, and other styles
10

Bodirsky, Manuel, Antoine Mottet, Miroslav Olsak, Jakub Oprsal, Michael Pinsker, and Ross Willard. "Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)." In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2019. http://dx.doi.org/10.1109/lics.2019.8785883.

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

Reports on the topic "Relevant logic"

1

Lutz, Carsten. PDL with Intersection and Converse is Decidable. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.148.

Full text
Abstract:
In its many guises and variations, propositional dynamic logic (PDL) plays an important role in various areas of computer science such as databases, artificial intelligence, and computer linguistics. One relevant and powerful variation is ICPDL, the extension of PDL with intersection and converse. Although ICPDL has several interesting applications, its computational properties have never been investigated. In this paper, we prove that ICPDL is decidable by developing a translation to the monadic second order logic of infinite trees. Our result has applications in information logic, description logic, and epistemic logic. In particular, we solve a long-standing open problem in information logic. Another virtue of our approach is that it provides a decidability proof that is more transparent than existing ones for PDL with intersection (but without converse).
APA, Harvard, Vancouver, ISO, and other styles
2

Lutz, Carsten, Ulrike Sattler, and Lidia Tendera. The Complexity of Finite Model Reasoning in Description Logics. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.123.

Full text
Abstract:
We analyze the complexity of finite model reasoning in the description logic ALCQI, i.e. ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are EXPTIME-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.
APA, Harvard, Vancouver, ISO, and other styles
3

Thost, Veronika, Jan Holste, and Özgür Özçep. On Implementing Temporal Query Answering in DL-Lite. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.218.

Full text
Abstract:
Ontology-based data access augments classical query answering over fact bases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We implemented temporal query answering w.r.t. ontologies formulated in the Description Logic DL-Lite. Focusing on temporal conjunctive queries (TCQs), which combine conjunctive queries via the operators of propositional linear temporal logic, we regard three approaches for answering them: an iterative algorithm that considers all data available; a window-based algorithm; and a rewriting approach, which translates the TCQs to be answered into SQL queries. Since the relevant ontological knowledge is already encoded into the latter queries, they can be answered by a standard database system. Our evaluation especially shows that implementations of both the iterative and the window-based algorithm answer TCQs within a few milliseconds, and that the former achieves a constant performance, even if data is growing over time.
APA, Harvard, Vancouver, ISO, and other styles
4

Suntisrivaraporn, Boontawee. Module Extraction and Incremental Classification: A Pragmatic Approach for EL ⁺ Ontologies. Technische Universität Dresden, 2003. http://dx.doi.org/10.25368/2022.161.

Full text
Abstract:
The description logic EL⁺ has recently proved practically useful in the life science domain with presence of several large-scale biomedical ontologies such as Snomed ct. To deal with ontologies of this scale, standard reasoning of classification is essential but not sufficient. The ability to extract relevant fragments from a large ontology and to incrementally classify it has become more crucial to support ontology design, maintenance and reuse. In this paper, we propose a pragmatic approach to module extraction and incremental classification for EL⁺ ontologies and report on empirical evaluations of our algorithms which have been implemented as an extension of the CEL reasoner.
APA, Harvard, Vancouver, ISO, and other styles
5

Wright, Adam, Marija Milacic, Karen Rothfels, Joel Weiser, Quang Trinh, Bijay Jassal, Robin Haw, and Lincoln Stein. Evaluating the Predictive Accuracy of Reactome's Curated Biological Pathways. Reactome, November 2022. http://dx.doi.org/10.3180/poster/20221109wright.

Full text
Abstract:
Reactome is a database of human biological pathways manually curated from the primary literature and peer-reviewed by experts. To evaluate the utility of Reactome pathways for predicting functional consequences of genetic perturbations, we compared predictions of perturbation effects based on Reactome pathways against published empirical observations. Ten cancer-relevant Reactome pathways, representing diverse biological processes such as signal transduction, cell division, DNA repair, and transcriptional regulation, were selected for testing. For each pathway, root input nodes and key pathway outputs were defined. We then used pathway-diagram-derived logic graphs to predict, either by inspection by biocurators or using a novel algorithm MP-BioPath, the effects of bidirectional perturbations (upregulation/activation or downregulation/inhibition) of single root inputs on the status of key outputs. These predictions were then compared to published empirical tests.
APA, Harvard, Vancouver, ISO, and other styles
6

Pensel, Maximilian, and Anni-Yasmin Turhan. Making Quantification Relevant Again —the Case of Defeasible EL⊥. Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2022.231.

Full text
Abstract:
Defeasible Description Logics (DDLs) extend Description Logics with defeasible concept inclusions. Reasoning in DDLs often employs rational or relevant closure according to the (propositional) KLM postulates. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, this relationship might also hold if these concepts appear in existential restrictions. Such nested defeasible subsumption relationships were not detected by earlier reasoning algorithms—neither for rational nor relevant closure. In this report, we present a new approach for EL ⊥ that alleviates this problem for relevant closure (the strongest form of preferential reasoning currently investigated) by the use of typicality models that extend classical canonical models by domain elements that individually satisfy any amount of consistent defeasible knowledge. We also show that a certain restriction on the domain of the typicality models in this approach yields inference results that correspond to the (weaker) more commonly known rational closure.
APA, Harvard, Vancouver, ISO, and other styles
7

Guppy, Lisa, Paula Uyttendaele, Karen Villholth, and Vladimir Smakhtin. Groundwater and Sustainable Development Goals: Analysis of Interlinkages. United Nations University Institute for Water, Environment and Health, December 2018. http://dx.doi.org/10.53328/jrlh1810.

Full text
Abstract:
Groundwater represents 97% of the world’s available freshwater resources and is extensively abstracted throughout the world. While abundant in a global context, it can only de developed to a certain extent without causing environmental impacts. Also, it is highly variable across the globe, and where it is heavily relied on, it is less renewable. Hence, it is critically important that this resource is managed sustainably. However, the Sustainable Development Goals (SDGs) of the 2030 Development Agenda do not, as a rule, account explicitly for the significant role that groundwater plays and will continue to play in sustainable development. This report aims to unpack and highlight this role through consistent analysis of the interlinkages between groundwater and the targets of the SDGs. The key features of groundwater relevant to the SDGs are its use, management and sustainability. The methodology used to analyse groundwater interlinkages with SDG targets includes, first, identification of ‘evidence-based’ and ‘logical’ interlinkages. The first type of interlinkages is supported by existing data, while the second is by information and logic that needs to be drawn from existing bodies of relevant research. While only a few interlinkages may be seen at present as “evidence-based”, more data are continuously emerging to make more interlinkages supported by hard-core evidence. Subsequently, the interlinkages are classified into either ‘reinforcing’, ‘conflicting’ or ‘mixed’ – depending on whether achievement of a target will have predominantly positive, negative, or mixed impact on groundwater. The interlinkages are also classified into ‘primary’ and ‘secondary’, depending on how strong and direct the impacts on groundwater from achieving the targets may be. The report presents a summary of key interlinkages, and subsequently provides the narrative of all ‘primary’ ones. The analysis suggests that more than half of interlinkages are ‘reinforcing’, while only a few are ‘conflicting’. From a policy perspective i) conflicting interlinkages are the most critical and difficult ones to manage, and ii) it is important to draw synergies between SDG initiatives and groundwater to allow reinforcing interlinkages to materialise. Nearly a third of all identified interlinkages were classified as ‘mixed’. This means that when target activities are planned, careful consideration must be given to possible impacts on groundwater to avoid unintended negative outcomes that may not be evident at first. Primary interlinkages that constitute 43% of all may be the easiest to understand and the most important to plan for. However, there are even more secondary interlinkages. This means that groundwater experts need to be able to share knowledge to a range of actors involved in addressing the targets with secondary interlinkages to groundwater, and vice versa. It is also shown that i) the importance of groundwater to sustainable development is poorly recognised and captured at the SDG target level; ii) there is a lack of globally useful, up-to-date and SDG-relevant groundwater data available, which makes it difficult to make globally, and even locally, relevant recommendations for groundwater use, management and sustainability in the SDG era, and iii) there are often poor links between targets and their indicators. This may signal that all groundwater-related and groundwater-relevant aspirations may not be translated into real, let alone, measurable action. This report is not a comprehensive analysis and involves an element of subjectivity, associated primarily with the data and information paucity on one hand, and with the imperfection of the SDG target and indicator system itself – on another. However, even with these limitations, the report shows how significant groundwater is in sustainable development, even if the current SDG framework is implicit about this. Furthermore, it suggests a structured way to improve the visibility of groundwater in the SDG framework as it continues to develop.
APA, Harvard, Vancouver, ISO, and other styles
8

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, the latter being particularly relevant for ontology reuse. An evaluation of our implementation shows that the modules computed by our method are often significantly smaller than those computed by existing methods.
APA, Harvard, Vancouver, ISO, and other styles
9

Horrocks, Ian, and Stephan Tobies. Optimisation of Terminological Reasoning. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.99.

Full text
Abstract:
An extended abstract of this report was submitted to the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR2000). When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to an arbitrary set of axioms is hard, even for relatively inexpressive logics, and it is essential to deal with such axioms in an efficient manner if implemented systems are to be effective in real applications. This is particularly relevant to Description Logics, where subsumption reasoning with respect to a terminology is a fundamental problem. Two optimisation techniques that have proved to be particularly effective in dealing with terminologies are lazy unfolding and absorption. In this paper we seek to improve our theoretical understanding of these important techniques. We define a formal framework that allows the techniques to be precisely described, establish conditions under which they can be safely applied, and prove that, provided these conditions are respected, subsumption testing algorithms will still function correctly. These results are used to show that the procedures used in the FaCT system are correct and, moreover, to show how effiency an be significantly improved, while still retaining the guarantee of correctness, by relaxing the safety conditions for absorption.
APA, Harvard, Vancouver, ISO, and other styles
10

McKenna, Patrick, and Mark Evans. Emergency Relief and complex service delivery: Towards better outcomes. Queensland University of Technology, June 2021. http://dx.doi.org/10.5204/rep.eprints.211133.

Full text
Abstract:
Emergency Relief (ER) is a Department of Social Services (DSS) funded program, delivered by 197 community organisations (ER Providers) across Australia, to assist people facing a financial crisis with financial/material aid and referrals to other support programs. ER has been playing this important role in Australian communities since 1979. Without ER, more people living in Australia who experience a financial crisis might face further harm such as crippling debt or homelessness. The Emergency Relief National Coordination Group (NCG) was established in April 2020 at the start of the COVID-19 pandemic to advise the Minister for Families and Social Services on the implementation of ER. To inform its advice to the Minister, the NCG partnered with the Institute for Governance at the University of Canberra to conduct research to understand the issues and challenges faced by ER Providers and Service Users in local contexts across Australia. The research involved a desktop review of the existing literature on ER service provision, a large survey which all Commonwealth ER Providers were invited to participate in (and 122 responses were received), interviews with a purposive sample of 18 ER Providers, and the development of a program logic and theory of change for the Commonwealth ER program to assess progress. The surveys and interviews focussed on ER Provider perceptions of the strengths, weaknesses, future challenges, and areas of improvement for current ER provision. The trend of increasing case complexity, the effectiveness of ER service delivery models in achieving outcomes for Service Users, and the significance of volunteering in the sector were investigated. Separately, an evaluation of the performance of the NCG was conducted and a summary of the evaluation is provided as an appendix to this report. Several themes emerged from the review of the existing literature such as service delivery shortcomings in dealing with case complexity, the effectiveness of case management, and repeat requests for service. Interviews with ER workers and Service Users found that an uplift in workforce capability was required to deal with increasing case complexity, leading to recommendations for more training and service standards. Several service evaluations found that ER delivered with case management led to high Service User satisfaction, played an integral role in transforming the lives of people with complex needs, and lowered repeat requests for service. A large longitudinal quantitative study revealed that more time spent with participants substantially decreased the number of repeat requests for service; and, given that repeat requests for service can be an indicator of entrenched poverty, not accessing further services is likely to suggest improvement. The interviews identified the main strengths of ER to be the rapid response and flexible use of funds to stabilise crisis situations and connect people to other supports through strong local networks. Service Users trusted the system because of these strengths, and ER was often an access point to holistic support. There were three main weaknesses identified. First, funding contracts were too short and did not cover the full costs of the program—in particular, case management for complex cases. Second, many Service Users were dependent on ER which was inconsistent with the definition and intent of the program. Third, there was inconsistency in the level of service received by Service Users in different geographic locations. These weaknesses can be improved upon with a joined-up approach featuring co-design and collaborative governance, leading to the successful commissioning of social services. The survey confirmed that volunteers were significant for ER, making up 92% of all workers and 51% of all hours worked in respondent ER programs. Of the 122 respondents, volunteers amounted to 554 full-time equivalents, a contribution valued at $39.4 million. In total there were 8,316 volunteers working in the 122 respondent ER programs. The sector can support and upskill these volunteers (and employees in addition) by developing scalable training solutions such as online training modules, updating ER service standards, and engaging in collaborative learning arrangements where large and small ER Providers share resources. More engagement with peak bodies such as Volunteering Australia might also assist the sector to improve the focus on volunteer engagement. Integrated services achieve better outcomes for complex ER cases—97% of survey respondents either agreed or strongly agreed this was the case. The research identified the dimensions of service integration most relevant to ER Providers to be case management, referrals, the breadth of services offered internally, co-location with interrelated service providers, an established network of support, workforce capability, and Service User engagement. Providers can individually focus on increasing the level of service integration for their ER program to improve their ability to deal with complex cases, which are clearly on the rise. At the system level, a more joined-up approach can also improve service integration across Australia. The key dimensions of this finding are discussed next in more detail. Case management is key for achieving Service User outcomes for complex cases—89% of survey respondents either agreed or strongly agreed this was the case. Interviewees most frequently said they would provide more case management if they could change their service model. Case management allows for more time spent with the Service User, follow up with referral partners, and a higher level of expertise in service delivery to support complex cases. Of course, it is a costly model and not currently funded for all Service Users through ER. Where case management is not available as part of ER, it might be available through a related service that is part of a network of support. Where possible, ER Providers should facilitate access to case management for Service Users who would benefit. At a system level, ER models with a greater component of case management could be implemented as test cases. Referral systems are also key for achieving Service User outcomes, which is reflected in the ER Program Logic presented on page 31. The survey and interview data show that referrals within an integrated service (internal) or in a service hub (co-located) are most effective. Where this is not possible, warm referrals within a trusted network of support are more effective than cold referrals leading to higher take-up and beneficial Service User outcomes. However, cold referrals are most common, pointing to a weakness in ER referral systems. This is because ER Providers do not operate or co-locate with interrelated services in many cases, nor do they have the case management capacity to provide warm referrals in many other cases. For mental illness support, which interviewees identified as one of the most difficult issues to deal with, ER Providers offer an integrated service only 23% of the time, warm referrals 34% of the time, and cold referrals 43% of the time. A focus on referral systems at the individual ER Provider level, and system level through a joined-up approach, might lead to better outcomes for Service Users. The program logic and theory of change for ER have been documented with input from the research findings and included in Section 4.3 on page 31. These show that ER helps people facing a financial crisis to meet their immediate needs, avoid further harm, and access a path to recovery. The research demonstrates that ER is fundamental to supporting vulnerable people in Australia and should therefore continue to be funded by government.
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!

To the bibliography