Bibliographies thématiques / Modal reasoning

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres
Actes de conférences
Rapports d'organisations

Littérature scientifique sur le sujet « Modal reasoning »

Auteur : Grafiati

Publié le 2 juin 2025

Mis à jour le 31 juillet 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Modal reasoning ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Modal reasoning"

Bell, Victoria A., and P. N. Johnson-Laird. "A Model Theory of Modal Reasoning." Cognitive Science 22, no. 1 (1998): 25–51. http://dx.doi.org/10.1207/s15516709cog2201_2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mišćević, Nenad. "Naturalism and Modal Reasoning." Grazer Philosophische Studien 49 (1994): 149–73. http://dx.doi.org/10.5840/gps1994/954910.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Goldvarg, Yevgeniya, and P. N. Johnson-Laird. "Illusions in modal reasoning." Memory & Cognition 28, no. 2 (2000): 282–94. http://dx.doi.org/10.3758/bf03213806.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Miščević, Nenad. "NATURALISM AND MODAL REASONING." Grazer Philosophische studien 49, no. 1 (1994): 149–73. http://dx.doi.org/10.1163/18756735-90000587.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Britz, Katarina, Thomas Meyer, and Ivan Varzinczak. "Preferential Reasoning for Modal Logics." Electronic Notes in Theoretical Computer Science 278 (November 2011): 55–69. http://dx.doi.org/10.1016/j.entcs.2011.10.006.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Marek, W., and M. Truszczyński. "Modal logic for default reasoning." Annals of Mathematics and Artificial Intelligence 1, no. 1-4 (1990): 275–302. http://dx.doi.org/10.1007/bf01531081.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Ule, Andrej. "Scepticism, context and modal reasoning." Acta Analytica 19, no. 33 (2004): 9–30. http://dx.doi.org/10.1007/s12136-004-1009-4.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Tian, Jia, Xun Chen, and Sheng-Ping Dong. "Multi-Modal Reasoning medical diagnosis system integrated with probabilistic reasoning." International Journal of Automation and Computing 2, no. 2 (2005): 134–43. http://dx.doi.org/10.1007/s11633-005-0134-x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

BENNETT, BRANDON. "Modal Logics for Qualitative Spatial Reasoning." Logic Journal of IGPL 4, no. 1 (1996): 23–45. http://dx.doi.org/10.1093/jigpal/4.1.23.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Tobies, S. "PSPACE Reasoning for Graded Modal Logics." Journal of Logic and Computation 11, no. 1 (2001): 85–106. http://dx.doi.org/10.1093/logcom/11.1.85.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "Modal reasoning"

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

Ben-Younes, Hedi. "Multi-modal representation learning towards visual reasoning." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS173.

Texte intégral

Résumé :

La quantité d'images présentes sur internet augmente considérablement, et il est nécessaire de développer des techniques permettant le traitement automatique de ces contenus. Alors que les méthodes de reconnaissance visuelle sont de plus en plus évoluées, la communauté scientifique s'intéresse désormais à des systèmes aux capacités de raisonnement plus poussées. Dans cette thèse, nous nous intéressons au Visual Question Answering (VQA), qui consiste en la conception de systèmes capables de répondre à une question portant sur une image. Classiquement, ces architectures sont conçues comme des sy

Styles APA, Harvard, Vancouver, ISO, etc.

VASCONCELOS, DAVI ROMERO DE. "FIRST-ORDER MODAL LOGIC FOR REASONING ABOUT GAMES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2007. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10082@1.

Texte intégral

Résumé :

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>O termo jogo tem sido utilizado como uma metáfora, em várias áreas do conhecimento, para modelar e analisar situações onde agentes(jogadores) interagem em ambientes compartilhados para a realização de seus objetivos sejam eles individuais ou coletivos. Existem diversos modelos propostos para jogos por diferentes áreas do conhecimento, tais como matemática, ciência da computação, ciência política e social, entre outras. Dentre as diversas formas de modelar jogo

Styles APA, Harvard, Vancouver, ISO, etc.

Castellini, Claudio. "Automated reasoning in quantified modal and temporal logics." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/753.

Texte intégral

Résumé :

