Academic literature on the topic 'Modal 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 'Modal 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 "Modal logic"

1

Cresswell, Max. "Non-Denumerable Infinitary Modal Logic." JUCS - Journal of Universal Computer Science 15, no. (1) (2009): 63–71. https://doi.org/10.3217/jucs-015-01-0063.

Full text
Abstract:
Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs ‹Γ, α› of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the limitation to denumerable sets of sequents.
APA, Harvard, Vancouver, ISO, and other styles
2

Schumann, Andrew. "Nāgārjunian-Yogācārian Modal Logic versus Aristotelian Modal Logic." Journal of Indian Philosophy 49, no. 3 (2021): 467–98. http://dx.doi.org/10.1007/s10781-021-09470-5.

Full text
Abstract:
AbstractThere are two different modal logics: the logic T assuming contingency and the logic K = assuming logical determinism. In the paper, I show that the Aristotelian treatise On Interpretation (Περί ερμηνείας, De Interpretatione) has introduced some modal-logical relationships which correspond to T. In this logic, it is supposed that there are contingent events. The Nāgārjunian treatise Īśvara-kartṛtva-nirākṛtiḥ-viṣṇoḥ-ekakartṛtva-nirākaraṇa has introduced some modal-logical relationships which correspond to K =. In this logic, it is supposed that there is a logical determinism: each event
APA, Harvard, Vancouver, ISO, and other styles
3

Rybakov, V. V. "Hereditarily structurally complete modal logics." Journal of Symbolic Logic 60, no. 1 (1995): 266–88. http://dx.doi.org/10.2307/2275521.

Full text
Abstract:
AbstractWe consider structural completeness in modal logics. The main result is the necessary and sufficient condition for modal logics over K4 to be hereditarily structurally complete: a modal logic λ is hereditarily structurally complete iff λ is not included in any logic from the list of twenty special tabular logics. Hence there are exactly twenty maximal structurally incomplete modal logics above K4 and they are all tabular.
APA, Harvard, Vancouver, ISO, and other styles
4

Demey, Lorenz. "Logic-Sensitivity of Aristotelian Diagrams in Non-Normal Modal Logics." Axioms 10, no. 3 (2021): 128. http://dx.doi.org/10.3390/axioms10030128.

Full text
Abstract:
Aristotelian diagrams, such as the square of opposition, are well-known in the context of normal modal logics (i.e., systems of modal logic which can be given a relational semantics in terms of Kripke models). This paper studies Aristotelian diagrams for non-normal systems of modal logic (based on neighborhood semantics, a topologically inspired generalization of relational semantics). In particular, we investigate the phenomenon of logic-sensitivity of Aristotelian diagrams. We distinguish between four different types of logic-sensitivity, viz. with respect to (i) Aristotelian families, (ii)
APA, Harvard, Vancouver, ISO, and other styles
5

Kooi, Barteld, and Allard Tamminga. "Three-valued Logics in Modal Logic." Studia Logica 101, no. 5 (2012): 1061–72. http://dx.doi.org/10.1007/s11225-012-9420-0.

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

BEZHANISHVILI, GURAM, NICK BEZHANISHVILI, and JULIA ILIN. "STABLE MODAL LOGICS." Review of Symbolic Logic 11, no. 3 (2018): 436–69. http://dx.doi.org/10.1017/s1755020317000375.

Full text
Abstract:
AbstractStable logics are modal logics characterized by a class of frames closed under relation preserving images. These logics admit all filtrations. Since many basic modal systems such as K4 and S4 are not stable, we introduce the more general concept of an M-stable logic, where M is an arbitrary normal modal logic that admits some filtration. Of course, M can be chosen to be K4 or S4. We give several characterizations of M-stable logics. We prove that there are continuum many S4-stable logics and continuum many K4-stable logics between K4 and S4. We axiomatize K4-stable and S4-stable logics
APA, Harvard, Vancouver, ISO, and other styles
7

Venema, Yde, Alexander Chagrov, and Michael Zakharyaschev. "Modal Logic." Philosophical Review 109, no. 2 (2000): 286. http://dx.doi.org/10.2307/2693587.

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

Kracht, Marcus, Patrick Blackburn, Maarten de Rijke, and Yde Venema. "Modal Logic." Bulletin of Symbolic Logic 8, no. 2 (2002): 299. http://dx.doi.org/10.2307/2693968.

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