This thesis is about automated reasoning in quantified modal and temporal logics, with an application to formal methods. Quantified modal and temporal logics are extensions of classical first-order logic in which the notion of truth is extended to take into account its necessity or equivalently, in the temporal setting, its persistence through time. Due to their high complexity, these logics are less widely known and studied than their propositional counterparts. Moreover, little so far is known about their mechanisability and usefulness for formal methods. The relevant contributions of this t

Styles APA, Harvard, Vancouver, ISO, etc.

KOZHEMIACHENKO, Daniil. "Paraconsistent and fuzzy modal logics for reasoning about uncertainty." Electronic Thesis or Diss., Bourges, INSA Centre Val de Loire, 2023. http://www.theses.fr/2023ISAB0014.

Texte intégral

Résumé :

Ce manuscrit est dédié à l'étude des logiques modales floues qui formalisent le raisonnement (paraconsistant) sur l'incertitude. Ici, l'interprétation d'«information (données) incertain(es)» inclut toute combinaison des trois propriétés suivantes. Premièrement, l'information peur être quantifiée, i.e., la proposition est associée à un degré de vérité plutôt qu'une valeur de vérité. Deuxièmement, l'information peut être incomplète. Troisièmement, l'information peut être contradictoire.Toutes les logiques étudiees se divisent en deux groupes. Les plus «traditionnelles» dont la sémantique est con

Styles APA, Harvard, Vancouver, ISO, etc.

Tian, Jia. "Intelligent traditional Chinese medicine diagnosis support using multi modal reasoning." Thesis, University of Nottingham, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.442270.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

De, La Quintana Bruggemann Pablo Javier. "Automated reasoning for modal logics : a natural deduction based approach." Thesis, Imperial College London, 1989. http://hdl.handle.net/10044/1/47408.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Kramdi, Seifeddine. "A modal approach to model computational trust." Thesis, Toulouse 3, 2015. http://www.theses.fr/2015TOU30146/document.

Texte intégral

Résumé :

Le concept de confiance est un concept sociocognitif qui adresse la question de l'interaction dans les systèmes concurrents. Quand la complexité d'un système informatique prohibe l'utilisation de solutions traditionnelles de sécurité informatique en amont du processus de développement (solutions dites de type dur), la confiance est un concept candidat, pour le développement de systèmes d'aide à l'interaction. Dans cette thèse, notre but majeur est de présenter une vue d'ensemble de la discipline de la modélisation de la confiance dans les systèmes informatiques, et de proposer quelques modèles

Styles APA, Harvard, Vancouver, ISO, etc.

Ahmed, Mobyen Uddin. "A case-based multi-modal clinical system for stress management." Licentiate thesis, Mälardalen University, School of Innovation, Design and Engineering, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-8910.

Texte intégral

Résumé :

<p>A difficult issue in stress management is to use biomedical sensor signal in the diagnosis and treatment of stress. Clinicians often make their diagnosis and decision based on manual inspection of physiological signals such as, ECG, heart rate, finger temperature etc. However, the complexity associated with manual analysis and interpretation of the signals makes it difficult even for experienced clinicians. Today the diagnosis and decision is largely dependent on how experienced the clinician is interpreting the measurements. A computer-aided decision support system for diagnosis and treat

Styles APA, Harvard, Vancouver, ISO, etc.

Reker, Hilverd Geert. "Tableau-based reasoning for decidable fragments of first-order logic." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/tableaubased-reasoning-for-decidable-fragments-of-firstorder-logic(f47e0c7d-399d-48c9-8745-a907c5475f7d).html.

Texte intégral

Résumé :

Automated deduction procedures for modal logics, and related decidable fragments of first-order logic, are used in many real-world applications. A popular way of obtaining decision procedures for these logics is to base them on semantic tableau calculi. We focus on calculi that use unification, instead of the more widely employed approach of generating ground instantiations over the course of a derivation. The most common type of tableaux with unification are so-called free-variable tableaux, where variables are treated as global to the entire tableau. A long-standing open problem for procedur

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Livres sur le sujet "Modal reasoning"

Magnani, Lorenzo, and Nancy J. Nersessian, eds. Model-Based Reasoning. Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-0605-8.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Hannaford, Robert V. Moral anatomy and moral reasoning. University Press of Kansas, 1993.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Johnson, Conrad D. Moral legislation: A legal-political model for indirect consequentialist reasoning. Cambridge University Press, 1991.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Sykes, Karen, ed. Ethnographies of Moral Reasoning. Palgrave Macmillan US, 2009. http://dx.doi.org/10.1057/9780230617957.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Kvalnes, øyvind. Moral Reasoning at Work. Palgrave Macmillan UK, 2015. http://dx.doi.org/10.1057/9781137532619.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Kvalnes, Øyvind. Moral Reasoning at Work. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-15191-1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