Venema, Y. "MODAL LOGIC." Philosophical Review 109, no. 2 (2000): 286–89. http://dx.doi.org/10.1215/00318108-109-2-286.

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

Spencer-Smith, Richard. "Modal logic." Artificial Intelligence Review 5, no. 1-2 (1991): 5–34. http://dx.doi.org/10.1007/bf00129533.

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

Dissertations / Theses on the topic "Modal logic"

1

Wansing, Heinrich. "Displaying modal logic /." Dordrecht [u.a.] : Kluwer, 1998. http://www.gbv.de/dms/ilmenau/toc/24662969X.PDF.

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

Papacchini, Fabio. "Minimal model reasoning for modal logic." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/minimal-model-reasoning-for-modal-logic(dbfeb158-f719-4640-9cc9-92abd26bd83e).html.

Full text
Abstract:
Model generation and minimal model generation are useful for tasks such as model checking, query answering and for debugging of logical specifications. Due to this variety of applications, several minimality criteria and model generation methods for classical logics have been studied. Minimal model generation for modal logics how ever did not receive the same attention from the research community. This thesis aims to fill this gap by investigating minimality criteria and designing minimal model generation procedures for all the sublogics of the multi-modal logic S5(m) and their extensions with
APA, Harvard, Vancouver, ISO, and other styles
3

Batchelor, Roderick. "Investigations in modal logic." Thesis, King's College London (University of London), 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.409258.

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

Wilkinson, Toby. "Enriched coalgebraic modal logic." Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/354112/.

Full text
Abstract:
We formalise the notion of enriched coalgebraic modal logic, and determine conditions on the category V (over which we enrich), that allow an enriched logical connection to be extended to a framework for enriched coalgebraic modal logic. Our framework uses V-functors L: A → A and T: X → X, where L determines the modalities of the resulting modal logics, and T determines the coalgebras that provide the semantics. We introduce the V-category Mod(A, α) of models for an L-algebra (A, α), and show that the forgetful V-functor from Mod(A, α) to X creates conical colimits. The concepts of bisimulatio
APA, Harvard, Vancouver, ISO, and other styles
5

Murakami, Yuko. "Modal logic of partitions." [Bloomington, Ind.] : Indiana University, 2005. http://wwwlib.umi.com/dissertations/fullcit/3162977.

Full text
Abstract:
Thesis (Ph.D.)--Indiana University, Dept. of Philosophy, 2005.<br>Title from PDF t.p. (viewed Dec. 2, 2008). Source: Dissertation Abstracts International, Volume: 66-02, Section: A, page: 0620. Chairs: Lawrence Moss; Michael Dunn.
APA, Harvard, Vancouver, ISO, and other styles
6

Zanichelli, Riccardo <1993&gt. "Aristotle’s modal syllogistic and first-order modal logic." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2022. http://amsdottorato.unibo.it/10396/1/rzamsafml.pdf.

Full text
Abstract:
In Prior Analytics 1.1–22, Aristotle develops his proof system of non-modal and modal propositions. This system is given in the language of propositions, and Aristotle is concerned with establishing some properties and relations that the expressions of this language enjoy. However, modern scholarship has found some of his results inconsistent with positions defended elsewhere. The set of rules of inference of this system has also caused perplexity: there does not seem to be a single interpretation that validates all the rules which Aristotle is explicitly committed to using in his proofs. Som
APA, Harvard, Vancouver, ISO, and other styles
7

Thalmann, Lars. "Term-modal logic and quantifier-free dynamic assignment logic." Doctoral thesis, Uppsala : Institutionen för informationsteknologi, Univ. [distributör], 2000. http://publications.uu.se/theses/91-506-1443-6/.

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

Chou, Soi Ngan. "Normal systems of modal logic." Thesis, University of Macau, 2000. http://umaclib3.umac.mo/record=b1446655.

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

Martin, Alan J. "Modal and fixpoint linear logic." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6074.

Full text
Abstract:
This thesis provides adaptations of the algebraic and relational semantics of modal logic to model J.-Y. Girard's linear logic extended with general modalities. This work extends the work of M. D'Agostino, D. Gabbay, and A. Russo on modalities in implication systems, which include a fragment of linear logic, and the work of J.-Y. Girard on phase semantics for linear logic. We develop deductive systems based on the Gentzen-style sequent calculi of Ohnishi and Matsumoto and the indexed sequents of Mints, and prove cut-elimination properties. We show that semantics and deductive systems that are
APA, Harvard, Vancouver, ISO, and other styles
10