M, Fulford K. W., Gillett Grant 1950-, and Soskice Janet Martin, eds. Medicine and moral reasoning. Cambridge University Press, 1994.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Knowlton, Steven R. Moral reasoning for journalists. 2nd ed. Praeger Publishers, 2008.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Yli-Luoma, Pertti V. J. Predictors of moral reasoning. Almqvist & Wiksell International, 1990.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

M, Fulford K. W., Gillett Grant 1950-, and Soskice Janet Martin, eds. Medicine and moral reasoning. Cambridge University Press, 1994.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Chapitres de livres sur le sujet "Modal reasoning"

Xu, Yiming, and Michael Norrish. "Mechanised Modal Model Theory." In Automated Reasoning. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51074-9_30.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Hustadt, Ullrich, Fabio Papacchini, Cláudia Nalon, and Clare Dixon. "Model Construction for Modal Clauses." In Automated Reasoning. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63501-4_1.

Texte intégral

Résumé :

AbstractWe present deterministic model construction algorithms for sets of modal clauses saturated with respect to three refinements of the modal-layered resolution calculus implemented in the prover "Image missing". The model construction algorithms are inspired by the Bachmair-Ganzinger method for constructing a model for a set of ground first-order clauses saturated with respect to ordered resolution with selection. The challenge is that the inference rules of the modal-layered resolution calculus for modal operators are more restrictive than an adaptation of ordered resolution with selecti

Styles APA, Harvard, Vancouver, ISO, etc.

Bílková, Marta, Sabine Frittella, and Daniil Kozhemiachenko. "Paraconsistent Gödel Modal Logic." In Automated Reasoning. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_26.

Texte intégral

Résumé :