Costa, Marcos Mota do Carmo. "Characterization of modal (action) logic." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/47821.

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

Books on the topic "Modal logic"

1

Girle, Rod. Modal logics and philosophy: Introduction to modal logic. Acumen, 2000.

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

Chagrov, Alexander. Modal logic. Clarendon Press, 1997.

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

Wansing, Heinrich. Displaying Modal Logic. Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-017-1280-4.

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

Rijke, Maarten de. Extending modal logic. Institute for Logic, Language and Computation,Universiteit van Amsterdam, 1993.

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

Wansing, H. Displaying modal logic. Kluwer Academic, 1998.

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

Maarten, Marx, Pólos László, and Masuch Michael 1949-, eds. Arrow logic and multi-modal logic. CSLI Publications, 1996.

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

Eijck, J. van. Dynamic modal predicate logic. Research Institute for Language and Speech, 1993.

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

Marx, Maarten, and Yde Venema. Multi-Dimensional Modal Logic. Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-011-5694-3.

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

Ruzsa, Imre. Modal Logic with Descriptions. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-017-2294-0.

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

Fitting, Melvin, and Richard L. Mendelsohn. First-Order Modal Logic. Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-011-5292-1.

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

Book chapters on the topic "Modal logic"

1

Wansing, Heinrich. "Display Logic." In Displaying Modal Logic. Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-017-1280-4_3.

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

Nerode, Anil, and Richard A. Shore. "Modal Logic." In Logic for Applications. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-0649-1_5.

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

de Swart, H. C. M. "Modal Logic." In Springer Undergraduate Texts in Philosophy. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03255-5_6.

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

Chatti, Saloua. "Modal Logic." In Studies in Universal Logic. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-27466-5_4.

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

Nerode, Anil, and Richard A. Shore. "Modal Logic." In Logic for Applications. Springer US, 1993. http://dx.doi.org/10.1007/978-1-4684-0211-7_4.

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

Gochet, Paul. "Modal logic." In Handbook of Pragmatics. John Benjamins Publishing Company, 2007. http://dx.doi.org/10.1075/hop.11.mod1.

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

Gochet, Paul. "Modal logic." In Handbook of Pragmatics. John Benjamins Publishing Company, 1995. http://dx.doi.org/10.1075/hop.m.mod1.

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

Gochet, Paul. "Modal logic." In Philosophical Perspectives for Pragmatics. John Benjamins Publishing Company, 2011. http://dx.doi.org/10.1075/hoph.10.14goc.

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

Gochet, Paul. "Modal logic." In Handbook of Pragmatics. John Benjamins Publishing Company, 2022. http://dx.doi.org/10.1075/hop.m2.mod1.

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

Marek, V. Wiktor, and Mirosław Truszczyński. "Modal logic." In Artificial Intelligence. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-02906-0_7.

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

Conference papers on the topic "Modal logic"

1

Artale, Alessandro, Roman Kontchakov, Andrea Mazzullo, and Frank Wolter. "Non-Rigid Designators in Modal and Temporal Free Description Logics." 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/8.

Full text
Abstract:
Definite descriptions, such as ‘the General Chair of KR 2024’, are a semantically transparent device for object identification in knowledge representation. In first-order modal logic, definite descriptions have been widely investigated for their non-rigidity, which allows them to designate different objects (or none at all) at different states. We propose expressive modal description logics with non-rigid definite descriptions and names, and investigate decidability and complexity of the satisfiability problem. We first systematically link satisfiability for the one-variable fragment of first-
APA, Harvard, Vancouver, ISO, and other styles
2

López-Villafán, Ricardo, and Everardo Bárcenas. "A Reasoning System for Graded Modal Logic." In 2024 12th International Conference in Software Engineering Research and Innovation (CONISOFT). IEEE, 2024. https://doi.org/10.1109/conisoft63288.2024.00037.

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

Majer, Ondrej, and Igor Sedlár. "On Many-Valued Modal Probabilistic Logics." In 2025 IEEE 55th International Symposium on Multiple-Valued Logic (ISMVL). IEEE, 2025. https://doi.org/10.1109/ismvl64713.2025.00014.

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

Soloviev, Matvey, Musard Balliu, and Roberto Guanciale. "Security Properties through the Lens of Modal Logic." In 2024 IEEE 37th Computer Security Foundations Symposium (CSF). IEEE, 2024. http://dx.doi.org/10.1109/csf61375.2024.00009.

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

Gómez Álvarez, Lucía, and Sebastian Rudolph. "Reasoning in SHIQ with Axiom- and Concept-Level Standpoint Modalities." 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/36.

Full text
Abstract:
Standpoint logic is a recently proposed modal logic framework that is well-suited for multiperspective reasoning and ontology integration. For this reason, combinations of standpoint logic with description logics (DLs) are of special interest. Prior work has shown that it is possible to add standpoints to numerous decidable fragments of first-order logics - including very expressive DLs up to SROIQbs - while preserving their reasoning complexity, so long as standpoint modalities are limited to the axiom level. A more expressive tighter modal integration, where standpoint modalities are also al
APA, Harvard, Vancouver, ISO, and other styles
6

Wałęga, Przemysław Andrzej. "Expressive Power of Definite Descriptions in Modal Logics." 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/65.

Full text
Abstract:
Motivated by applications in knowledge representation and reasoning, modal and description logics have been recently extended with definite description operators. Such operators provide us with a tool for referring to a particular element of a model by stating a property satisfied only by this element. This mechanism resembles the way we refer to objects in natural language, which makes it an attractive component of ontology and query languages. In this paper, we aim to provide a tool for analysing the expressive power of logics with definite descriptions. In particular, we introduce an adequa
APA, Harvard, Vancouver, ISO, and other styles
7

Cabalar, Pedro, Thomas Eiter, and Davide Soldà. "Contracted Temporal Equilibrium Logic." 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/21.

Full text
Abstract:
The stable model semantics of logic programs has been characterized by Equilibrium Logic, which is a non-monotonic formalism that selects models from the (monotonic) intermediate logic of Here-and-There. It provides stable models for arbitrary propositional formulas and has been fruitfully extended to different modal languages. Among them are theories in the syntax of Linear-Time Temporal Logic (LTL), giving rise to Temporal Equilibrium logic (TEL) based on Temporal Here-and-There (THT). In TEL, models are selected that minimize truth among THT traces of the same length. In this paper, we cons
APA, Harvard, Vancouver, ISO, and other styles
8

Calcagno, Cristiano, Philippa Gardner, and Uri Zarfaty. "Context logic as modal logic." In the 34th annual ACM SIGPLAN-SIGACT symposium. ACM Press, 2007. http://dx.doi.org/10.1145/1190216.1190236.

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

Wild, Paul, and Lutz Schröder. "A Characterization Theorem for a Modal Description Logic." 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/181.

Full text
Abstract:
Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5-ALC combines the standard description logic ALC with an S5-modality that can be understood as an epistemic operator or as representing (undirected) change. This logic embeds into a corresponding modal first-order logic S5-FOL. We prove a modal characterization theorem for this embedding, in analogy to results by van Benthem and Rosen relating ALC to standard first-order logic: We show that S5-ALC with only local roles is, bot
APA, Harvard, Vancouver, ISO, and other styles
10

Esteva, Francese, Lluis Godo, and Ricardo Oscar Rodriguez. "On the relation between modal and multi-modal logics over Łukasiewicz logic." In 2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2017. http://dx.doi.org/10.1109/fuzz-ieee.2017.8015703.

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

Reports on the topic "Modal logic"

1

Lutz, Carsten, and Ulrike Sattler. The Complexity of Reasoning with Boolean Modal Logics (Extended Version). Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.105.

Full text
Abstract:
Since Modal Logics are an extension of Propositional Logic, they provide Boolean operators for constructing complex formulae. However, most Modal Logics do not admit Boolean operators for constructing complex modal parameters to be used in the box and diamond operators. This asymmetry is not present in Boolean Modal Logics, in which box and diamond quantify over arbitrary Boolean combinations of atomic model parameters.
APA, Harvard, Vancouver, ISO, and other styles
2

Lutz, Carsten, and Frank Wolter. Modal Logics of Topological Relations. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.142.

Full text
Abstract:
The eight topological RCC8(or Egenhofer-Franzosa)- relations between spatial regions play a fundamental role in spatial reasoning, spatial and constraint databases, and geographical information systems. In analogy with Halpern and Shoham’s modal logic of time intervals based on the Allen relations, we introduce a family of modal logics equipped with eight modal operators that are interpreted by the RCC8-relations. The semantics is based on region spaces induced by standard topological spaces, in particular the real plane. We investigate the expressive power and computational complexity of the
APA, Harvard, Vancouver, ISO, and other styles
3