AbstractWe introduce a paraconsistent modal logic $$\mathbf {K}\mathsf {G}^2$$ K G 2 , based on Gödel logic with coimplication (bi-Gödel logic) expanded with a De Morgan negation $$\lnot $$ ¬ . We use the logic to formalise reasoning with graded, incomplete and inconsistent information. Semantics of $$\mathbf {K}\mathsf {G}^2$$ K G 2 is two-dimensional: we interpret $$\mathbf {K}\mathsf {G}^2$$ K G 2 on crisp frames with two valuations $$v_1$$ v 1 and $$v_2$$ v 2 , connected via $$\lnot $$ ¬ , that assign to each formula two values from the real-valued interval [0, 1]. The first (resp., second

Styles APA, Harvard, Vancouver, ISO, etc.

Governatori, Guido. "Modal Rules: Extending Defeasible Logic with Modal Operators." In Rules and Reasoning. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99906-7_2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Pattinson, Dirk, and Cláudia Nalon. "Non-iterative Modal Resolution Calculi." In Automated Reasoning. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63501-4_6.

Texte intégral

Résumé :

AbstractNon-monotonic modal logics are typically interpreted over neighbourhood frames. For unary operators, this is just a set of worlds, together with an endofunction on predicates (subsets of worlds). It is known that all systems of not necessarily monotonic modal logics that are axiomatised by formulae of modal rank at most one (non-iterative modal logics) are Kripke-complete over neighbourhood semantics. In this paper, we give a uniform construction to obtain complete resolution calculi for all non-iterative logics. We show completeness for generative calculi (where new clauses with new l

Styles APA, Harvard, Vancouver, ISO, etc.

Papacchini, Fabio, and Renate A. Schmidt. "Terminating Minimal Model Generation Procedures for Propositional Modal Logics." In Automated Reasoning. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08587-6_30.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Balbiani, Philippe, Luis Fariñas del Cerro, Tinko Tinchev, and Dimiter Vakarelov. "Geometrical structures and modal logic." In Practical Reasoning. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61313-7_62.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Demri, Stéphane, and Denis Lugiez. "Presburger Modal Logic Is PSPACE-Complete." In Automated Reasoning. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11814771_44.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nalon, Cláudia, Ullrich Hustadt, Fabio Papacchini, and Clare Dixon. "Local Reductions for the Modal Cube." In Automated Reasoning. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_29.

Texte intégral

Résumé :

AbstractThe modal logic $${\mathsf {K}}$$ K is commonly used to represent and reason about necessity and possibility and its extensions with combinations of additional axioms are used to represent knowledge, belief, desires and intentions. Here we present local reductions of all propositional modal logics in the so-called modal cube, that is, extensions of $${\mathsf {K}}$$ K with arbitrary combinations of the axioms $${\mathsf {B}}$$ B , $${\mathsf {D}}$$ D , $${\mathsf {T}}$$ T , $${\mathsf {4}}$$ 4 and $${\mathsf {5}}$$ 5 to a normal form comprising a formula and the set of modal levels it

Styles APA, Harvard, Vancouver, ISO, etc.

Balbiani, Philippe. "Modal logics with relative accessibility relations." In Practical Reasoning. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61313-7_61.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Modal reasoning"

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.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Holliday, Wesley H., Matthew Mandelkern, and Cedegao E. Zhang. "Conditional and Modal Reasoning in Large Language Models." In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.emnlp-main.222.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Cui, Wanqing, Keping Bi, Jiafeng Guo, and Xueqi Cheng. "MORE: Multi-mOdal REtrieval Augmented Generative Commonsense Reasoning." In Findings of the Association for Computational Linguistics ACL 2024. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.findings-acl.69.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Zheng, Qi. "Cross-Modal Contrastive Learning for Robust Reasoning in VQA." In 2024 7th International Conference on Pattern Recognition and Artificial Intelligence (PRAI). IEEE, 2024. https://doi.org/10.1109/prai62207.2024.10826861.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Xu, Jinxuan, Shiyu Jin, Yutian Lei, Yuqian Zhang, and Liangjun Zhang. "RT-Grasp: Reasoning Tuning Robotic Grasping via Multi-modal Large Language Model." In 2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2024. https://doi.org/10.1109/iros58592.2024.10801718.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

Tulbure, Andrei A., Dermina P. Danciu, Eva H. Dulf, and Adrian A. Tulbure. "A study on multi-modal LLM reasoning for defect detection." In 2024 IEEE 30th International Symposium for Design and Technology in Electronic Packaging (SIITME). IEEE, 2024. https://doi.org/10.1109/siitme63973.2024.10814831.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Résumé :

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-

Styles APA, Harvard, Vancouver, ISO, etc.

Mi, Wenfeng, He Chen, and Weipeng Liu. "Hierarchical Interpretable Vision Reasoning Driven Through a Multi-Modal Large Language Model for Depth Estimation." In 2024 China Automation Congress (CAC). IEEE, 2024. https://doi.org/10.1109/cac63892.2024.10865484.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Modal reasoning"

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.

Texte intégral

Résumé :

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.

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Résumé :

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, whe

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

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

Texte intégral

Résumé :

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

Styles APA, Harvard, Vancouver, ISO, etc.

Davis, Randall, and Walter C. Hamscher. Model-Based Reasoning: Troubleshooting. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada201614.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Berezin, Sergey, Sergio Campos, and Edmund M. Clarke. Compositional Reasoning in Model Checking. Defense Technical Information Center, 1998. http://dx.doi.org/10.21236/ada339195.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Bénabou, Roland, Armin Falk, and Jean Tirole. Narratives, Imperatives, and Moral Reasoning. National Bureau of Economic Research, 2018. http://dx.doi.org/10.3386/w24798.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

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.

Texte intégral

Résumé :

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.

Styles APA, Harvard, Vancouver, ISO, etc.

Horrocks, Ian, and Ulrike Sattler. Optimised Reasoning for SHIQ. Aachen University of Technology, 2001. http://dx.doi.org/10.25368/2022.118.

Texte intégral

Résumé :

The tableau algorithm implemented in the FaCT knowledge representation system decides satisfiability and subsumption in SHIQ, a very expressive description logic providing, e.g., inverse and transitive roles, number restrictions, and general axioms. Intuitively, the algorithm searches for a tree-shaped abstraction of a model. To ensure termination of this algorithm without comprimising correctness, it stops expanding paths in the search tree using a so-called 'double-blocking' condition.

Styles APA, Harvard, Vancouver, ISO, etc.

Bhargava, Hemant K., and Ramayya Krishnan. Reasoning with Assumptions, Defeasibly, in Model Formulation. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada242734.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!