Hirsch, Colin, and Stephan Tobies. A Tableau Algorithm for the Clique Guarded Fragment. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.106.

Full text
Abstract:
Aus der Einleitung: The Guarded Fragment of first-order logic, introduced by Andréka, van Benthem, and Németi, has been a succesful attempt to transfer many good properties of modal, temporal, and description logics to a larger fragment of predicate logic. Among these are decidability, the finite modal property, invariance under an appropriate variant of bisimulation, and other nice modal theoretic properties.
APA, Harvard, Vancouver, ISO, and other styles
4

Lutz, Carsten, and Dirk Walther. PDL with Negation of Atomic Programs. Technische Universität Dresden, 2003. http://dx.doi.org/10.25368/2022.129.

Full text
Abstract:
Propositional dynamic logic (PDL) is one of the most succesful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. A very natural and useful such extension is with negation of programs. Unfortunately, it is long-known that reasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL with negation of atomic programs, only. We argue that this logic is still useful, e.g. in the context of description logics, and prove that satisfiability is decidable and EXPTIME-complete using a
APA, Harvard, Vancouver, ISO, and other styles
5

Kozachenko, Nadiia. AGM cognitive actions as modal operators of three-valued logic: presentation. Ruhr-Universität Bochum, 2022. http://dx.doi.org/10.31812/123456789/6687.

Full text
Abstract:
AGM is designed so that its principles can be applied to the development of belief dynamics models, regardless of the field of application. The main idea of this work is to see how we can to represent cognitive actions considered in AGM within a certain three-valued logic, and check what interesting properties can be discovered in this way. To do this, we will consider the basic concepts and principles of AGM. Then we interpret them in a logical schema. And then we see what information about them we can get in the resulting system.
APA, Harvard, Vancouver, ISO, and other styles
6

Baader, Franz, Stefan Borgwardt, and Barbara Morawska. Computing Minimal EL-Unifiers is Hard. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.187.

Full text
Abstract:
Unification has been investigated both in modal logics and in description logics, albeit with different motivations. In description logics, unification can be used to detect redundancies in ontologies. In this context, it is not sufficient to decide unifiability, one must also compute appropriate unifiers and present them to the user. For the description logic EL, which is used to define several large biomedical ontologies, deciding unifiability is an NP-complete problem. It is known that every solvable EL-unification problem has a minimal unifier, and that every minimal unifier is a local uni
APA, Harvard, Vancouver, ISO, and other styles
7

Baader, Franz, and Anton Claußnitzer. Maximum Entropy Reasoning via Model Counting in (Description) Logics that Count Extended Version. Technische Universität Dresden, 2025. https://doi.org/10.25368/2025.015.

Full text
Abstract:
In previous work it was shown that the logic ALC^ME , which extends the description logic (DL) ALC with probabilistic conditionals, has domain-lifted inference. Here, we extend this result from the base logic ALC to two logics that can count, the two-variable fragment C2 of first-order logic (FOL) with counting quantifiers, and the DL ALCSCC, which is not a fragment of FOL. As an auxiliary result, we prove that model counting in ALCSCC can be realized in a domain-liftable way.
APA, Harvard, Vancouver, ISO, and other styles
8

Borgwardt, Stefan, Felix Distel, and Rafael Peñaloza. Gödel Description Logics: Decidability in the Absence of the Finitely-Valued Model Property. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.199.

Full text
Abstract:
In the last few years there has been a large effort for analysing the computational properties of reasoning in fuzzy Description Logics. This has led to a number of papers studying the complexity of these logics, depending on their chosen semantics. Surprisingly, despite being arguably the simplest form of fuzzy semantics, not much is known about the complexity of reasoning in fuzzy DLs w.r.t. witnessed models over the Gödel t-norm. We show that in the logic G-IALC, reasoning cannot be restricted to finitely valued models in general. Despite this negative result, we also show that all the stan
APA, Harvard, Vancouver, ISO, and other styles
9

Mann, Val. Work and Health Logic Model. National Institute for Health and Care Research, 2024. https://doi.org/10.3310/nihropenres.1115244.1.

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

Borgwardt, Stefan, and Rafael Peñaloza. Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.188.

Full text
Abstract:
Fuzzy description logics can be used to model vague knowledge in application domains. This paper analyses the consistency and satisfiability problems in the description logic SHI with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of SHI, we provide upper complexity bounds that match the complexity of crisp reasoning.
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!